java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/string_concat-noarr.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:50:02,623 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:50:02,625 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:50:02,638 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:50:02,639 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:50:02,640 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:50:02,641 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:50:02,643 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:50:02,645 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:50:02,646 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:50:02,647 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:50:02,647 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:50:02,648 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:50:02,649 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:50:02,651 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:50:02,652 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:50:02,652 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:50:02,654 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:50:02,657 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:50:02,659 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:50:02,660 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:50:02,661 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:50:02,664 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:50:02,664 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:50:02,665 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:50:02,666 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:50:02,667 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:50:02,668 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:50:02,669 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:50:02,670 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:50:02,670 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:50:02,671 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:50:02,671 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:50:02,671 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:50:02,672 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:50:02,673 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:50:02,673 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 13:50:02,687 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:50:02,688 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:50:02,689 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:50:02,689 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:50:02,689 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:50:02,690 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:50:02,690 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:50:02,690 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:50:02,736 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:50:02,749 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:50:02,753 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:50:02,755 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:50:02,756 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:50:02,757 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/string_concat-noarr.i_3.bpl [2018-07-23 13:50:02,757 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/string_concat-noarr.i_3.bpl' [2018-07-23 13:50:02,828 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:50:02,831 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:50:02,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:50:02,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:50:02,832 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:50:02,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:02" (1/1) ... [2018-07-23 13:50:02,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:02" (1/1) ... [2018-07-23 13:50:02,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:02" (1/1) ... [2018-07-23 13:50:02,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:02" (1/1) ... [2018-07-23 13:50:02,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:02" (1/1) ... [2018-07-23 13:50:02,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:02" (1/1) ... [2018-07-23 13:50:02,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:02" (1/1) ... [2018-07-23 13:50:02,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:50:02,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:50:02,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:50:02,884 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:50:02,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:02" (1/1) ... [2018-07-23 13:50:02,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 13:50:02,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 13:50:03,102 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 13:50:03,102 INFO L202 PluginConnector]: Adding new model string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:50:03 BoogieIcfgContainer [2018-07-23 13:50:03,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:50:03,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:50:03,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:50:03,108 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:50:03,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:02" (1/2) ... [2018-07-23 13:50:03,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511987b8 and model type string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:50:03, skipping insertion in model container [2018-07-23 13:50:03,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:50:03" (2/2) ... [2018-07-23 13:50:03,112 INFO L112 eAbstractionObserver]: Analyzing ICFG string_concat-noarr.i_3.bpl [2018-07-23 13:50:03,123 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:50:03,131 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:50:03,187 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:50:03,188 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:50:03,188 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:50:03,188 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:50:03,189 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:50:03,189 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:50:03,189 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:50:03,189 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:50:03,189 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:50:03,208 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-23 13:50:03,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:50:03,219 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:03,221 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:50:03,222 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:03,229 INFO L82 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2018-07-23 13:50:03,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:03,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:03,366 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:50:03,367 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 13:50:03,369 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:03,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:03,370 INFO L185 omatonBuilderFactory]: Interpolants [9#true, 10#false, 11#(<= ULTIMATE.start_main_~i~5 0)] [2018-07-23 13:50:03,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:03,373 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:50:03,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:50:03,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:50:03,396 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-07-23 13:50:03,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:03,440 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-07-23 13:50:03,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:50:03,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-07-23 13:50:03,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:03,467 INFO L225 Difference]: With dead ends: 10 [2018-07-23 13:50:03,467 INFO L226 Difference]: Without dead ends: 7 [2018-07-23 13:50:03,474 INFO L575 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-07-23 13:50:03,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-23 13:50:03,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-23 13:50:03,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 13:50:03,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-23 13:50:03,518 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-23 13:50:03,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:03,519 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-23 13:50:03,519 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:50:03,519 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-23 13:50:03,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:50:03,520 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:03,520 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-23 13:50:03,521 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:03,521 INFO L82 PathProgramCache]: Analyzing trace with hash 889531649, now seen corresponding path program 1 times [2018-07-23 13:50:03,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:03,555 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:03,555 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 13:50:03,555 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:03,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:03,556 INFO L185 omatonBuilderFactory]: Interpolants [48#(<= ULTIMATE.start_main_~i~5 0), 49#(<= ULTIMATE.start_main_~i~5 1), 46#true, 47#false] [2018-07-23 13:50:03,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:03,558 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:50:03,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:50:03,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:50:03,559 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-07-23 13:50:03,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:03,582 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-23 13:50:03,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:50:03,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-07-23 13:50:03,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:03,583 INFO L225 Difference]: With dead ends: 11 [2018-07-23 13:50:03,584 INFO L226 Difference]: Without dead ends: 9 [2018-07-23 13:50:03,585 INFO L575 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-07-23 13:50:03,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-23 13:50:03,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-23 13:50:03,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 13:50:03,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-23 13:50:03,589 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-23 13:50:03,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:03,589 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-23 13:50:03,589 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:50:03,590 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-23 13:50:03,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:50:03,590 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:03,590 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-23 13:50:03,591 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:03,591 INFO L82 PathProgramCache]: Analyzing trace with hash 141355773, now seen corresponding path program 2 times [2018-07-23 13:50:03,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:03,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:03,632 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:03,632 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:50:03,633 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:03,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:03,633 INFO L185 omatonBuilderFactory]: Interpolants [90#true, 91#false, 92#(<= ULTIMATE.start_main_~i~5 0), 93#(<= ULTIMATE.start_main_~i~5 1), 94#(<= ULTIMATE.start_main_~i~5 2)] [2018-07-23 13:50:03,633 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:03,634 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:50:03,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:50:03,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:50:03,635 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-07-23 13:50:03,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:03,669 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-23 13:50:03,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:50:03,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-07-23 13:50:03,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:03,677 INFO L225 Difference]: With dead ends: 13 [2018-07-23 13:50:03,677 INFO L226 Difference]: Without dead ends: 11 [2018-07-23 13:50:03,678 INFO L575 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-07-23 13:50:03,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-23 13:50:03,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-23 13:50:03,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 13:50:03,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 13:50:03,685 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-23 13:50:03,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:03,685 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 13:50:03,685 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:50:03,686 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 13:50:03,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:50:03,688 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:03,689 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-23 13:50:03,689 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:03,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1596122631, now seen corresponding path program 3 times [2018-07-23 13:50:03,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:03,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:03,785 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:03,785 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:50:03,786 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:03,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:03,786 INFO L185 omatonBuilderFactory]: Interpolants [144#false, 145#(<= ULTIMATE.start_main_~i~5 0), 146#(<= ULTIMATE.start_main_~i~5 1), 147#(<= ULTIMATE.start_main_~i~5 2), 148#(<= ULTIMATE.start_main_~i~5 3), 143#true] [2018-07-23 13:50:03,787 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:03,787 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:50:03,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:50:03,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:50:03,791 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-07-23 13:50:03,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:03,820 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-23 13:50:03,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:50:03,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-07-23 13:50:03,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:03,821 INFO L225 Difference]: With dead ends: 15 [2018-07-23 13:50:03,821 INFO L226 Difference]: Without dead ends: 13 [2018-07-23 13:50:03,822 INFO L575 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-07-23 13:50:03,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-23 13:50:03,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-23 13:50:03,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 13:50:03,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-23 13:50:03,829 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-07-23 13:50:03,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:03,830 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-23 13:50:03,830 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:50:03,831 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-23 13:50:03,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:50:03,831 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:03,831 INFO L357 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-07-23 13:50:03,832 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:03,832 INFO L82 PathProgramCache]: Analyzing trace with hash -570590731, now seen corresponding path program 4 times [2018-07-23 13:50:03,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:03,879 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:03,880 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:03,880 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:50:03,880 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:03,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:03,881 INFO L185 omatonBuilderFactory]: Interpolants [208#(<= ULTIMATE.start_main_~i~5 1), 209#(<= ULTIMATE.start_main_~i~5 2), 210#(<= ULTIMATE.start_main_~i~5 3), 211#(<= ULTIMATE.start_main_~i~5 4), 205#true, 206#false, 207#(<= ULTIMATE.start_main_~i~5 0)] [2018-07-23 13:50:03,881 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:03,881 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:50:03,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:50:03,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:50:03,883 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-07-23 13:50:03,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:03,912 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-23 13:50:03,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:50:03,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-07-23 13:50:03,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:03,915 INFO L225 Difference]: With dead ends: 17 [2018-07-23 13:50:03,916 INFO L226 Difference]: Without dead ends: 15 [2018-07-23 13:50:03,919 INFO L575 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-07-23 13:50:03,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-23 13:50:03,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-23 13:50:03,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-23 13:50:03,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-23 13:50:03,924 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-07-23 13:50:03,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:03,927 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-23 13:50:03,927 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:50:03,927 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-23 13:50:03,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:50:03,928 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:03,928 INFO L357 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-07-23 13:50:03,929 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:03,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1418054385, now seen corresponding path program 5 times [2018-07-23 13:50:03,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:04,030 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:04,030 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:04,031 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:50:04,031 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:04,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:04,032 INFO L185 omatonBuilderFactory]: Interpolants [276#true, 277#false, 278#(<= ULTIMATE.start_main_~i~5 0), 279#(<= ULTIMATE.start_main_~i~5 1), 280#(<= ULTIMATE.start_main_~i~5 2), 281#(<= ULTIMATE.start_main_~i~5 3), 282#(<= ULTIMATE.start_main_~i~5 4), 283#(<= ULTIMATE.start_main_~i~5 5)] [2018-07-23 13:50:04,032 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:04,032 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:50:04,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:50:04,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:50:04,033 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-07-23 13:50:04,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:04,077 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-23 13:50:04,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 13:50:04,079 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-23 13:50:04,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:04,080 INFO L225 Difference]: With dead ends: 19 [2018-07-23 13:50:04,080 INFO L226 Difference]: Without dead ends: 17 [2018-07-23 13:50:04,081 INFO L575 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-07-23 13:50:04,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-23 13:50:04,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-23 13:50:04,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-23 13:50:04,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-23 13:50:04,089 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-07-23 13:50:04,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:04,089 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-23 13:50:04,090 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:50:04,090 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-23 13:50:04,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:50:04,090 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:04,090 INFO L357 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-07-23 13:50:04,091 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:04,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1245564141, now seen corresponding path program 6 times [2018-07-23 13:50:04,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:04,187 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:04,188 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:04,188 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:50:04,188 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:04,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:04,193 INFO L185 omatonBuilderFactory]: Interpolants [356#true, 357#false, 358#(<= ULTIMATE.start_main_~i~5 0), 359#(<= ULTIMATE.start_main_~i~5 1), 360#(<= ULTIMATE.start_main_~i~5 2), 361#(<= ULTIMATE.start_main_~i~5 3), 362#(<= ULTIMATE.start_main_~i~5 4), 363#(<= ULTIMATE.start_main_~i~5 5), 364#(<= ULTIMATE.start_main_~i~5 6)] [2018-07-23 13:50:04,193 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:04,194 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:50:04,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:50:04,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:50:04,198 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-07-23 13:50:04,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:04,236 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-23 13:50:04,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:50:04,236 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-23 13:50:04,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:04,237 INFO L225 Difference]: With dead ends: 21 [2018-07-23 13:50:04,237 INFO L226 Difference]: Without dead ends: 19 [2018-07-23 13:50:04,238 INFO L575 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-07-23 13:50:04,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-23 13:50:04,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-23 13:50:04,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-23 13:50:04,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-23 13:50:04,244 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-07-23 13:50:04,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:04,245 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-23 13:50:04,245 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:50:04,245 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-23 13:50:04,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:50:04,247 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:04,247 INFO L357 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-07-23 13:50:04,247 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:04,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1308803095, now seen corresponding path program 7 times [2018-07-23 13:50:04,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:04,310 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:04,311 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:04,311 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:50:04,311 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:04,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:04,312 INFO L185 omatonBuilderFactory]: Interpolants [448#(<= ULTIMATE.start_main_~i~5 1), 449#(<= ULTIMATE.start_main_~i~5 2), 450#(<= ULTIMATE.start_main_~i~5 3), 451#(<= ULTIMATE.start_main_~i~5 4), 452#(<= ULTIMATE.start_main_~i~5 5), 453#(<= ULTIMATE.start_main_~i~5 6), 454#(<= ULTIMATE.start_main_~i~5 7), 445#true, 446#false, 447#(<= ULTIMATE.start_main_~i~5 0)] [2018-07-23 13:50:04,312 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:04,313 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:50:04,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:50:04,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:50:04,314 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-07-23 13:50:04,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:04,358 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-23 13:50:04,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:50:04,358 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-23 13:50:04,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:04,361 INFO L225 Difference]: With dead ends: 23 [2018-07-23 13:50:04,362 INFO L226 Difference]: Without dead ends: 21 [2018-07-23 13:50:04,362 INFO L575 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-07-23 13:50:04,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-23 13:50:04,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-23 13:50:04,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-23 13:50:04,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-23 13:50:04,371 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-07-23 13:50:04,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:04,371 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-23 13:50:04,374 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:50:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-23 13:50:04,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:50:04,377 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:04,377 INFO L357 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-07-23 13:50:04,377 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:04,378 INFO L82 PathProgramCache]: Analyzing trace with hash 665576421, now seen corresponding path program 8 times [2018-07-23 13:50:04,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:04,434 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:04,434 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:04,434 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:50:04,435 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:04,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:04,435 INFO L185 omatonBuilderFactory]: Interpolants [544#false, 545#(<= ULTIMATE.start_main_~i~5 0), 546#(<= ULTIMATE.start_main_~i~5 1), 547#(<= ULTIMATE.start_main_~i~5 2), 548#(<= ULTIMATE.start_main_~i~5 3), 549#(<= ULTIMATE.start_main_~i~5 4), 550#(<= ULTIMATE.start_main_~i~5 5), 551#(<= ULTIMATE.start_main_~i~5 6), 552#(<= ULTIMATE.start_main_~i~5 7), 553#(<= ULTIMATE.start_main_~i~5 8), 543#true] [2018-07-23 13:50:04,436 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:04,436 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:50:04,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:50:04,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:50:04,437 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-07-23 13:50:04,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:04,458 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-23 13:50:04,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:50:04,459 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-23 13:50:04,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:04,460 INFO L225 Difference]: With dead ends: 25 [2018-07-23 13:50:04,460 INFO L226 Difference]: Without dead ends: 23 [2018-07-23 13:50:04,462 INFO L575 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-07-23 13:50:04,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-23 13:50:04,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-23 13:50:04,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-23 13:50:04,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-23 13:50:04,469 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-07-23 13:50:04,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:04,470 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-23 13:50:04,470 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:50:04,470 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-23 13:50:04,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:50:04,471 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:04,471 INFO L357 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-07-23 13:50:04,471 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:04,471 INFO L82 PathProgramCache]: Analyzing trace with hash -331253535, now seen corresponding path program 9 times [2018-07-23 13:50:04,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:04,522 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:04,523 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:04,523 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:50:04,523 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:04,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:04,524 INFO L185 omatonBuilderFactory]: Interpolants [656#(<= ULTIMATE.start_main_~i~5 4), 657#(<= ULTIMATE.start_main_~i~5 5), 658#(<= ULTIMATE.start_main_~i~5 6), 659#(<= ULTIMATE.start_main_~i~5 7), 660#(<= ULTIMATE.start_main_~i~5 8), 661#(<= ULTIMATE.start_main_~i~5 9), 650#true, 651#false, 652#(<= ULTIMATE.start_main_~i~5 0), 653#(<= ULTIMATE.start_main_~i~5 1), 654#(<= ULTIMATE.start_main_~i~5 2), 655#(<= ULTIMATE.start_main_~i~5 3)] [2018-07-23 13:50:04,524 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:04,525 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:50:04,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:50:04,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:50:04,526 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2018-07-23 13:50:04,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:04,568 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-23 13:50:04,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:50:04,568 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-07-23 13:50:04,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:04,569 INFO L225 Difference]: With dead ends: 27 [2018-07-23 13:50:04,572 INFO L226 Difference]: Without dead ends: 25 [2018-07-23 13:50:04,573 INFO L575 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-07-23 13:50:04,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-23 13:50:04,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-23 13:50:04,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-23 13:50:04,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-23 13:50:04,588 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-07-23 13:50:04,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:04,589 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-23 13:50:04,589 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:50:04,590 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-23 13:50:04,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-23 13:50:04,590 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:04,591 INFO L357 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-07-23 13:50:04,591 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:04,591 INFO L82 PathProgramCache]: Analyzing trace with hash -507134243, now seen corresponding path program 10 times [2018-07-23 13:50:04,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:04,687 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:04,688 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:04,688 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:50:04,689 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:04,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:04,691 INFO L185 omatonBuilderFactory]: Interpolants [768#(<= ULTIMATE.start_main_~i~5 0), 769#(<= ULTIMATE.start_main_~i~5 1), 770#(<= ULTIMATE.start_main_~i~5 2), 771#(<= ULTIMATE.start_main_~i~5 3), 772#(<= ULTIMATE.start_main_~i~5 4), 773#(<= ULTIMATE.start_main_~i~5 5), 774#(<= ULTIMATE.start_main_~i~5 6), 775#(<= ULTIMATE.start_main_~i~5 7), 776#(<= ULTIMATE.start_main_~i~5 8), 777#(<= ULTIMATE.start_main_~i~5 9), 778#(<= ULTIMATE.start_main_~i~5 10), 766#true, 767#false] [2018-07-23 13:50:04,691 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:04,691 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:50:04,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:50:04,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:50:04,693 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2018-07-23 13:50:04,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:04,723 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-23 13:50:04,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:50:04,724 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-07-23 13:50:04,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:04,725 INFO L225 Difference]: With dead ends: 29 [2018-07-23 13:50:04,726 INFO L226 Difference]: Without dead ends: 27 [2018-07-23 13:50:04,726 INFO L575 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-07-23 13:50:04,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-23 13:50:04,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-23 13:50:04,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-23 13:50:04,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-23 13:50:04,732 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-07-23 13:50:04,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:04,732 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-23 13:50:04,733 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:50:04,733 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-23 13:50:04,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-23 13:50:04,734 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:04,734 INFO L357 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-07-23 13:50:04,734 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:04,735 INFO L82 PathProgramCache]: Analyzing trace with hash -2024770087, now seen corresponding path program 11 times [2018-07-23 13:50:04,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:04,811 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:04,812 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:04,812 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:50:04,812 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:04,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:04,813 INFO L185 omatonBuilderFactory]: Interpolants [896#(<= ULTIMATE.start_main_~i~5 3), 897#(<= ULTIMATE.start_main_~i~5 4), 898#(<= ULTIMATE.start_main_~i~5 5), 899#(<= ULTIMATE.start_main_~i~5 6), 900#(<= ULTIMATE.start_main_~i~5 7), 901#(<= ULTIMATE.start_main_~i~5 8), 902#(<= ULTIMATE.start_main_~i~5 9), 903#(<= ULTIMATE.start_main_~i~5 10), 904#(<= ULTIMATE.start_main_~i~5 11), 891#true, 892#false, 893#(<= ULTIMATE.start_main_~i~5 0), 894#(<= ULTIMATE.start_main_~i~5 1), 895#(<= ULTIMATE.start_main_~i~5 2)] [2018-07-23 13:50:04,813 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:04,814 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:50:04,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:50:04,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:50:04,815 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-07-23 13:50:04,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:04,853 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-23 13:50:04,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:50:04,854 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-07-23 13:50:04,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:04,855 INFO L225 Difference]: With dead ends: 31 [2018-07-23 13:50:04,855 INFO L226 Difference]: Without dead ends: 29 [2018-07-23 13:50:04,857 INFO L575 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-07-23 13:50:04,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-23 13:50:04,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-23 13:50:04,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-23 13:50:04,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-23 13:50:04,865 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-07-23 13:50:04,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:04,867 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-23 13:50:04,867 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:50:04,867 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-23 13:50:04,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-23 13:50:04,871 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:04,872 INFO L357 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-07-23 13:50:04,872 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:04,873 INFO L82 PathProgramCache]: Analyzing trace with hash -183935531, now seen corresponding path program 12 times [2018-07-23 13:50:04,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:04,937 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:04,937 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:04,938 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 13:50:04,938 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:04,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:04,939 INFO L185 omatonBuilderFactory]: Interpolants [1025#true, 1026#false, 1027#(<= ULTIMATE.start_main_~i~5 0), 1028#(<= ULTIMATE.start_main_~i~5 1), 1029#(<= ULTIMATE.start_main_~i~5 2), 1030#(<= ULTIMATE.start_main_~i~5 3), 1031#(<= ULTIMATE.start_main_~i~5 4), 1032#(<= ULTIMATE.start_main_~i~5 5), 1033#(<= ULTIMATE.start_main_~i~5 6), 1034#(<= ULTIMATE.start_main_~i~5 7), 1035#(<= ULTIMATE.start_main_~i~5 8), 1036#(<= ULTIMATE.start_main_~i~5 9), 1037#(<= ULTIMATE.start_main_~i~5 10), 1038#(<= ULTIMATE.start_main_~i~5 11), 1039#(<= ULTIMATE.start_main_~i~5 12)] [2018-07-23 13:50:04,939 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:04,939 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 13:50:04,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 13:50:04,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:50:04,941 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-07-23 13:50:04,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:04,961 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-23 13:50:04,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:50:04,962 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-07-23 13:50:04,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:04,963 INFO L225 Difference]: With dead ends: 33 [2018-07-23 13:50:04,963 INFO L226 Difference]: Without dead ends: 31 [2018-07-23 13:50:04,963 INFO L575 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-07-23 13:50:04,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-23 13:50:04,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-23 13:50:04,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-23 13:50:04,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-23 13:50:04,969 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-07-23 13:50:04,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:04,969 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-23 13:50:04,969 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 13:50:04,970 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-23 13:50:04,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-23 13:50:04,971 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:04,971 INFO L357 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-07-23 13:50:04,971 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:04,971 INFO L82 PathProgramCache]: Analyzing trace with hash -668453167, now seen corresponding path program 13 times [2018-07-23 13:50:04,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:05,032 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:05,033 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:05,033 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 13:50:05,033 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:05,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:05,034 INFO L185 omatonBuilderFactory]: Interpolants [1168#true, 1169#false, 1170#(<= ULTIMATE.start_main_~i~5 0), 1171#(<= ULTIMATE.start_main_~i~5 1), 1172#(<= ULTIMATE.start_main_~i~5 2), 1173#(<= ULTIMATE.start_main_~i~5 3), 1174#(<= ULTIMATE.start_main_~i~5 4), 1175#(<= ULTIMATE.start_main_~i~5 5), 1176#(<= ULTIMATE.start_main_~i~5 6), 1177#(<= ULTIMATE.start_main_~i~5 7), 1178#(<= ULTIMATE.start_main_~i~5 8), 1179#(<= ULTIMATE.start_main_~i~5 9), 1180#(<= ULTIMATE.start_main_~i~5 10), 1181#(<= ULTIMATE.start_main_~i~5 11), 1182#(<= ULTIMATE.start_main_~i~5 12), 1183#(<= ULTIMATE.start_main_~i~5 13)] [2018-07-23 13:50:05,035 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:05,035 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 13:50:05,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 13:50:05,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:50:05,036 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-07-23 13:50:05,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:05,057 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-23 13:50:05,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:50:05,057 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-07-23 13:50:05,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:05,058 INFO L225 Difference]: With dead ends: 35 [2018-07-23 13:50:05,059 INFO L226 Difference]: Without dead ends: 33 [2018-07-23 13:50:05,059 INFO L575 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-07-23 13:50:05,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-23 13:50:05,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-23 13:50:05,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-23 13:50:05,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-23 13:50:05,065 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-07-23 13:50:05,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:05,066 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-23 13:50:05,066 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 13:50:05,066 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-23 13:50:05,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-23 13:50:05,067 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:05,067 INFO L357 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-07-23 13:50:05,068 INFO L414 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:05,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1861533901, now seen corresponding path program 14 times [2018-07-23 13:50:05,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:05,133 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:05,134 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:05,134 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-23 13:50:05,134 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:05,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:05,135 INFO L185 omatonBuilderFactory]: Interpolants [1320#true, 1321#false, 1322#(<= ULTIMATE.start_main_~i~5 0), 1323#(<= ULTIMATE.start_main_~i~5 1), 1324#(<= ULTIMATE.start_main_~i~5 2), 1325#(<= ULTIMATE.start_main_~i~5 3), 1326#(<= ULTIMATE.start_main_~i~5 4), 1327#(<= ULTIMATE.start_main_~i~5 5), 1328#(<= ULTIMATE.start_main_~i~5 6), 1329#(<= ULTIMATE.start_main_~i~5 7), 1330#(<= ULTIMATE.start_main_~i~5 8), 1331#(<= ULTIMATE.start_main_~i~5 9), 1332#(<= ULTIMATE.start_main_~i~5 10), 1333#(<= ULTIMATE.start_main_~i~5 11), 1334#(<= ULTIMATE.start_main_~i~5 12), 1335#(<= ULTIMATE.start_main_~i~5 13), 1336#(<= ULTIMATE.start_main_~i~5 14)] [2018-07-23 13:50:05,135 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:05,136 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 13:50:05,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 13:50:05,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:50:05,137 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2018-07-23 13:50:05,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:05,158 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-23 13:50:05,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:50:05,159 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-07-23 13:50:05,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:05,160 INFO L225 Difference]: With dead ends: 37 [2018-07-23 13:50:05,160 INFO L226 Difference]: Without dead ends: 35 [2018-07-23 13:50:05,161 INFO L575 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-07-23 13:50:05,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-23 13:50:05,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-23 13:50:05,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-23 13:50:05,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-23 13:50:05,166 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-07-23 13:50:05,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:05,167 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-23 13:50:05,167 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 13:50:05,167 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-23 13:50:05,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-23 13:50:05,168 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:05,168 INFO L357 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-07-23 13:50:05,168 INFO L414 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:05,169 INFO L82 PathProgramCache]: Analyzing trace with hash -2067350583, now seen corresponding path program 15 times [2018-07-23 13:50:05,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:05,254 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:05,254 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:05,255 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-23 13:50:05,255 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:05,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:05,259 INFO L185 omatonBuilderFactory]: Interpolants [1481#true, 1482#false, 1483#(<= ULTIMATE.start_main_~i~5 0), 1484#(<= ULTIMATE.start_main_~i~5 1), 1485#(<= ULTIMATE.start_main_~i~5 2), 1486#(<= ULTIMATE.start_main_~i~5 3), 1487#(<= ULTIMATE.start_main_~i~5 4), 1488#(<= ULTIMATE.start_main_~i~5 5), 1489#(<= ULTIMATE.start_main_~i~5 6), 1490#(<= ULTIMATE.start_main_~i~5 7), 1491#(<= ULTIMATE.start_main_~i~5 8), 1492#(<= ULTIMATE.start_main_~i~5 9), 1493#(<= ULTIMATE.start_main_~i~5 10), 1494#(<= ULTIMATE.start_main_~i~5 11), 1495#(<= ULTIMATE.start_main_~i~5 12), 1496#(<= ULTIMATE.start_main_~i~5 13), 1497#(<= ULTIMATE.start_main_~i~5 14), 1498#(<= ULTIMATE.start_main_~i~5 15)] [2018-07-23 13:50:05,259 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:05,260 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 13:50:05,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 13:50:05,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:50:05,261 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 18 states. [2018-07-23 13:50:05,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:05,286 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-23 13:50:05,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:50:05,286 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-07-23 13:50:05,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:05,287 INFO L225 Difference]: With dead ends: 39 [2018-07-23 13:50:05,287 INFO L226 Difference]: Without dead ends: 37 [2018-07-23 13:50:05,288 INFO L575 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-07-23 13:50:05,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-23 13:50:05,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-23 13:50:05,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-23 13:50:05,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-23 13:50:05,294 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-07-23 13:50:05,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:05,294 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-23 13:50:05,294 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 13:50:05,295 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-23 13:50:05,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-23 13:50:05,296 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:05,296 INFO L357 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-07-23 13:50:05,296 INFO L414 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:05,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1845880773, now seen corresponding path program 16 times [2018-07-23 13:50:05,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:05,371 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:05,372 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:05,372 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-23 13:50:05,372 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:05,373 INFO L185 omatonBuilderFactory]: Interpolants [1664#(<= ULTIMATE.start_main_~i~5 11), 1665#(<= ULTIMATE.start_main_~i~5 12), 1666#(<= ULTIMATE.start_main_~i~5 13), 1667#(<= ULTIMATE.start_main_~i~5 14), 1668#(<= ULTIMATE.start_main_~i~5 15), 1669#(<= ULTIMATE.start_main_~i~5 16), 1651#true, 1652#false, 1653#(<= ULTIMATE.start_main_~i~5 0), 1654#(<= ULTIMATE.start_main_~i~5 1), 1655#(<= ULTIMATE.start_main_~i~5 2), 1656#(<= ULTIMATE.start_main_~i~5 3), 1657#(<= ULTIMATE.start_main_~i~5 4), 1658#(<= ULTIMATE.start_main_~i~5 5), 1659#(<= ULTIMATE.start_main_~i~5 6), 1660#(<= ULTIMATE.start_main_~i~5 7), 1661#(<= ULTIMATE.start_main_~i~5 8), 1662#(<= ULTIMATE.start_main_~i~5 9), 1663#(<= ULTIMATE.start_main_~i~5 10)] [2018-07-23 13:50:05,374 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:05,375 INFO L450 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-23 13:50:05,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-23 13:50:05,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:50:05,376 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 19 states. [2018-07-23 13:50:05,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:05,398 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-23 13:50:05,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:50:05,399 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-07-23 13:50:05,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:05,400 INFO L225 Difference]: With dead ends: 41 [2018-07-23 13:50:05,400 INFO L226 Difference]: Without dead ends: 39 [2018-07-23 13:50:05,401 INFO L575 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-07-23 13:50:05,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-23 13:50:05,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-23 13:50:05,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-23 13:50:05,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-23 13:50:05,414 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-07-23 13:50:05,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:05,416 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-23 13:50:05,416 INFO L472 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-23 13:50:05,417 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-23 13:50:05,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-23 13:50:05,419 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:05,419 INFO L357 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-07-23 13:50:05,419 INFO L414 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:05,423 INFO L82 PathProgramCache]: Analyzing trace with hash 69862593, now seen corresponding path program 17 times [2018-07-23 13:50:05,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:05,526 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:05,526 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:05,526 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-23 13:50:05,527 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:05,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:05,528 INFO L185 omatonBuilderFactory]: Interpolants [1830#true, 1831#false, 1832#(<= ULTIMATE.start_main_~i~5 0), 1833#(<= ULTIMATE.start_main_~i~5 1), 1834#(<= ULTIMATE.start_main_~i~5 2), 1835#(<= ULTIMATE.start_main_~i~5 3), 1836#(<= ULTIMATE.start_main_~i~5 4), 1837#(<= ULTIMATE.start_main_~i~5 5), 1838#(<= ULTIMATE.start_main_~i~5 6), 1839#(<= ULTIMATE.start_main_~i~5 7), 1840#(<= ULTIMATE.start_main_~i~5 8), 1841#(<= ULTIMATE.start_main_~i~5 9), 1842#(<= ULTIMATE.start_main_~i~5 10), 1843#(<= ULTIMATE.start_main_~i~5 11), 1844#(<= ULTIMATE.start_main_~i~5 12), 1845#(<= ULTIMATE.start_main_~i~5 13), 1846#(<= ULTIMATE.start_main_~i~5 14), 1847#(<= ULTIMATE.start_main_~i~5 15), 1848#(<= ULTIMATE.start_main_~i~5 16), 1849#(<= ULTIMATE.start_main_~i~5 17)] [2018-07-23 13:50:05,528 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:05,529 INFO L450 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-23 13:50:05,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-23 13:50:05,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:50:05,530 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 20 states. [2018-07-23 13:50:05,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:05,555 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-23 13:50:05,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:50:05,556 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-07-23 13:50:05,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:05,557 INFO L225 Difference]: With dead ends: 43 [2018-07-23 13:50:05,557 INFO L226 Difference]: Without dead ends: 41 [2018-07-23 13:50:05,559 INFO L575 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-07-23 13:50:05,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-23 13:50:05,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-23 13:50:05,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-23 13:50:05,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-23 13:50:05,567 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-07-23 13:50:05,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:05,567 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-23 13:50:05,567 INFO L472 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-23 13:50:05,567 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-23 13:50:05,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-23 13:50:05,568 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:05,568 INFO L357 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-07-23 13:50:05,569 INFO L414 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:05,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1581591875, now seen corresponding path program 18 times [2018-07-23 13:50:05,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:05,668 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:05,668 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:05,669 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-23 13:50:05,669 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:05,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:05,670 INFO L185 omatonBuilderFactory]: Interpolants [2018#true, 2019#false, 2020#(<= ULTIMATE.start_main_~i~5 0), 2021#(<= ULTIMATE.start_main_~i~5 1), 2022#(<= ULTIMATE.start_main_~i~5 2), 2023#(<= ULTIMATE.start_main_~i~5 3), 2024#(<= ULTIMATE.start_main_~i~5 4), 2025#(<= ULTIMATE.start_main_~i~5 5), 2026#(<= ULTIMATE.start_main_~i~5 6), 2027#(<= ULTIMATE.start_main_~i~5 7), 2028#(<= ULTIMATE.start_main_~i~5 8), 2029#(<= ULTIMATE.start_main_~i~5 9), 2030#(<= ULTIMATE.start_main_~i~5 10), 2031#(<= ULTIMATE.start_main_~i~5 11), 2032#(<= ULTIMATE.start_main_~i~5 12), 2033#(<= ULTIMATE.start_main_~i~5 13), 2034#(<= ULTIMATE.start_main_~i~5 14), 2035#(<= ULTIMATE.start_main_~i~5 15), 2036#(<= ULTIMATE.start_main_~i~5 16), 2037#(<= ULTIMATE.start_main_~i~5 17), 2038#(<= ULTIMATE.start_main_~i~5 18)] [2018-07-23 13:50:05,670 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:05,671 INFO L450 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-23 13:50:05,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-23 13:50:05,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:50:05,674 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2018-07-23 13:50:05,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:05,708 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-23 13:50:05,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:50:05,708 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-07-23 13:50:05,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:05,709 INFO L225 Difference]: With dead ends: 45 [2018-07-23 13:50:05,709 INFO L226 Difference]: Without dead ends: 43 [2018-07-23 13:50:05,713 INFO L575 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-07-23 13:50:05,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-23 13:50:05,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-23 13:50:05,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-23 13:50:05,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-23 13:50:05,720 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-07-23 13:50:05,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:05,720 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-23 13:50:05,720 INFO L472 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-23 13:50:05,721 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-23 13:50:05,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-23 13:50:05,721 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:05,721 INFO L357 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-07-23 13:50:05,722 INFO L414 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:05,722 INFO L82 PathProgramCache]: Analyzing trace with hash 508563897, now seen corresponding path program 19 times [2018-07-23 13:50:05,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:05,822 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:05,822 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:05,823 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-23 13:50:05,823 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:05,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:05,824 INFO L185 omatonBuilderFactory]: Interpolants [2215#true, 2216#false, 2217#(<= ULTIMATE.start_main_~i~5 0), 2218#(<= ULTIMATE.start_main_~i~5 1), 2219#(<= ULTIMATE.start_main_~i~5 2), 2220#(<= ULTIMATE.start_main_~i~5 3), 2221#(<= ULTIMATE.start_main_~i~5 4), 2222#(<= ULTIMATE.start_main_~i~5 5), 2223#(<= ULTIMATE.start_main_~i~5 6), 2224#(<= ULTIMATE.start_main_~i~5 7), 2225#(<= ULTIMATE.start_main_~i~5 8), 2226#(<= ULTIMATE.start_main_~i~5 9), 2227#(<= ULTIMATE.start_main_~i~5 10), 2228#(<= ULTIMATE.start_main_~i~5 11), 2229#(<= ULTIMATE.start_main_~i~5 12), 2230#(<= ULTIMATE.start_main_~i~5 13), 2231#(<= ULTIMATE.start_main_~i~5 14), 2232#(<= ULTIMATE.start_main_~i~5 15), 2233#(<= ULTIMATE.start_main_~i~5 16), 2234#(<= ULTIMATE.start_main_~i~5 17), 2235#(<= ULTIMATE.start_main_~i~5 18), 2236#(<= ULTIMATE.start_main_~i~5 19)] [2018-07-23 13:50:05,827 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:05,827 INFO L450 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-23 13:50:05,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-23 13:50:05,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-23 13:50:05,828 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2018-07-23 13:50:05,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:05,860 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-23 13:50:05,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:50:05,861 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-07-23 13:50:05,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:05,861 INFO L225 Difference]: With dead ends: 47 [2018-07-23 13:50:05,861 INFO L226 Difference]: Without dead ends: 45 [2018-07-23 13:50:05,862 INFO L575 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-07-23 13:50:05,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-23 13:50:05,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-23 13:50:05,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-23 13:50:05,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-23 13:50:05,872 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-07-23 13:50:05,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:05,875 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-23 13:50:05,875 INFO L472 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-23 13:50:05,876 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-23 13:50:05,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-23 13:50:05,876 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:05,876 INFO L357 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-07-23 13:50:05,877 INFO L414 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:05,877 INFO L82 PathProgramCache]: Analyzing trace with hash -896433739, now seen corresponding path program 20 times [2018-07-23 13:50:05,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:05,974 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:05,974 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:05,975 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-23 13:50:05,975 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:05,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:05,976 INFO L185 omatonBuilderFactory]: Interpolants [2432#(<= ULTIMATE.start_main_~i~5 9), 2433#(<= ULTIMATE.start_main_~i~5 10), 2434#(<= ULTIMATE.start_main_~i~5 11), 2435#(<= ULTIMATE.start_main_~i~5 12), 2436#(<= ULTIMATE.start_main_~i~5 13), 2437#(<= ULTIMATE.start_main_~i~5 14), 2438#(<= ULTIMATE.start_main_~i~5 15), 2439#(<= ULTIMATE.start_main_~i~5 16), 2440#(<= ULTIMATE.start_main_~i~5 17), 2441#(<= ULTIMATE.start_main_~i~5 18), 2442#(<= ULTIMATE.start_main_~i~5 19), 2443#(<= ULTIMATE.start_main_~i~5 20), 2421#true, 2422#false, 2423#(<= ULTIMATE.start_main_~i~5 0), 2424#(<= ULTIMATE.start_main_~i~5 1), 2425#(<= ULTIMATE.start_main_~i~5 2), 2426#(<= ULTIMATE.start_main_~i~5 3), 2427#(<= ULTIMATE.start_main_~i~5 4), 2428#(<= ULTIMATE.start_main_~i~5 5), 2429#(<= ULTIMATE.start_main_~i~5 6), 2430#(<= ULTIMATE.start_main_~i~5 7), 2431#(<= ULTIMATE.start_main_~i~5 8)] [2018-07-23 13:50:05,976 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:05,977 INFO L450 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-23 13:50:05,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-23 13:50:05,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:50:05,979 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 23 states. [2018-07-23 13:50:06,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:06,002 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-23 13:50:06,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:50:06,003 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-07-23 13:50:06,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:06,005 INFO L225 Difference]: With dead ends: 49 [2018-07-23 13:50:06,005 INFO L226 Difference]: Without dead ends: 47 [2018-07-23 13:50:06,006 INFO L575 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-07-23 13:50:06,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-23 13:50:06,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-23 13:50:06,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-23 13:50:06,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-23 13:50:06,015 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-07-23 13:50:06,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:06,015 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-23 13:50:06,015 INFO L472 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-23 13:50:06,016 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-23 13:50:06,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-23 13:50:06,017 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:06,017 INFO L357 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2018-07-23 13:50:06,017 INFO L414 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:06,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1815536305, now seen corresponding path program 21 times [2018-07-23 13:50:06,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:06,136 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:06,136 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:06,137 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-23 13:50:06,137 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:06,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:06,138 INFO L185 omatonBuilderFactory]: Interpolants [2656#(<= ULTIMATE.start_main_~i~5 18), 2657#(<= ULTIMATE.start_main_~i~5 19), 2658#(<= ULTIMATE.start_main_~i~5 20), 2659#(<= ULTIMATE.start_main_~i~5 21), 2636#true, 2637#false, 2638#(<= ULTIMATE.start_main_~i~5 0), 2639#(<= ULTIMATE.start_main_~i~5 1), 2640#(<= ULTIMATE.start_main_~i~5 2), 2641#(<= ULTIMATE.start_main_~i~5 3), 2642#(<= ULTIMATE.start_main_~i~5 4), 2643#(<= ULTIMATE.start_main_~i~5 5), 2644#(<= ULTIMATE.start_main_~i~5 6), 2645#(<= ULTIMATE.start_main_~i~5 7), 2646#(<= ULTIMATE.start_main_~i~5 8), 2647#(<= ULTIMATE.start_main_~i~5 9), 2648#(<= ULTIMATE.start_main_~i~5 10), 2649#(<= ULTIMATE.start_main_~i~5 11), 2650#(<= ULTIMATE.start_main_~i~5 12), 2651#(<= ULTIMATE.start_main_~i~5 13), 2652#(<= ULTIMATE.start_main_~i~5 14), 2653#(<= ULTIMATE.start_main_~i~5 15), 2654#(<= ULTIMATE.start_main_~i~5 16), 2655#(<= ULTIMATE.start_main_~i~5 17)] [2018-07-23 13:50:06,139 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:06,139 INFO L450 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-23 13:50:06,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-23 13:50:06,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:50:06,140 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 24 states. [2018-07-23 13:50:06,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:06,158 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-23 13:50:06,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:50:06,159 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-07-23 13:50:06,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:06,160 INFO L225 Difference]: With dead ends: 51 [2018-07-23 13:50:06,160 INFO L226 Difference]: Without dead ends: 49 [2018-07-23 13:50:06,161 INFO L575 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-07-23 13:50:06,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-23 13:50:06,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-23 13:50:06,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-23 13:50:06,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-23 13:50:06,166 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-07-23 13:50:06,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:06,166 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-23 13:50:06,167 INFO L472 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-23 13:50:06,167 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-23 13:50:06,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-23 13:50:06,167 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:06,168 INFO L357 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-07-23 13:50:06,168 INFO L414 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:06,168 INFO L82 PathProgramCache]: Analyzing trace with hash 973599917, now seen corresponding path program 22 times [2018-07-23 13:50:06,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:06,279 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:06,280 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:06,280 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-23 13:50:06,280 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:06,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:06,281 INFO L185 omatonBuilderFactory]: Interpolants [2880#(<= ULTIMATE.start_main_~i~5 18), 2881#(<= ULTIMATE.start_main_~i~5 19), 2882#(<= ULTIMATE.start_main_~i~5 20), 2883#(<= ULTIMATE.start_main_~i~5 21), 2884#(<= ULTIMATE.start_main_~i~5 22), 2860#true, 2861#false, 2862#(<= ULTIMATE.start_main_~i~5 0), 2863#(<= ULTIMATE.start_main_~i~5 1), 2864#(<= ULTIMATE.start_main_~i~5 2), 2865#(<= ULTIMATE.start_main_~i~5 3), 2866#(<= ULTIMATE.start_main_~i~5 4), 2867#(<= ULTIMATE.start_main_~i~5 5), 2868#(<= ULTIMATE.start_main_~i~5 6), 2869#(<= ULTIMATE.start_main_~i~5 7), 2870#(<= ULTIMATE.start_main_~i~5 8), 2871#(<= ULTIMATE.start_main_~i~5 9), 2872#(<= ULTIMATE.start_main_~i~5 10), 2873#(<= ULTIMATE.start_main_~i~5 11), 2874#(<= ULTIMATE.start_main_~i~5 12), 2875#(<= ULTIMATE.start_main_~i~5 13), 2876#(<= ULTIMATE.start_main_~i~5 14), 2877#(<= ULTIMATE.start_main_~i~5 15), 2878#(<= ULTIMATE.start_main_~i~5 16), 2879#(<= ULTIMATE.start_main_~i~5 17)] [2018-07-23 13:50:06,282 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:06,282 INFO L450 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-23 13:50:06,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-23 13:50:06,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:50:06,283 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 25 states. [2018-07-23 13:50:06,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:06,303 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-23 13:50:06,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-23 13:50:06,304 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-07-23 13:50:06,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:06,305 INFO L225 Difference]: With dead ends: 53 [2018-07-23 13:50:06,305 INFO L226 Difference]: Without dead ends: 51 [2018-07-23 13:50:06,306 INFO L575 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-07-23 13:50:06,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-23 13:50:06,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-23 13:50:06,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-23 13:50:06,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-23 13:50:06,313 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-07-23 13:50:06,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:06,314 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-23 13:50:06,314 INFO L472 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-23 13:50:06,314 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-23 13:50:06,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-23 13:50:06,318 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:06,318 INFO L357 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2018-07-23 13:50:06,318 INFO L414 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:06,319 INFO L82 PathProgramCache]: Analyzing trace with hash -673417303, now seen corresponding path program 23 times [2018-07-23 13:50:06,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:06,446 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:06,446 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:06,446 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-23 13:50:06,447 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:06,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:06,447 INFO L185 omatonBuilderFactory]: Interpolants [3093#true, 3094#false, 3095#(<= ULTIMATE.start_main_~i~5 0), 3096#(<= ULTIMATE.start_main_~i~5 1), 3097#(<= ULTIMATE.start_main_~i~5 2), 3098#(<= ULTIMATE.start_main_~i~5 3), 3099#(<= ULTIMATE.start_main_~i~5 4), 3100#(<= ULTIMATE.start_main_~i~5 5), 3101#(<= ULTIMATE.start_main_~i~5 6), 3102#(<= ULTIMATE.start_main_~i~5 7), 3103#(<= ULTIMATE.start_main_~i~5 8), 3104#(<= ULTIMATE.start_main_~i~5 9), 3105#(<= ULTIMATE.start_main_~i~5 10), 3106#(<= ULTIMATE.start_main_~i~5 11), 3107#(<= ULTIMATE.start_main_~i~5 12), 3108#(<= ULTIMATE.start_main_~i~5 13), 3109#(<= ULTIMATE.start_main_~i~5 14), 3110#(<= ULTIMATE.start_main_~i~5 15), 3111#(<= ULTIMATE.start_main_~i~5 16), 3112#(<= ULTIMATE.start_main_~i~5 17), 3113#(<= ULTIMATE.start_main_~i~5 18), 3114#(<= ULTIMATE.start_main_~i~5 19), 3115#(<= ULTIMATE.start_main_~i~5 20), 3116#(<= ULTIMATE.start_main_~i~5 21), 3117#(<= ULTIMATE.start_main_~i~5 22), 3118#(<= ULTIMATE.start_main_~i~5 23)] [2018-07-23 13:50:06,448 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:06,448 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-23 13:50:06,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-23 13:50:06,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:50:06,450 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 26 states. [2018-07-23 13:50:06,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:06,471 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-23 13:50:06,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 13:50:06,472 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-07-23 13:50:06,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:06,473 INFO L225 Difference]: With dead ends: 55 [2018-07-23 13:50:06,473 INFO L226 Difference]: Without dead ends: 53 [2018-07-23 13:50:06,474 INFO L575 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-07-23 13:50:06,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-23 13:50:06,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-23 13:50:06,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-23 13:50:06,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-23 13:50:06,479 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-07-23 13:50:06,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:06,480 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-23 13:50:06,480 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-23 13:50:06,480 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-23 13:50:06,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-23 13:50:06,481 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:06,481 INFO L357 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2018-07-23 13:50:06,481 INFO L414 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:06,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1385966501, now seen corresponding path program 24 times [2018-07-23 13:50:06,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:06,615 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:06,616 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:06,616 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-23 13:50:06,616 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:06,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:06,617 INFO L185 omatonBuilderFactory]: Interpolants [3335#true, 3336#false, 3337#(<= ULTIMATE.start_main_~i~5 0), 3338#(<= ULTIMATE.start_main_~i~5 1), 3339#(<= ULTIMATE.start_main_~i~5 2), 3340#(<= ULTIMATE.start_main_~i~5 3), 3341#(<= ULTIMATE.start_main_~i~5 4), 3342#(<= ULTIMATE.start_main_~i~5 5), 3343#(<= ULTIMATE.start_main_~i~5 6), 3344#(<= ULTIMATE.start_main_~i~5 7), 3345#(<= ULTIMATE.start_main_~i~5 8), 3346#(<= ULTIMATE.start_main_~i~5 9), 3347#(<= ULTIMATE.start_main_~i~5 10), 3348#(<= ULTIMATE.start_main_~i~5 11), 3349#(<= ULTIMATE.start_main_~i~5 12), 3350#(<= ULTIMATE.start_main_~i~5 13), 3351#(<= ULTIMATE.start_main_~i~5 14), 3352#(<= ULTIMATE.start_main_~i~5 15), 3353#(<= ULTIMATE.start_main_~i~5 16), 3354#(<= ULTIMATE.start_main_~i~5 17), 3355#(<= ULTIMATE.start_main_~i~5 18), 3356#(<= ULTIMATE.start_main_~i~5 19), 3357#(<= ULTIMATE.start_main_~i~5 20), 3358#(<= ULTIMATE.start_main_~i~5 21), 3359#(<= ULTIMATE.start_main_~i~5 22), 3360#(<= ULTIMATE.start_main_~i~5 23), 3361#(<= ULTIMATE.start_main_~i~5 24)] [2018-07-23 13:50:06,618 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:06,618 INFO L450 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-23 13:50:06,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-23 13:50:06,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:50:06,619 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 27 states. [2018-07-23 13:50:06,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:06,651 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-23 13:50:06,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 13:50:06,652 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-07-23 13:50:06,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:06,652 INFO L225 Difference]: With dead ends: 57 [2018-07-23 13:50:06,653 INFO L226 Difference]: Without dead ends: 55 [2018-07-23 13:50:06,654 INFO L575 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-07-23 13:50:06,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-23 13:50:06,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-23 13:50:06,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-23 13:50:06,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-23 13:50:06,669 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-07-23 13:50:06,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:06,670 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-23 13:50:06,670 INFO L472 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-23 13:50:06,670 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-23 13:50:06,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-23 13:50:06,670 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:06,671 INFO L357 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2018-07-23 13:50:06,671 INFO L414 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:06,671 INFO L82 PathProgramCache]: Analyzing trace with hash 473878689, now seen corresponding path program 25 times [2018-07-23 13:50:06,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:06,826 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:06,826 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:06,826 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-23 13:50:06,827 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:06,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:06,827 INFO L185 omatonBuilderFactory]: Interpolants [3586#true, 3587#false, 3588#(<= ULTIMATE.start_main_~i~5 0), 3589#(<= ULTIMATE.start_main_~i~5 1), 3590#(<= ULTIMATE.start_main_~i~5 2), 3591#(<= ULTIMATE.start_main_~i~5 3), 3592#(<= ULTIMATE.start_main_~i~5 4), 3593#(<= ULTIMATE.start_main_~i~5 5), 3594#(<= ULTIMATE.start_main_~i~5 6), 3595#(<= ULTIMATE.start_main_~i~5 7), 3596#(<= ULTIMATE.start_main_~i~5 8), 3597#(<= ULTIMATE.start_main_~i~5 9), 3598#(<= ULTIMATE.start_main_~i~5 10), 3599#(<= ULTIMATE.start_main_~i~5 11), 3600#(<= ULTIMATE.start_main_~i~5 12), 3601#(<= ULTIMATE.start_main_~i~5 13), 3602#(<= ULTIMATE.start_main_~i~5 14), 3603#(<= ULTIMATE.start_main_~i~5 15), 3604#(<= ULTIMATE.start_main_~i~5 16), 3605#(<= ULTIMATE.start_main_~i~5 17), 3606#(<= ULTIMATE.start_main_~i~5 18), 3607#(<= ULTIMATE.start_main_~i~5 19), 3608#(<= ULTIMATE.start_main_~i~5 20), 3609#(<= ULTIMATE.start_main_~i~5 21), 3610#(<= ULTIMATE.start_main_~i~5 22), 3611#(<= ULTIMATE.start_main_~i~5 23), 3612#(<= ULTIMATE.start_main_~i~5 24), 3613#(<= ULTIMATE.start_main_~i~5 25)] [2018-07-23 13:50:06,828 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:06,828 INFO L450 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-23 13:50:06,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-23 13:50:06,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-23 13:50:06,830 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 28 states. [2018-07-23 13:50:06,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:06,856 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-23 13:50:06,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 13:50:06,856 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-07-23 13:50:06,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:06,857 INFO L225 Difference]: With dead ends: 59 [2018-07-23 13:50:06,857 INFO L226 Difference]: Without dead ends: 57 [2018-07-23 13:50:06,858 INFO L575 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-07-23 13:50:06,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-23 13:50:06,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-23 13:50:06,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-23 13:50:06,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-23 13:50:06,866 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-07-23 13:50:06,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:06,866 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-23 13:50:06,866 INFO L472 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-23 13:50:06,867 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-23 13:50:06,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-23 13:50:06,867 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:06,867 INFO L357 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2018-07-23 13:50:06,868 INFO L414 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:06,868 INFO L82 PathProgramCache]: Analyzing trace with hash 130819741, now seen corresponding path program 26 times [2018-07-23 13:50:06,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:07,037 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:07,037 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:07,037 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-23 13:50:07,038 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:07,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:07,038 INFO L185 omatonBuilderFactory]: Interpolants [3846#true, 3847#false, 3848#(<= ULTIMATE.start_main_~i~5 0), 3849#(<= ULTIMATE.start_main_~i~5 1), 3850#(<= ULTIMATE.start_main_~i~5 2), 3851#(<= ULTIMATE.start_main_~i~5 3), 3852#(<= ULTIMATE.start_main_~i~5 4), 3853#(<= ULTIMATE.start_main_~i~5 5), 3854#(<= ULTIMATE.start_main_~i~5 6), 3855#(<= ULTIMATE.start_main_~i~5 7), 3856#(<= ULTIMATE.start_main_~i~5 8), 3857#(<= ULTIMATE.start_main_~i~5 9), 3858#(<= ULTIMATE.start_main_~i~5 10), 3859#(<= ULTIMATE.start_main_~i~5 11), 3860#(<= ULTIMATE.start_main_~i~5 12), 3861#(<= ULTIMATE.start_main_~i~5 13), 3862#(<= ULTIMATE.start_main_~i~5 14), 3863#(<= ULTIMATE.start_main_~i~5 15), 3864#(<= ULTIMATE.start_main_~i~5 16), 3865#(<= ULTIMATE.start_main_~i~5 17), 3866#(<= ULTIMATE.start_main_~i~5 18), 3867#(<= ULTIMATE.start_main_~i~5 19), 3868#(<= ULTIMATE.start_main_~i~5 20), 3869#(<= ULTIMATE.start_main_~i~5 21), 3870#(<= ULTIMATE.start_main_~i~5 22), 3871#(<= ULTIMATE.start_main_~i~5 23), 3872#(<= ULTIMATE.start_main_~i~5 24), 3873#(<= ULTIMATE.start_main_~i~5 25), 3874#(<= ULTIMATE.start_main_~i~5 26)] [2018-07-23 13:50:07,039 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:07,040 INFO L450 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-23 13:50:07,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-23 13:50:07,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:50:07,042 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 29 states. [2018-07-23 13:50:07,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:07,076 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-23 13:50:07,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 13:50:07,077 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-07-23 13:50:07,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:07,078 INFO L225 Difference]: With dead ends: 61 [2018-07-23 13:50:07,078 INFO L226 Difference]: Without dead ends: 59 [2018-07-23 13:50:07,079 INFO L575 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-07-23 13:50:07,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-23 13:50:07,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-23 13:50:07,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-23 13:50:07,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-23 13:50:07,083 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-07-23 13:50:07,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:07,084 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-23 13:50:07,084 INFO L472 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-23 13:50:07,084 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-23 13:50:07,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-23 13:50:07,088 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:07,088 INFO L357 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2018-07-23 13:50:07,088 INFO L414 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:07,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1163652505, now seen corresponding path program 27 times [2018-07-23 13:50:07,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:07,243 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:07,244 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:07,244 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-23 13:50:07,244 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:07,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:07,245 INFO L185 omatonBuilderFactory]: Interpolants [4115#true, 4116#false, 4117#(<= ULTIMATE.start_main_~i~5 0), 4118#(<= ULTIMATE.start_main_~i~5 1), 4119#(<= ULTIMATE.start_main_~i~5 2), 4120#(<= ULTIMATE.start_main_~i~5 3), 4121#(<= ULTIMATE.start_main_~i~5 4), 4122#(<= ULTIMATE.start_main_~i~5 5), 4123#(<= ULTIMATE.start_main_~i~5 6), 4124#(<= ULTIMATE.start_main_~i~5 7), 4125#(<= ULTIMATE.start_main_~i~5 8), 4126#(<= ULTIMATE.start_main_~i~5 9), 4127#(<= ULTIMATE.start_main_~i~5 10), 4128#(<= ULTIMATE.start_main_~i~5 11), 4129#(<= ULTIMATE.start_main_~i~5 12), 4130#(<= ULTIMATE.start_main_~i~5 13), 4131#(<= ULTIMATE.start_main_~i~5 14), 4132#(<= ULTIMATE.start_main_~i~5 15), 4133#(<= ULTIMATE.start_main_~i~5 16), 4134#(<= ULTIMATE.start_main_~i~5 17), 4135#(<= ULTIMATE.start_main_~i~5 18), 4136#(<= ULTIMATE.start_main_~i~5 19), 4137#(<= ULTIMATE.start_main_~i~5 20), 4138#(<= ULTIMATE.start_main_~i~5 21), 4139#(<= ULTIMATE.start_main_~i~5 22), 4140#(<= ULTIMATE.start_main_~i~5 23), 4141#(<= ULTIMATE.start_main_~i~5 24), 4142#(<= ULTIMATE.start_main_~i~5 25), 4143#(<= ULTIMATE.start_main_~i~5 26), 4144#(<= ULTIMATE.start_main_~i~5 27)] [2018-07-23 13:50:07,246 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:07,246 INFO L450 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-23 13:50:07,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-23 13:50:07,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-23 13:50:07,247 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 30 states. [2018-07-23 13:50:07,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:07,278 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-23 13:50:07,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 13:50:07,279 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-07-23 13:50:07,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:07,279 INFO L225 Difference]: With dead ends: 63 [2018-07-23 13:50:07,280 INFO L226 Difference]: Without dead ends: 61 [2018-07-23 13:50:07,281 INFO L575 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-07-23 13:50:07,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-23 13:50:07,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-23 13:50:07,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-23 13:50:07,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-23 13:50:07,289 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-07-23 13:50:07,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:07,290 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-23 13:50:07,290 INFO L472 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-23 13:50:07,290 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-23 13:50:07,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-23 13:50:07,291 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:07,291 INFO L357 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2018-07-23 13:50:07,291 INFO L414 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:07,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1578493333, now seen corresponding path program 28 times [2018-07-23 13:50:07,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:07,506 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:07,506 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-23 13:50:07,506 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:07,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:07,507 INFO L185 omatonBuilderFactory]: Interpolants [4416#(<= ULTIMATE.start_main_~i~5 21), 4417#(<= ULTIMATE.start_main_~i~5 22), 4418#(<= ULTIMATE.start_main_~i~5 23), 4419#(<= ULTIMATE.start_main_~i~5 24), 4420#(<= ULTIMATE.start_main_~i~5 25), 4421#(<= ULTIMATE.start_main_~i~5 26), 4422#(<= ULTIMATE.start_main_~i~5 27), 4423#(<= ULTIMATE.start_main_~i~5 28), 4393#true, 4394#false, 4395#(<= ULTIMATE.start_main_~i~5 0), 4396#(<= ULTIMATE.start_main_~i~5 1), 4397#(<= ULTIMATE.start_main_~i~5 2), 4398#(<= ULTIMATE.start_main_~i~5 3), 4399#(<= ULTIMATE.start_main_~i~5 4), 4400#(<= ULTIMATE.start_main_~i~5 5), 4401#(<= ULTIMATE.start_main_~i~5 6), 4402#(<= ULTIMATE.start_main_~i~5 7), 4403#(<= ULTIMATE.start_main_~i~5 8), 4404#(<= ULTIMATE.start_main_~i~5 9), 4405#(<= ULTIMATE.start_main_~i~5 10), 4406#(<= ULTIMATE.start_main_~i~5 11), 4407#(<= ULTIMATE.start_main_~i~5 12), 4408#(<= ULTIMATE.start_main_~i~5 13), 4409#(<= ULTIMATE.start_main_~i~5 14), 4410#(<= ULTIMATE.start_main_~i~5 15), 4411#(<= ULTIMATE.start_main_~i~5 16), 4412#(<= ULTIMATE.start_main_~i~5 17), 4413#(<= ULTIMATE.start_main_~i~5 18), 4414#(<= ULTIMATE.start_main_~i~5 19), 4415#(<= ULTIMATE.start_main_~i~5 20)] [2018-07-23 13:50:07,507 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:07,508 INFO L450 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-23 13:50:07,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-23 13:50:07,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-23 13:50:07,509 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 31 states. [2018-07-23 13:50:07,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:07,530 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-23 13:50:07,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-23 13:50:07,531 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-07-23 13:50:07,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:07,531 INFO L225 Difference]: With dead ends: 65 [2018-07-23 13:50:07,532 INFO L226 Difference]: Without dead ends: 63 [2018-07-23 13:50:07,533 INFO L575 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-07-23 13:50:07,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-23 13:50:07,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-23 13:50:07,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-23 13:50:07,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-23 13:50:07,538 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-07-23 13:50:07,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:07,538 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-23 13:50:07,538 INFO L472 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-23 13:50:07,538 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-23 13:50:07,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-23 13:50:07,539 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:07,539 INFO L357 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2018-07-23 13:50:07,539 INFO L414 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:07,540 INFO L82 PathProgramCache]: Analyzing trace with hash 808570513, now seen corresponding path program 29 times [2018-07-23 13:50:07,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:07,695 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:07,695 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:07,696 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-23 13:50:07,696 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:07,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:07,696 INFO L185 omatonBuilderFactory]: Interpolants [4680#true, 4681#false, 4682#(<= ULTIMATE.start_main_~i~5 0), 4683#(<= ULTIMATE.start_main_~i~5 1), 4684#(<= ULTIMATE.start_main_~i~5 2), 4685#(<= ULTIMATE.start_main_~i~5 3), 4686#(<= ULTIMATE.start_main_~i~5 4), 4687#(<= ULTIMATE.start_main_~i~5 5), 4688#(<= ULTIMATE.start_main_~i~5 6), 4689#(<= ULTIMATE.start_main_~i~5 7), 4690#(<= ULTIMATE.start_main_~i~5 8), 4691#(<= ULTIMATE.start_main_~i~5 9), 4692#(<= ULTIMATE.start_main_~i~5 10), 4693#(<= ULTIMATE.start_main_~i~5 11), 4694#(<= ULTIMATE.start_main_~i~5 12), 4695#(<= ULTIMATE.start_main_~i~5 13), 4696#(<= ULTIMATE.start_main_~i~5 14), 4697#(<= ULTIMATE.start_main_~i~5 15), 4698#(<= ULTIMATE.start_main_~i~5 16), 4699#(<= ULTIMATE.start_main_~i~5 17), 4700#(<= ULTIMATE.start_main_~i~5 18), 4701#(<= ULTIMATE.start_main_~i~5 19), 4702#(<= ULTIMATE.start_main_~i~5 20), 4703#(<= ULTIMATE.start_main_~i~5 21), 4704#(<= ULTIMATE.start_main_~i~5 22), 4705#(<= ULTIMATE.start_main_~i~5 23), 4706#(<= ULTIMATE.start_main_~i~5 24), 4707#(<= ULTIMATE.start_main_~i~5 25), 4708#(<= ULTIMATE.start_main_~i~5 26), 4709#(<= ULTIMATE.start_main_~i~5 27), 4710#(<= ULTIMATE.start_main_~i~5 28), 4711#(<= ULTIMATE.start_main_~i~5 29)] [2018-07-23 13:50:07,697 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:07,698 INFO L450 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-23 13:50:07,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-23 13:50:07,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-23 13:50:07,699 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 32 states. [2018-07-23 13:50:07,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:07,724 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-23 13:50:07,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-23 13:50:07,725 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-07-23 13:50:07,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:07,725 INFO L225 Difference]: With dead ends: 67 [2018-07-23 13:50:07,726 INFO L226 Difference]: Without dead ends: 65 [2018-07-23 13:50:07,727 INFO L575 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-07-23 13:50:07,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-23 13:50:07,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-23 13:50:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-23 13:50:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-23 13:50:07,731 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-07-23 13:50:07,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:07,731 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-23 13:50:07,731 INFO L472 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-23 13:50:07,731 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-23 13:50:07,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-23 13:50:07,732 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:07,732 INFO L357 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2018-07-23 13:50:07,732 INFO L414 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:07,733 INFO L82 PathProgramCache]: Analyzing trace with hash -352884595, now seen corresponding path program 30 times [2018-07-23 13:50:07,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:07,884 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:07,885 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:07,885 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-23 13:50:07,885 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:07,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:07,886 INFO L185 omatonBuilderFactory]: Interpolants [4992#(<= ULTIMATE.start_main_~i~5 14), 4993#(<= ULTIMATE.start_main_~i~5 15), 4994#(<= ULTIMATE.start_main_~i~5 16), 4995#(<= ULTIMATE.start_main_~i~5 17), 4996#(<= ULTIMATE.start_main_~i~5 18), 4997#(<= ULTIMATE.start_main_~i~5 19), 4998#(<= ULTIMATE.start_main_~i~5 20), 4999#(<= ULTIMATE.start_main_~i~5 21), 5000#(<= ULTIMATE.start_main_~i~5 22), 5001#(<= ULTIMATE.start_main_~i~5 23), 5002#(<= ULTIMATE.start_main_~i~5 24), 5003#(<= ULTIMATE.start_main_~i~5 25), 5004#(<= ULTIMATE.start_main_~i~5 26), 5005#(<= ULTIMATE.start_main_~i~5 27), 5006#(<= ULTIMATE.start_main_~i~5 28), 5007#(<= ULTIMATE.start_main_~i~5 29), 5008#(<= ULTIMATE.start_main_~i~5 30), 4976#true, 4977#false, 4978#(<= ULTIMATE.start_main_~i~5 0), 4979#(<= ULTIMATE.start_main_~i~5 1), 4980#(<= ULTIMATE.start_main_~i~5 2), 4981#(<= ULTIMATE.start_main_~i~5 3), 4982#(<= ULTIMATE.start_main_~i~5 4), 4983#(<= ULTIMATE.start_main_~i~5 5), 4984#(<= ULTIMATE.start_main_~i~5 6), 4985#(<= ULTIMATE.start_main_~i~5 7), 4986#(<= ULTIMATE.start_main_~i~5 8), 4987#(<= ULTIMATE.start_main_~i~5 9), 4988#(<= ULTIMATE.start_main_~i~5 10), 4989#(<= ULTIMATE.start_main_~i~5 11), 4990#(<= ULTIMATE.start_main_~i~5 12), 4991#(<= ULTIMATE.start_main_~i~5 13)] [2018-07-23 13:50:07,886 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:07,887 INFO L450 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-23 13:50:07,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-23 13:50:07,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 13:50:07,888 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 33 states. [2018-07-23 13:50:07,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:07,909 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-23 13:50:07,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 13:50:07,909 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-07-23 13:50:07,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:07,910 INFO L225 Difference]: With dead ends: 69 [2018-07-23 13:50:07,910 INFO L226 Difference]: Without dead ends: 67 [2018-07-23 13:50:07,911 INFO L575 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-07-23 13:50:07,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-23 13:50:07,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-23 13:50:07,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-23 13:50:07,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-23 13:50:07,914 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-07-23 13:50:07,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:07,914 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-23 13:50:07,914 INFO L472 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-23 13:50:07,915 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-23 13:50:07,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-23 13:50:07,915 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:07,915 INFO L357 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2018-07-23 13:50:07,915 INFO L414 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:07,916 INFO L82 PathProgramCache]: Analyzing trace with hash 180253577, now seen corresponding path program 31 times [2018-07-23 13:50:07,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:08,071 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:08,071 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:08,071 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-23 13:50:08,071 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:08,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:08,072 INFO L185 omatonBuilderFactory]: Interpolants [5312#(<= ULTIMATE.start_main_~i~5 29), 5313#(<= ULTIMATE.start_main_~i~5 30), 5314#(<= ULTIMATE.start_main_~i~5 31), 5281#true, 5282#false, 5283#(<= ULTIMATE.start_main_~i~5 0), 5284#(<= ULTIMATE.start_main_~i~5 1), 5285#(<= ULTIMATE.start_main_~i~5 2), 5286#(<= ULTIMATE.start_main_~i~5 3), 5287#(<= ULTIMATE.start_main_~i~5 4), 5288#(<= ULTIMATE.start_main_~i~5 5), 5289#(<= ULTIMATE.start_main_~i~5 6), 5290#(<= ULTIMATE.start_main_~i~5 7), 5291#(<= ULTIMATE.start_main_~i~5 8), 5292#(<= ULTIMATE.start_main_~i~5 9), 5293#(<= ULTIMATE.start_main_~i~5 10), 5294#(<= ULTIMATE.start_main_~i~5 11), 5295#(<= ULTIMATE.start_main_~i~5 12), 5296#(<= ULTIMATE.start_main_~i~5 13), 5297#(<= ULTIMATE.start_main_~i~5 14), 5298#(<= ULTIMATE.start_main_~i~5 15), 5299#(<= ULTIMATE.start_main_~i~5 16), 5300#(<= ULTIMATE.start_main_~i~5 17), 5301#(<= ULTIMATE.start_main_~i~5 18), 5302#(<= ULTIMATE.start_main_~i~5 19), 5303#(<= ULTIMATE.start_main_~i~5 20), 5304#(<= ULTIMATE.start_main_~i~5 21), 5305#(<= ULTIMATE.start_main_~i~5 22), 5306#(<= ULTIMATE.start_main_~i~5 23), 5307#(<= ULTIMATE.start_main_~i~5 24), 5308#(<= ULTIMATE.start_main_~i~5 25), 5309#(<= ULTIMATE.start_main_~i~5 26), 5310#(<= ULTIMATE.start_main_~i~5 27), 5311#(<= ULTIMATE.start_main_~i~5 28)] [2018-07-23 13:50:08,073 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:08,073 INFO L450 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-23 13:50:08,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-23 13:50:08,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 13:50:08,075 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 34 states. [2018-07-23 13:50:08,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:08,096 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-23 13:50:08,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 13:50:08,096 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-07-23 13:50:08,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:08,097 INFO L225 Difference]: With dead ends: 71 [2018-07-23 13:50:08,097 INFO L226 Difference]: Without dead ends: 69 [2018-07-23 13:50:08,098 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 13:50:08,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-23 13:50:08,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-23 13:50:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-23 13:50:08,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-23 13:50:08,102 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-07-23 13:50:08,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:08,102 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-23 13:50:08,102 INFO L472 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-23 13:50:08,102 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-23 13:50:08,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-23 13:50:08,103 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:08,103 INFO L357 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2018-07-23 13:50:08,103 INFO L414 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:08,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1424928645, now seen corresponding path program 32 times [2018-07-23 13:50:08,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:08,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:08,260 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:08,260 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-23 13:50:08,260 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:08,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:08,261 INFO L185 omatonBuilderFactory]: Interpolants [5595#true, 5596#false, 5597#(<= ULTIMATE.start_main_~i~5 0), 5598#(<= ULTIMATE.start_main_~i~5 1), 5599#(<= ULTIMATE.start_main_~i~5 2), 5600#(<= ULTIMATE.start_main_~i~5 3), 5601#(<= ULTIMATE.start_main_~i~5 4), 5602#(<= ULTIMATE.start_main_~i~5 5), 5603#(<= ULTIMATE.start_main_~i~5 6), 5604#(<= ULTIMATE.start_main_~i~5 7), 5605#(<= ULTIMATE.start_main_~i~5 8), 5606#(<= ULTIMATE.start_main_~i~5 9), 5607#(<= ULTIMATE.start_main_~i~5 10), 5608#(<= ULTIMATE.start_main_~i~5 11), 5609#(<= ULTIMATE.start_main_~i~5 12), 5610#(<= ULTIMATE.start_main_~i~5 13), 5611#(<= ULTIMATE.start_main_~i~5 14), 5612#(<= ULTIMATE.start_main_~i~5 15), 5613#(<= ULTIMATE.start_main_~i~5 16), 5614#(<= ULTIMATE.start_main_~i~5 17), 5615#(<= ULTIMATE.start_main_~i~5 18), 5616#(<= ULTIMATE.start_main_~i~5 19), 5617#(<= ULTIMATE.start_main_~i~5 20), 5618#(<= ULTIMATE.start_main_~i~5 21), 5619#(<= ULTIMATE.start_main_~i~5 22), 5620#(<= ULTIMATE.start_main_~i~5 23), 5621#(<= ULTIMATE.start_main_~i~5 24), 5622#(<= ULTIMATE.start_main_~i~5 25), 5623#(<= ULTIMATE.start_main_~i~5 26), 5624#(<= ULTIMATE.start_main_~i~5 27), 5625#(<= ULTIMATE.start_main_~i~5 28), 5626#(<= ULTIMATE.start_main_~i~5 29), 5627#(<= ULTIMATE.start_main_~i~5 30), 5628#(<= ULTIMATE.start_main_~i~5 31), 5629#(<= ULTIMATE.start_main_~i~5 32)] [2018-07-23 13:50:08,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:08,262 INFO L450 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-23 13:50:08,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-23 13:50:08,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 13:50:08,264 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 35 states. [2018-07-23 13:50:08,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:08,293 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-23 13:50:08,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-23 13:50:08,293 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-07-23 13:50:08,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:08,294 INFO L225 Difference]: With dead ends: 73 [2018-07-23 13:50:08,294 INFO L226 Difference]: Without dead ends: 71 [2018-07-23 13:50:08,296 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 13:50:08,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-23 13:50:08,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-23 13:50:08,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-23 13:50:08,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-23 13:50:08,299 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-07-23 13:50:08,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:08,299 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-23 13:50:08,299 INFO L472 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-23 13:50:08,300 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-23 13:50:08,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-23 13:50:08,300 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:08,300 INFO L357 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2018-07-23 13:50:08,300 INFO L414 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:08,301 INFO L82 PathProgramCache]: Analyzing trace with hash -738206591, now seen corresponding path program 33 times [2018-07-23 13:50:08,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:08,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:08,483 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:08,484 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-23 13:50:08,484 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:08,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:08,484 INFO L185 omatonBuilderFactory]: Interpolants [5952#(<= ULTIMATE.start_main_~i~5 32), 5953#(<= ULTIMATE.start_main_~i~5 33), 5918#true, 5919#false, 5920#(<= ULTIMATE.start_main_~i~5 0), 5921#(<= ULTIMATE.start_main_~i~5 1), 5922#(<= ULTIMATE.start_main_~i~5 2), 5923#(<= ULTIMATE.start_main_~i~5 3), 5924#(<= ULTIMATE.start_main_~i~5 4), 5925#(<= ULTIMATE.start_main_~i~5 5), 5926#(<= ULTIMATE.start_main_~i~5 6), 5927#(<= ULTIMATE.start_main_~i~5 7), 5928#(<= ULTIMATE.start_main_~i~5 8), 5929#(<= ULTIMATE.start_main_~i~5 9), 5930#(<= ULTIMATE.start_main_~i~5 10), 5931#(<= ULTIMATE.start_main_~i~5 11), 5932#(<= ULTIMATE.start_main_~i~5 12), 5933#(<= ULTIMATE.start_main_~i~5 13), 5934#(<= ULTIMATE.start_main_~i~5 14), 5935#(<= ULTIMATE.start_main_~i~5 15), 5936#(<= ULTIMATE.start_main_~i~5 16), 5937#(<= ULTIMATE.start_main_~i~5 17), 5938#(<= ULTIMATE.start_main_~i~5 18), 5939#(<= ULTIMATE.start_main_~i~5 19), 5940#(<= ULTIMATE.start_main_~i~5 20), 5941#(<= ULTIMATE.start_main_~i~5 21), 5942#(<= ULTIMATE.start_main_~i~5 22), 5943#(<= ULTIMATE.start_main_~i~5 23), 5944#(<= ULTIMATE.start_main_~i~5 24), 5945#(<= ULTIMATE.start_main_~i~5 25), 5946#(<= ULTIMATE.start_main_~i~5 26), 5947#(<= ULTIMATE.start_main_~i~5 27), 5948#(<= ULTIMATE.start_main_~i~5 28), 5949#(<= ULTIMATE.start_main_~i~5 29), 5950#(<= ULTIMATE.start_main_~i~5 30), 5951#(<= ULTIMATE.start_main_~i~5 31)] [2018-07-23 13:50:08,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:08,486 INFO L450 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-23 13:50:08,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-23 13:50:08,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 13:50:08,487 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 36 states. [2018-07-23 13:50:08,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:08,508 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-23 13:50:08,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-23 13:50:08,509 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-07-23 13:50:08,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:08,509 INFO L225 Difference]: With dead ends: 75 [2018-07-23 13:50:08,510 INFO L226 Difference]: Without dead ends: 73 [2018-07-23 13:50:08,511 INFO L575 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-07-23 13:50:08,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-23 13:50:08,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-23 13:50:08,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-23 13:50:08,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-23 13:50:08,514 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-07-23 13:50:08,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:08,514 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-23 13:50:08,514 INFO L472 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-23 13:50:08,514 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-23 13:50:08,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-23 13:50:08,515 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:08,515 INFO L357 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2018-07-23 13:50:08,515 INFO L414 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:08,516 INFO L82 PathProgramCache]: Analyzing trace with hash -746997123, now seen corresponding path program 34 times [2018-07-23 13:50:08,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:08,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:08,706 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:08,706 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-23 13:50:08,706 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:08,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:08,707 INFO L185 omatonBuilderFactory]: Interpolants [6272#(<= ULTIMATE.start_main_~i~5 20), 6273#(<= ULTIMATE.start_main_~i~5 21), 6274#(<= ULTIMATE.start_main_~i~5 22), 6275#(<= ULTIMATE.start_main_~i~5 23), 6276#(<= ULTIMATE.start_main_~i~5 24), 6277#(<= ULTIMATE.start_main_~i~5 25), 6278#(<= ULTIMATE.start_main_~i~5 26), 6279#(<= ULTIMATE.start_main_~i~5 27), 6280#(<= ULTIMATE.start_main_~i~5 28), 6281#(<= ULTIMATE.start_main_~i~5 29), 6282#(<= ULTIMATE.start_main_~i~5 30), 6283#(<= ULTIMATE.start_main_~i~5 31), 6284#(<= ULTIMATE.start_main_~i~5 32), 6285#(<= ULTIMATE.start_main_~i~5 33), 6286#(<= ULTIMATE.start_main_~i~5 34), 6250#true, 6251#false, 6252#(<= ULTIMATE.start_main_~i~5 0), 6253#(<= ULTIMATE.start_main_~i~5 1), 6254#(<= ULTIMATE.start_main_~i~5 2), 6255#(<= ULTIMATE.start_main_~i~5 3), 6256#(<= ULTIMATE.start_main_~i~5 4), 6257#(<= ULTIMATE.start_main_~i~5 5), 6258#(<= ULTIMATE.start_main_~i~5 6), 6259#(<= ULTIMATE.start_main_~i~5 7), 6260#(<= ULTIMATE.start_main_~i~5 8), 6261#(<= ULTIMATE.start_main_~i~5 9), 6262#(<= ULTIMATE.start_main_~i~5 10), 6263#(<= ULTIMATE.start_main_~i~5 11), 6264#(<= ULTIMATE.start_main_~i~5 12), 6265#(<= ULTIMATE.start_main_~i~5 13), 6266#(<= ULTIMATE.start_main_~i~5 14), 6267#(<= ULTIMATE.start_main_~i~5 15), 6268#(<= ULTIMATE.start_main_~i~5 16), 6269#(<= ULTIMATE.start_main_~i~5 17), 6270#(<= ULTIMATE.start_main_~i~5 18), 6271#(<= ULTIMATE.start_main_~i~5 19)] [2018-07-23 13:50:08,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:08,707 INFO L450 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-23 13:50:08,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-23 13:50:08,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 13:50:08,709 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 37 states. [2018-07-23 13:50:08,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:08,732 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-23 13:50:08,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-23 13:50:08,733 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-07-23 13:50:08,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:08,734 INFO L225 Difference]: With dead ends: 77 [2018-07-23 13:50:08,734 INFO L226 Difference]: Without dead ends: 75 [2018-07-23 13:50:08,735 INFO L575 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-07-23 13:50:08,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-23 13:50:08,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-23 13:50:08,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-23 13:50:08,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-23 13:50:08,738 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-07-23 13:50:08,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:08,739 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-23 13:50:08,739 INFO L472 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-23 13:50:08,739 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-23 13:50:08,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-23 13:50:08,740 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:08,740 INFO L357 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2018-07-23 13:50:08,740 INFO L414 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:08,740 INFO L82 PathProgramCache]: Analyzing trace with hash -604763783, now seen corresponding path program 35 times [2018-07-23 13:50:08,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:08,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:08,921 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:08,921 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-23 13:50:08,922 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:08,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:08,922 INFO L185 omatonBuilderFactory]: Interpolants [6592#false, 6593#(<= ULTIMATE.start_main_~i~5 0), 6594#(<= ULTIMATE.start_main_~i~5 1), 6595#(<= ULTIMATE.start_main_~i~5 2), 6596#(<= ULTIMATE.start_main_~i~5 3), 6597#(<= ULTIMATE.start_main_~i~5 4), 6598#(<= ULTIMATE.start_main_~i~5 5), 6599#(<= ULTIMATE.start_main_~i~5 6), 6600#(<= ULTIMATE.start_main_~i~5 7), 6601#(<= ULTIMATE.start_main_~i~5 8), 6602#(<= ULTIMATE.start_main_~i~5 9), 6603#(<= ULTIMATE.start_main_~i~5 10), 6604#(<= ULTIMATE.start_main_~i~5 11), 6605#(<= ULTIMATE.start_main_~i~5 12), 6606#(<= ULTIMATE.start_main_~i~5 13), 6607#(<= ULTIMATE.start_main_~i~5 14), 6608#(<= ULTIMATE.start_main_~i~5 15), 6609#(<= ULTIMATE.start_main_~i~5 16), 6610#(<= ULTIMATE.start_main_~i~5 17), 6611#(<= ULTIMATE.start_main_~i~5 18), 6612#(<= ULTIMATE.start_main_~i~5 19), 6613#(<= ULTIMATE.start_main_~i~5 20), 6614#(<= ULTIMATE.start_main_~i~5 21), 6615#(<= ULTIMATE.start_main_~i~5 22), 6616#(<= ULTIMATE.start_main_~i~5 23), 6617#(<= ULTIMATE.start_main_~i~5 24), 6618#(<= ULTIMATE.start_main_~i~5 25), 6619#(<= ULTIMATE.start_main_~i~5 26), 6620#(<= ULTIMATE.start_main_~i~5 27), 6621#(<= ULTIMATE.start_main_~i~5 28), 6622#(<= ULTIMATE.start_main_~i~5 29), 6623#(<= ULTIMATE.start_main_~i~5 30), 6624#(<= ULTIMATE.start_main_~i~5 31), 6625#(<= ULTIMATE.start_main_~i~5 32), 6626#(<= ULTIMATE.start_main_~i~5 33), 6627#(<= ULTIMATE.start_main_~i~5 34), 6628#(<= ULTIMATE.start_main_~i~5 35), 6591#true] [2018-07-23 13:50:08,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:08,923 INFO L450 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-23 13:50:08,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-23 13:50:08,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 13:50:08,924 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 38 states. [2018-07-23 13:50:08,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:08,955 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-23 13:50:08,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-23 13:50:08,955 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-07-23 13:50:08,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:08,956 INFO L225 Difference]: With dead ends: 79 [2018-07-23 13:50:08,956 INFO L226 Difference]: Without dead ends: 77 [2018-07-23 13:50:08,957 INFO L575 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-07-23 13:50:08,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-23 13:50:08,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-23 13:50:08,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-23 13:50:08,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-23 13:50:08,961 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-07-23 13:50:08,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:08,962 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-23 13:50:08,962 INFO L472 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-23 13:50:08,962 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-23 13:50:08,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-23 13:50:08,963 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:08,963 INFO L357 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2018-07-23 13:50:08,963 INFO L414 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:08,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1357477515, now seen corresponding path program 36 times [2018-07-23 13:50:08,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:09,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:09,155 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:09,155 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-23 13:50:09,155 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:09,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:09,156 INFO L185 omatonBuilderFactory]: Interpolants [6976#(<= ULTIMATE.start_main_~i~5 33), 6977#(<= ULTIMATE.start_main_~i~5 34), 6978#(<= ULTIMATE.start_main_~i~5 35), 6979#(<= ULTIMATE.start_main_~i~5 36), 6941#true, 6942#false, 6943#(<= ULTIMATE.start_main_~i~5 0), 6944#(<= ULTIMATE.start_main_~i~5 1), 6945#(<= ULTIMATE.start_main_~i~5 2), 6946#(<= ULTIMATE.start_main_~i~5 3), 6947#(<= ULTIMATE.start_main_~i~5 4), 6948#(<= ULTIMATE.start_main_~i~5 5), 6949#(<= ULTIMATE.start_main_~i~5 6), 6950#(<= ULTIMATE.start_main_~i~5 7), 6951#(<= ULTIMATE.start_main_~i~5 8), 6952#(<= ULTIMATE.start_main_~i~5 9), 6953#(<= ULTIMATE.start_main_~i~5 10), 6954#(<= ULTIMATE.start_main_~i~5 11), 6955#(<= ULTIMATE.start_main_~i~5 12), 6956#(<= ULTIMATE.start_main_~i~5 13), 6957#(<= ULTIMATE.start_main_~i~5 14), 6958#(<= ULTIMATE.start_main_~i~5 15), 6959#(<= ULTIMATE.start_main_~i~5 16), 6960#(<= ULTIMATE.start_main_~i~5 17), 6961#(<= ULTIMATE.start_main_~i~5 18), 6962#(<= ULTIMATE.start_main_~i~5 19), 6963#(<= ULTIMATE.start_main_~i~5 20), 6964#(<= ULTIMATE.start_main_~i~5 21), 6965#(<= ULTIMATE.start_main_~i~5 22), 6966#(<= ULTIMATE.start_main_~i~5 23), 6967#(<= ULTIMATE.start_main_~i~5 24), 6968#(<= ULTIMATE.start_main_~i~5 25), 6969#(<= ULTIMATE.start_main_~i~5 26), 6970#(<= ULTIMATE.start_main_~i~5 27), 6971#(<= ULTIMATE.start_main_~i~5 28), 6972#(<= ULTIMATE.start_main_~i~5 29), 6973#(<= ULTIMATE.start_main_~i~5 30), 6974#(<= ULTIMATE.start_main_~i~5 31), 6975#(<= ULTIMATE.start_main_~i~5 32)] [2018-07-23 13:50:09,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:09,157 INFO L450 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-23 13:50:09,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-23 13:50:09,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 13:50:09,158 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 39 states. [2018-07-23 13:50:09,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:09,182 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-23 13:50:09,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-23 13:50:09,182 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-07-23 13:50:09,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:09,183 INFO L225 Difference]: With dead ends: 81 [2018-07-23 13:50:09,183 INFO L226 Difference]: Without dead ends: 79 [2018-07-23 13:50:09,184 INFO L575 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-07-23 13:50:09,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-23 13:50:09,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-23 13:50:09,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-23 13:50:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-23 13:50:09,188 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-07-23 13:50:09,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:09,188 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-23 13:50:09,188 INFO L472 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-23 13:50:09,188 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-23 13:50:09,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-23 13:50:09,189 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:09,189 INFO L357 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2018-07-23 13:50:09,189 INFO L414 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:09,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1134099057, now seen corresponding path program 37 times [2018-07-23 13:50:09,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:09,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:09,369 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:09,369 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-23 13:50:09,370 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:09,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:09,370 INFO L185 omatonBuilderFactory]: Interpolants [7300#true, 7301#false, 7302#(<= ULTIMATE.start_main_~i~5 0), 7303#(<= ULTIMATE.start_main_~i~5 1), 7304#(<= ULTIMATE.start_main_~i~5 2), 7305#(<= ULTIMATE.start_main_~i~5 3), 7306#(<= ULTIMATE.start_main_~i~5 4), 7307#(<= ULTIMATE.start_main_~i~5 5), 7308#(<= ULTIMATE.start_main_~i~5 6), 7309#(<= ULTIMATE.start_main_~i~5 7), 7310#(<= ULTIMATE.start_main_~i~5 8), 7311#(<= ULTIMATE.start_main_~i~5 9), 7312#(<= ULTIMATE.start_main_~i~5 10), 7313#(<= ULTIMATE.start_main_~i~5 11), 7314#(<= ULTIMATE.start_main_~i~5 12), 7315#(<= ULTIMATE.start_main_~i~5 13), 7316#(<= ULTIMATE.start_main_~i~5 14), 7317#(<= ULTIMATE.start_main_~i~5 15), 7318#(<= ULTIMATE.start_main_~i~5 16), 7319#(<= ULTIMATE.start_main_~i~5 17), 7320#(<= ULTIMATE.start_main_~i~5 18), 7321#(<= ULTIMATE.start_main_~i~5 19), 7322#(<= ULTIMATE.start_main_~i~5 20), 7323#(<= ULTIMATE.start_main_~i~5 21), 7324#(<= ULTIMATE.start_main_~i~5 22), 7325#(<= ULTIMATE.start_main_~i~5 23), 7326#(<= ULTIMATE.start_main_~i~5 24), 7327#(<= ULTIMATE.start_main_~i~5 25), 7328#(<= ULTIMATE.start_main_~i~5 26), 7329#(<= ULTIMATE.start_main_~i~5 27), 7330#(<= ULTIMATE.start_main_~i~5 28), 7331#(<= ULTIMATE.start_main_~i~5 29), 7332#(<= ULTIMATE.start_main_~i~5 30), 7333#(<= ULTIMATE.start_main_~i~5 31), 7334#(<= ULTIMATE.start_main_~i~5 32), 7335#(<= ULTIMATE.start_main_~i~5 33), 7336#(<= ULTIMATE.start_main_~i~5 34), 7337#(<= ULTIMATE.start_main_~i~5 35), 7338#(<= ULTIMATE.start_main_~i~5 36), 7339#(<= ULTIMATE.start_main_~i~5 37)] [2018-07-23 13:50:09,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:09,371 INFO L450 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-23 13:50:09,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-23 13:50:09,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 13:50:09,372 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 40 states. [2018-07-23 13:50:09,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:09,405 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-23 13:50:09,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-23 13:50:09,406 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-07-23 13:50:09,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:09,406 INFO L225 Difference]: With dead ends: 83 [2018-07-23 13:50:09,407 INFO L226 Difference]: Without dead ends: 81 [2018-07-23 13:50:09,408 INFO L575 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-07-23 13:50:09,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-23 13:50:09,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-23 13:50:09,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-23 13:50:09,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-23 13:50:09,411 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-07-23 13:50:09,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:09,412 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-23 13:50:09,412 INFO L472 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-23 13:50:09,412 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-23 13:50:09,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-23 13:50:09,413 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:09,413 INFO L357 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2018-07-23 13:50:09,413 INFO L414 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:09,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1052566419, now seen corresponding path program 38 times [2018-07-23 13:50:09,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:09,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:09,606 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:09,606 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-23 13:50:09,606 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:09,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:09,607 INFO L185 omatonBuilderFactory]: Interpolants [7680#(<= ULTIMATE.start_main_~i~5 10), 7681#(<= ULTIMATE.start_main_~i~5 11), 7682#(<= ULTIMATE.start_main_~i~5 12), 7683#(<= ULTIMATE.start_main_~i~5 13), 7684#(<= ULTIMATE.start_main_~i~5 14), 7685#(<= ULTIMATE.start_main_~i~5 15), 7686#(<= ULTIMATE.start_main_~i~5 16), 7687#(<= ULTIMATE.start_main_~i~5 17), 7688#(<= ULTIMATE.start_main_~i~5 18), 7689#(<= ULTIMATE.start_main_~i~5 19), 7690#(<= ULTIMATE.start_main_~i~5 20), 7691#(<= ULTIMATE.start_main_~i~5 21), 7692#(<= ULTIMATE.start_main_~i~5 22), 7693#(<= ULTIMATE.start_main_~i~5 23), 7694#(<= ULTIMATE.start_main_~i~5 24), 7695#(<= ULTIMATE.start_main_~i~5 25), 7696#(<= ULTIMATE.start_main_~i~5 26), 7697#(<= ULTIMATE.start_main_~i~5 27), 7698#(<= ULTIMATE.start_main_~i~5 28), 7699#(<= ULTIMATE.start_main_~i~5 29), 7700#(<= ULTIMATE.start_main_~i~5 30), 7701#(<= ULTIMATE.start_main_~i~5 31), 7702#(<= ULTIMATE.start_main_~i~5 32), 7703#(<= ULTIMATE.start_main_~i~5 33), 7704#(<= ULTIMATE.start_main_~i~5 34), 7705#(<= ULTIMATE.start_main_~i~5 35), 7706#(<= ULTIMATE.start_main_~i~5 36), 7707#(<= ULTIMATE.start_main_~i~5 37), 7708#(<= ULTIMATE.start_main_~i~5 38), 7668#true, 7669#false, 7670#(<= ULTIMATE.start_main_~i~5 0), 7671#(<= ULTIMATE.start_main_~i~5 1), 7672#(<= ULTIMATE.start_main_~i~5 2), 7673#(<= ULTIMATE.start_main_~i~5 3), 7674#(<= ULTIMATE.start_main_~i~5 4), 7675#(<= ULTIMATE.start_main_~i~5 5), 7676#(<= ULTIMATE.start_main_~i~5 6), 7677#(<= ULTIMATE.start_main_~i~5 7), 7678#(<= ULTIMATE.start_main_~i~5 8), 7679#(<= ULTIMATE.start_main_~i~5 9)] [2018-07-23 13:50:09,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:09,608 INFO L450 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-23 13:50:09,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-23 13:50:09,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 13:50:09,610 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 41 states. [2018-07-23 13:50:09,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:09,645 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-23 13:50:09,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-23 13:50:09,645 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-07-23 13:50:09,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:09,646 INFO L225 Difference]: With dead ends: 85 [2018-07-23 13:50:09,646 INFO L226 Difference]: Without dead ends: 83 [2018-07-23 13:50:09,648 INFO L575 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-07-23 13:50:09,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-23 13:50:09,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-23 13:50:09,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-23 13:50:09,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-23 13:50:09,652 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-07-23 13:50:09,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:09,653 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-23 13:50:09,653 INFO L472 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-23 13:50:09,653 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-23 13:50:09,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-23 13:50:09,654 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:09,654 INFO L357 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2018-07-23 13:50:09,654 INFO L414 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:09,655 INFO L82 PathProgramCache]: Analyzing trace with hash 2095886185, now seen corresponding path program 39 times [2018-07-23 13:50:09,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:09,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:09,884 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:09,884 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-23 13:50:09,884 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:09,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:09,885 INFO L185 omatonBuilderFactory]: Interpolants [8064#(<= ULTIMATE.start_main_~i~5 17), 8065#(<= ULTIMATE.start_main_~i~5 18), 8066#(<= ULTIMATE.start_main_~i~5 19), 8067#(<= ULTIMATE.start_main_~i~5 20), 8068#(<= ULTIMATE.start_main_~i~5 21), 8069#(<= ULTIMATE.start_main_~i~5 22), 8070#(<= ULTIMATE.start_main_~i~5 23), 8071#(<= ULTIMATE.start_main_~i~5 24), 8072#(<= ULTIMATE.start_main_~i~5 25), 8073#(<= ULTIMATE.start_main_~i~5 26), 8074#(<= ULTIMATE.start_main_~i~5 27), 8075#(<= ULTIMATE.start_main_~i~5 28), 8076#(<= ULTIMATE.start_main_~i~5 29), 8077#(<= ULTIMATE.start_main_~i~5 30), 8078#(<= ULTIMATE.start_main_~i~5 31), 8079#(<= ULTIMATE.start_main_~i~5 32), 8080#(<= ULTIMATE.start_main_~i~5 33), 8081#(<= ULTIMATE.start_main_~i~5 34), 8082#(<= ULTIMATE.start_main_~i~5 35), 8083#(<= ULTIMATE.start_main_~i~5 36), 8084#(<= ULTIMATE.start_main_~i~5 37), 8085#(<= ULTIMATE.start_main_~i~5 38), 8086#(<= ULTIMATE.start_main_~i~5 39), 8045#true, 8046#false, 8047#(<= ULTIMATE.start_main_~i~5 0), 8048#(<= ULTIMATE.start_main_~i~5 1), 8049#(<= ULTIMATE.start_main_~i~5 2), 8050#(<= ULTIMATE.start_main_~i~5 3), 8051#(<= ULTIMATE.start_main_~i~5 4), 8052#(<= ULTIMATE.start_main_~i~5 5), 8053#(<= ULTIMATE.start_main_~i~5 6), 8054#(<= ULTIMATE.start_main_~i~5 7), 8055#(<= ULTIMATE.start_main_~i~5 8), 8056#(<= ULTIMATE.start_main_~i~5 9), 8057#(<= ULTIMATE.start_main_~i~5 10), 8058#(<= ULTIMATE.start_main_~i~5 11), 8059#(<= ULTIMATE.start_main_~i~5 12), 8060#(<= ULTIMATE.start_main_~i~5 13), 8061#(<= ULTIMATE.start_main_~i~5 14), 8062#(<= ULTIMATE.start_main_~i~5 15), 8063#(<= ULTIMATE.start_main_~i~5 16)] [2018-07-23 13:50:09,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:09,886 INFO L450 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-23 13:50:09,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-23 13:50:09,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-23 13:50:09,888 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 42 states. [2018-07-23 13:50:09,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:09,919 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-23 13:50:09,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-23 13:50:09,919 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-07-23 13:50:09,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:09,920 INFO L225 Difference]: With dead ends: 87 [2018-07-23 13:50:09,920 INFO L226 Difference]: Without dead ends: 85 [2018-07-23 13:50:09,922 INFO L575 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-07-23 13:50:09,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-23 13:50:09,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-23 13:50:09,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-23 13:50:09,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-23 13:50:09,926 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-07-23 13:50:09,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:09,926 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-23 13:50:09,927 INFO L472 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-23 13:50:09,927 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-23 13:50:09,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-23 13:50:09,927 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:09,928 INFO L357 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2018-07-23 13:50:09,928 INFO L414 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:09,928 INFO L82 PathProgramCache]: Analyzing trace with hash -193105051, now seen corresponding path program 40 times [2018-07-23 13:50:09,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:10,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:10,236 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:10,236 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-23 13:50:10,236 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:10,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:10,240 INFO L185 omatonBuilderFactory]: Interpolants [8448#(<= ULTIMATE.start_main_~i~5 15), 8449#(<= ULTIMATE.start_main_~i~5 16), 8450#(<= ULTIMATE.start_main_~i~5 17), 8451#(<= ULTIMATE.start_main_~i~5 18), 8452#(<= ULTIMATE.start_main_~i~5 19), 8453#(<= ULTIMATE.start_main_~i~5 20), 8454#(<= ULTIMATE.start_main_~i~5 21), 8455#(<= ULTIMATE.start_main_~i~5 22), 8456#(<= ULTIMATE.start_main_~i~5 23), 8457#(<= ULTIMATE.start_main_~i~5 24), 8458#(<= ULTIMATE.start_main_~i~5 25), 8459#(<= ULTIMATE.start_main_~i~5 26), 8460#(<= ULTIMATE.start_main_~i~5 27), 8461#(<= ULTIMATE.start_main_~i~5 28), 8462#(<= ULTIMATE.start_main_~i~5 29), 8463#(<= ULTIMATE.start_main_~i~5 30), 8464#(<= ULTIMATE.start_main_~i~5 31), 8465#(<= ULTIMATE.start_main_~i~5 32), 8466#(<= ULTIMATE.start_main_~i~5 33), 8467#(<= ULTIMATE.start_main_~i~5 34), 8468#(<= ULTIMATE.start_main_~i~5 35), 8469#(<= ULTIMATE.start_main_~i~5 36), 8470#(<= ULTIMATE.start_main_~i~5 37), 8471#(<= ULTIMATE.start_main_~i~5 38), 8472#(<= ULTIMATE.start_main_~i~5 39), 8473#(<= ULTIMATE.start_main_~i~5 40), 8431#true, 8432#false, 8433#(<= ULTIMATE.start_main_~i~5 0), 8434#(<= ULTIMATE.start_main_~i~5 1), 8435#(<= ULTIMATE.start_main_~i~5 2), 8436#(<= ULTIMATE.start_main_~i~5 3), 8437#(<= ULTIMATE.start_main_~i~5 4), 8438#(<= ULTIMATE.start_main_~i~5 5), 8439#(<= ULTIMATE.start_main_~i~5 6), 8440#(<= ULTIMATE.start_main_~i~5 7), 8441#(<= ULTIMATE.start_main_~i~5 8), 8442#(<= ULTIMATE.start_main_~i~5 9), 8443#(<= ULTIMATE.start_main_~i~5 10), 8444#(<= ULTIMATE.start_main_~i~5 11), 8445#(<= ULTIMATE.start_main_~i~5 12), 8446#(<= ULTIMATE.start_main_~i~5 13), 8447#(<= ULTIMATE.start_main_~i~5 14)] [2018-07-23 13:50:10,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:10,241 INFO L450 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-23 13:50:10,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-23 13:50:10,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 13:50:10,242 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 43 states. [2018-07-23 13:50:10,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:10,274 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-23 13:50:10,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-23 13:50:10,275 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-07-23 13:50:10,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:10,276 INFO L225 Difference]: With dead ends: 89 [2018-07-23 13:50:10,276 INFO L226 Difference]: Without dead ends: 87 [2018-07-23 13:50:10,277 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 13:50:10,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-23 13:50:10,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-23 13:50:10,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-23 13:50:10,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-23 13:50:10,282 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-07-23 13:50:10,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:10,282 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-23 13:50:10,282 INFO L472 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-23 13:50:10,282 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-23 13:50:10,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-23 13:50:10,283 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:10,283 INFO L357 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2018-07-23 13:50:10,284 INFO L414 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:10,284 INFO L82 PathProgramCache]: Analyzing trace with hash -890427295, now seen corresponding path program 41 times [2018-07-23 13:50:10,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:10,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:10,492 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:10,492 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-23 13:50:10,493 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:10,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:10,493 INFO L185 omatonBuilderFactory]: Interpolants [8832#(<= ULTIMATE.start_main_~i~5 4), 8833#(<= ULTIMATE.start_main_~i~5 5), 8834#(<= ULTIMATE.start_main_~i~5 6), 8835#(<= ULTIMATE.start_main_~i~5 7), 8836#(<= ULTIMATE.start_main_~i~5 8), 8837#(<= ULTIMATE.start_main_~i~5 9), 8838#(<= ULTIMATE.start_main_~i~5 10), 8839#(<= ULTIMATE.start_main_~i~5 11), 8840#(<= ULTIMATE.start_main_~i~5 12), 8841#(<= ULTIMATE.start_main_~i~5 13), 8842#(<= ULTIMATE.start_main_~i~5 14), 8843#(<= ULTIMATE.start_main_~i~5 15), 8844#(<= ULTIMATE.start_main_~i~5 16), 8845#(<= ULTIMATE.start_main_~i~5 17), 8846#(<= ULTIMATE.start_main_~i~5 18), 8847#(<= ULTIMATE.start_main_~i~5 19), 8848#(<= ULTIMATE.start_main_~i~5 20), 8849#(<= ULTIMATE.start_main_~i~5 21), 8850#(<= ULTIMATE.start_main_~i~5 22), 8851#(<= ULTIMATE.start_main_~i~5 23), 8852#(<= ULTIMATE.start_main_~i~5 24), 8853#(<= ULTIMATE.start_main_~i~5 25), 8854#(<= ULTIMATE.start_main_~i~5 26), 8855#(<= ULTIMATE.start_main_~i~5 27), 8856#(<= ULTIMATE.start_main_~i~5 28), 8857#(<= ULTIMATE.start_main_~i~5 29), 8858#(<= ULTIMATE.start_main_~i~5 30), 8859#(<= ULTIMATE.start_main_~i~5 31), 8860#(<= ULTIMATE.start_main_~i~5 32), 8861#(<= ULTIMATE.start_main_~i~5 33), 8862#(<= ULTIMATE.start_main_~i~5 34), 8863#(<= ULTIMATE.start_main_~i~5 35), 8864#(<= ULTIMATE.start_main_~i~5 36), 8865#(<= ULTIMATE.start_main_~i~5 37), 8866#(<= ULTIMATE.start_main_~i~5 38), 8867#(<= ULTIMATE.start_main_~i~5 39), 8868#(<= ULTIMATE.start_main_~i~5 40), 8869#(<= ULTIMATE.start_main_~i~5 41), 8826#true, 8827#false, 8828#(<= ULTIMATE.start_main_~i~5 0), 8829#(<= ULTIMATE.start_main_~i~5 1), 8830#(<= ULTIMATE.start_main_~i~5 2), 8831#(<= ULTIMATE.start_main_~i~5 3)] [2018-07-23 13:50:10,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:10,494 INFO L450 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-23 13:50:10,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-23 13:50:10,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 13:50:10,496 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 44 states. [2018-07-23 13:50:10,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:10,534 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-23 13:50:10,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-23 13:50:10,534 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-07-23 13:50:10,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:10,535 INFO L225 Difference]: With dead ends: 91 [2018-07-23 13:50:10,535 INFO L226 Difference]: Without dead ends: 89 [2018-07-23 13:50:10,536 INFO L575 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-07-23 13:50:10,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-23 13:50:10,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-23 13:50:10,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-23 13:50:10,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-23 13:50:10,541 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-07-23 13:50:10,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:10,541 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-23 13:50:10,541 INFO L472 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-23 13:50:10,541 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-23 13:50:10,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-23 13:50:10,542 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:10,542 INFO L357 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2018-07-23 13:50:10,542 INFO L414 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:10,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1002205603, now seen corresponding path program 42 times [2018-07-23 13:50:10,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:10,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:10,747 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:10,747 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-23 13:50:10,748 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:10,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:10,748 INFO L185 omatonBuilderFactory]: Interpolants [9230#true, 9231#false, 9232#(<= ULTIMATE.start_main_~i~5 0), 9233#(<= ULTIMATE.start_main_~i~5 1), 9234#(<= ULTIMATE.start_main_~i~5 2), 9235#(<= ULTIMATE.start_main_~i~5 3), 9236#(<= ULTIMATE.start_main_~i~5 4), 9237#(<= ULTIMATE.start_main_~i~5 5), 9238#(<= ULTIMATE.start_main_~i~5 6), 9239#(<= ULTIMATE.start_main_~i~5 7), 9240#(<= ULTIMATE.start_main_~i~5 8), 9241#(<= ULTIMATE.start_main_~i~5 9), 9242#(<= ULTIMATE.start_main_~i~5 10), 9243#(<= ULTIMATE.start_main_~i~5 11), 9244#(<= ULTIMATE.start_main_~i~5 12), 9245#(<= ULTIMATE.start_main_~i~5 13), 9246#(<= ULTIMATE.start_main_~i~5 14), 9247#(<= ULTIMATE.start_main_~i~5 15), 9248#(<= ULTIMATE.start_main_~i~5 16), 9249#(<= ULTIMATE.start_main_~i~5 17), 9250#(<= ULTIMATE.start_main_~i~5 18), 9251#(<= ULTIMATE.start_main_~i~5 19), 9252#(<= ULTIMATE.start_main_~i~5 20), 9253#(<= ULTIMATE.start_main_~i~5 21), 9254#(<= ULTIMATE.start_main_~i~5 22), 9255#(<= ULTIMATE.start_main_~i~5 23), 9256#(<= ULTIMATE.start_main_~i~5 24), 9257#(<= ULTIMATE.start_main_~i~5 25), 9258#(<= ULTIMATE.start_main_~i~5 26), 9259#(<= ULTIMATE.start_main_~i~5 27), 9260#(<= ULTIMATE.start_main_~i~5 28), 9261#(<= ULTIMATE.start_main_~i~5 29), 9262#(<= ULTIMATE.start_main_~i~5 30), 9263#(<= ULTIMATE.start_main_~i~5 31), 9264#(<= ULTIMATE.start_main_~i~5 32), 9265#(<= ULTIMATE.start_main_~i~5 33), 9266#(<= ULTIMATE.start_main_~i~5 34), 9267#(<= ULTIMATE.start_main_~i~5 35), 9268#(<= ULTIMATE.start_main_~i~5 36), 9269#(<= ULTIMATE.start_main_~i~5 37), 9270#(<= ULTIMATE.start_main_~i~5 38), 9271#(<= ULTIMATE.start_main_~i~5 39), 9272#(<= ULTIMATE.start_main_~i~5 40), 9273#(<= ULTIMATE.start_main_~i~5 41), 9274#(<= ULTIMATE.start_main_~i~5 42)] [2018-07-23 13:50:10,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:10,749 INFO L450 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-23 13:50:10,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-23 13:50:10,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 13:50:10,751 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 45 states. [2018-07-23 13:50:10,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:10,792 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-23 13:50:10,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-23 13:50:10,792 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-07-23 13:50:10,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:10,793 INFO L225 Difference]: With dead ends: 93 [2018-07-23 13:50:10,793 INFO L226 Difference]: Without dead ends: 91 [2018-07-23 13:50:10,795 INFO L575 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-07-23 13:50:10,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-23 13:50:10,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-23 13:50:10,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-23 13:50:10,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-23 13:50:10,799 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-07-23 13:50:10,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:10,799 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-23 13:50:10,799 INFO L472 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-23 13:50:10,799 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-23 13:50:10,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-23 13:50:10,800 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:10,800 INFO L357 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2018-07-23 13:50:10,800 INFO L414 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:10,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1046977191, now seen corresponding path program 43 times [2018-07-23 13:50:10,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:11,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:11,004 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:11,004 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-23 13:50:11,004 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:11,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:11,005 INFO L185 omatonBuilderFactory]: Interpolants [9664#(<= ULTIMATE.start_main_~i~5 19), 9665#(<= ULTIMATE.start_main_~i~5 20), 9666#(<= ULTIMATE.start_main_~i~5 21), 9667#(<= ULTIMATE.start_main_~i~5 22), 9668#(<= ULTIMATE.start_main_~i~5 23), 9669#(<= ULTIMATE.start_main_~i~5 24), 9670#(<= ULTIMATE.start_main_~i~5 25), 9671#(<= ULTIMATE.start_main_~i~5 26), 9672#(<= ULTIMATE.start_main_~i~5 27), 9673#(<= ULTIMATE.start_main_~i~5 28), 9674#(<= ULTIMATE.start_main_~i~5 29), 9675#(<= ULTIMATE.start_main_~i~5 30), 9676#(<= ULTIMATE.start_main_~i~5 31), 9677#(<= ULTIMATE.start_main_~i~5 32), 9678#(<= ULTIMATE.start_main_~i~5 33), 9679#(<= ULTIMATE.start_main_~i~5 34), 9680#(<= ULTIMATE.start_main_~i~5 35), 9681#(<= ULTIMATE.start_main_~i~5 36), 9682#(<= ULTIMATE.start_main_~i~5 37), 9683#(<= ULTIMATE.start_main_~i~5 38), 9684#(<= ULTIMATE.start_main_~i~5 39), 9685#(<= ULTIMATE.start_main_~i~5 40), 9686#(<= ULTIMATE.start_main_~i~5 41), 9687#(<= ULTIMATE.start_main_~i~5 42), 9688#(<= ULTIMATE.start_main_~i~5 43), 9643#true, 9644#false, 9645#(<= ULTIMATE.start_main_~i~5 0), 9646#(<= ULTIMATE.start_main_~i~5 1), 9647#(<= ULTIMATE.start_main_~i~5 2), 9648#(<= ULTIMATE.start_main_~i~5 3), 9649#(<= ULTIMATE.start_main_~i~5 4), 9650#(<= ULTIMATE.start_main_~i~5 5), 9651#(<= ULTIMATE.start_main_~i~5 6), 9652#(<= ULTIMATE.start_main_~i~5 7), 9653#(<= ULTIMATE.start_main_~i~5 8), 9654#(<= ULTIMATE.start_main_~i~5 9), 9655#(<= ULTIMATE.start_main_~i~5 10), 9656#(<= ULTIMATE.start_main_~i~5 11), 9657#(<= ULTIMATE.start_main_~i~5 12), 9658#(<= ULTIMATE.start_main_~i~5 13), 9659#(<= ULTIMATE.start_main_~i~5 14), 9660#(<= ULTIMATE.start_main_~i~5 15), 9661#(<= ULTIMATE.start_main_~i~5 16), 9662#(<= ULTIMATE.start_main_~i~5 17), 9663#(<= ULTIMATE.start_main_~i~5 18)] [2018-07-23 13:50:11,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:11,006 INFO L450 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-23 13:50:11,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-23 13:50:11,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 13:50:11,007 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 46 states. [2018-07-23 13:50:11,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:11,038 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-23 13:50:11,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-23 13:50:11,039 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-07-23 13:50:11,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:11,039 INFO L225 Difference]: With dead ends: 95 [2018-07-23 13:50:11,040 INFO L226 Difference]: Without dead ends: 93 [2018-07-23 13:50:11,041 INFO L575 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-07-23 13:50:11,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-23 13:50:11,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-23 13:50:11,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-23 13:50:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-23 13:50:11,045 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-07-23 13:50:11,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:11,045 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-23 13:50:11,045 INFO L472 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-23 13:50:11,045 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-23 13:50:11,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-23 13:50:11,046 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:11,046 INFO L357 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2018-07-23 13:50:11,047 INFO L414 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:11,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1122800299, now seen corresponding path program 44 times [2018-07-23 13:50:11,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:11,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:11,257 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:11,257 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-23 13:50:11,258 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:11,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:11,258 INFO L185 omatonBuilderFactory]: Interpolants [10065#true, 10066#false, 10067#(<= ULTIMATE.start_main_~i~5 0), 10068#(<= ULTIMATE.start_main_~i~5 1), 10069#(<= ULTIMATE.start_main_~i~5 2), 10070#(<= ULTIMATE.start_main_~i~5 3), 10071#(<= ULTIMATE.start_main_~i~5 4), 10072#(<= ULTIMATE.start_main_~i~5 5), 10073#(<= ULTIMATE.start_main_~i~5 6), 10074#(<= ULTIMATE.start_main_~i~5 7), 10075#(<= ULTIMATE.start_main_~i~5 8), 10076#(<= ULTIMATE.start_main_~i~5 9), 10077#(<= ULTIMATE.start_main_~i~5 10), 10078#(<= ULTIMATE.start_main_~i~5 11), 10079#(<= ULTIMATE.start_main_~i~5 12), 10080#(<= ULTIMATE.start_main_~i~5 13), 10081#(<= ULTIMATE.start_main_~i~5 14), 10082#(<= ULTIMATE.start_main_~i~5 15), 10083#(<= ULTIMATE.start_main_~i~5 16), 10084#(<= ULTIMATE.start_main_~i~5 17), 10085#(<= ULTIMATE.start_main_~i~5 18), 10086#(<= ULTIMATE.start_main_~i~5 19), 10087#(<= ULTIMATE.start_main_~i~5 20), 10088#(<= ULTIMATE.start_main_~i~5 21), 10089#(<= ULTIMATE.start_main_~i~5 22), 10090#(<= ULTIMATE.start_main_~i~5 23), 10091#(<= ULTIMATE.start_main_~i~5 24), 10092#(<= ULTIMATE.start_main_~i~5 25), 10093#(<= ULTIMATE.start_main_~i~5 26), 10094#(<= ULTIMATE.start_main_~i~5 27), 10095#(<= ULTIMATE.start_main_~i~5 28), 10096#(<= ULTIMATE.start_main_~i~5 29), 10097#(<= ULTIMATE.start_main_~i~5 30), 10098#(<= ULTIMATE.start_main_~i~5 31), 10099#(<= ULTIMATE.start_main_~i~5 32), 10100#(<= ULTIMATE.start_main_~i~5 33), 10101#(<= ULTIMATE.start_main_~i~5 34), 10102#(<= ULTIMATE.start_main_~i~5 35), 10103#(<= ULTIMATE.start_main_~i~5 36), 10104#(<= ULTIMATE.start_main_~i~5 37), 10105#(<= ULTIMATE.start_main_~i~5 38), 10106#(<= ULTIMATE.start_main_~i~5 39), 10107#(<= ULTIMATE.start_main_~i~5 40), 10108#(<= ULTIMATE.start_main_~i~5 41), 10109#(<= ULTIMATE.start_main_~i~5 42), 10110#(<= ULTIMATE.start_main_~i~5 43), 10111#(<= ULTIMATE.start_main_~i~5 44)] [2018-07-23 13:50:11,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:11,259 INFO L450 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-23 13:50:11,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-23 13:50:11,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 13:50:11,261 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 47 states. [2018-07-23 13:50:11,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:11,307 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-23 13:50:11,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-23 13:50:11,307 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-07-23 13:50:11,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:11,308 INFO L225 Difference]: With dead ends: 97 [2018-07-23 13:50:11,308 INFO L226 Difference]: Without dead ends: 95 [2018-07-23 13:50:11,309 INFO L575 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-07-23 13:50:11,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-23 13:50:11,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-23 13:50:11,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-23 13:50:11,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-23 13:50:11,314 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2018-07-23 13:50:11,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:11,314 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-23 13:50:11,314 INFO L472 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-23 13:50:11,315 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-23 13:50:11,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-23 13:50:11,315 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:11,316 INFO L357 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2018-07-23 13:50:11,316 INFO L414 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:11,316 INFO L82 PathProgramCache]: Analyzing trace with hash -974363055, now seen corresponding path program 45 times [2018-07-23 13:50:11,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:11,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:11,533 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:11,534 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-23 13:50:11,534 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:11,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:11,534 INFO L185 omatonBuilderFactory]: Interpolants [10496#true, 10497#false, 10498#(<= ULTIMATE.start_main_~i~5 0), 10499#(<= ULTIMATE.start_main_~i~5 1), 10500#(<= ULTIMATE.start_main_~i~5 2), 10501#(<= ULTIMATE.start_main_~i~5 3), 10502#(<= ULTIMATE.start_main_~i~5 4), 10503#(<= ULTIMATE.start_main_~i~5 5), 10504#(<= ULTIMATE.start_main_~i~5 6), 10505#(<= ULTIMATE.start_main_~i~5 7), 10506#(<= ULTIMATE.start_main_~i~5 8), 10507#(<= ULTIMATE.start_main_~i~5 9), 10508#(<= ULTIMATE.start_main_~i~5 10), 10509#(<= ULTIMATE.start_main_~i~5 11), 10510#(<= ULTIMATE.start_main_~i~5 12), 10511#(<= ULTIMATE.start_main_~i~5 13), 10512#(<= ULTIMATE.start_main_~i~5 14), 10513#(<= ULTIMATE.start_main_~i~5 15), 10514#(<= ULTIMATE.start_main_~i~5 16), 10515#(<= ULTIMATE.start_main_~i~5 17), 10516#(<= ULTIMATE.start_main_~i~5 18), 10517#(<= ULTIMATE.start_main_~i~5 19), 10518#(<= ULTIMATE.start_main_~i~5 20), 10519#(<= ULTIMATE.start_main_~i~5 21), 10520#(<= ULTIMATE.start_main_~i~5 22), 10521#(<= ULTIMATE.start_main_~i~5 23), 10522#(<= ULTIMATE.start_main_~i~5 24), 10523#(<= ULTIMATE.start_main_~i~5 25), 10524#(<= ULTIMATE.start_main_~i~5 26), 10525#(<= ULTIMATE.start_main_~i~5 27), 10526#(<= ULTIMATE.start_main_~i~5 28), 10527#(<= ULTIMATE.start_main_~i~5 29), 10528#(<= ULTIMATE.start_main_~i~5 30), 10529#(<= ULTIMATE.start_main_~i~5 31), 10530#(<= ULTIMATE.start_main_~i~5 32), 10531#(<= ULTIMATE.start_main_~i~5 33), 10532#(<= ULTIMATE.start_main_~i~5 34), 10533#(<= ULTIMATE.start_main_~i~5 35), 10534#(<= ULTIMATE.start_main_~i~5 36), 10535#(<= ULTIMATE.start_main_~i~5 37), 10536#(<= ULTIMATE.start_main_~i~5 38), 10537#(<= ULTIMATE.start_main_~i~5 39), 10538#(<= ULTIMATE.start_main_~i~5 40), 10539#(<= ULTIMATE.start_main_~i~5 41), 10540#(<= ULTIMATE.start_main_~i~5 42), 10541#(<= ULTIMATE.start_main_~i~5 43), 10542#(<= ULTIMATE.start_main_~i~5 44), 10543#(<= ULTIMATE.start_main_~i~5 45)] [2018-07-23 13:50:11,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:11,535 INFO L450 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-23 13:50:11,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-23 13:50:11,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-23 13:50:11,537 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 48 states. [2018-07-23 13:50:11,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:11,585 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-23 13:50:11,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-23 13:50:11,585 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-07-23 13:50:11,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:11,586 INFO L225 Difference]: With dead ends: 99 [2018-07-23 13:50:11,586 INFO L226 Difference]: Without dead ends: 97 [2018-07-23 13:50:11,587 INFO L575 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-07-23 13:50:11,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-23 13:50:11,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-23 13:50:11,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-23 13:50:11,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-23 13:50:11,591 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2018-07-23 13:50:11,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:11,592 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-23 13:50:11,592 INFO L472 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-23 13:50:11,592 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-23 13:50:11,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-23 13:50:11,593 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:11,593 INFO L357 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2018-07-23 13:50:11,593 INFO L414 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:11,594 INFO L82 PathProgramCache]: Analyzing trace with hash -60092339, now seen corresponding path program 46 times [2018-07-23 13:50:11,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:11,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:11,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:11,817 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:11,818 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-23 13:50:11,818 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:11,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:11,819 INFO L185 omatonBuilderFactory]: Interpolants [10936#true, 10937#false, 10938#(<= ULTIMATE.start_main_~i~5 0), 10939#(<= ULTIMATE.start_main_~i~5 1), 10940#(<= ULTIMATE.start_main_~i~5 2), 10941#(<= ULTIMATE.start_main_~i~5 3), 10942#(<= ULTIMATE.start_main_~i~5 4), 10943#(<= ULTIMATE.start_main_~i~5 5), 10944#(<= ULTIMATE.start_main_~i~5 6), 10945#(<= ULTIMATE.start_main_~i~5 7), 10946#(<= ULTIMATE.start_main_~i~5 8), 10947#(<= ULTIMATE.start_main_~i~5 9), 10948#(<= ULTIMATE.start_main_~i~5 10), 10949#(<= ULTIMATE.start_main_~i~5 11), 10950#(<= ULTIMATE.start_main_~i~5 12), 10951#(<= ULTIMATE.start_main_~i~5 13), 10952#(<= ULTIMATE.start_main_~i~5 14), 10953#(<= ULTIMATE.start_main_~i~5 15), 10954#(<= ULTIMATE.start_main_~i~5 16), 10955#(<= ULTIMATE.start_main_~i~5 17), 10956#(<= ULTIMATE.start_main_~i~5 18), 10957#(<= ULTIMATE.start_main_~i~5 19), 10958#(<= ULTIMATE.start_main_~i~5 20), 10959#(<= ULTIMATE.start_main_~i~5 21), 10960#(<= ULTIMATE.start_main_~i~5 22), 10961#(<= ULTIMATE.start_main_~i~5 23), 10962#(<= ULTIMATE.start_main_~i~5 24), 10963#(<= ULTIMATE.start_main_~i~5 25), 10964#(<= ULTIMATE.start_main_~i~5 26), 10965#(<= ULTIMATE.start_main_~i~5 27), 10966#(<= ULTIMATE.start_main_~i~5 28), 10967#(<= ULTIMATE.start_main_~i~5 29), 10968#(<= ULTIMATE.start_main_~i~5 30), 10969#(<= ULTIMATE.start_main_~i~5 31), 10970#(<= ULTIMATE.start_main_~i~5 32), 10971#(<= ULTIMATE.start_main_~i~5 33), 10972#(<= ULTIMATE.start_main_~i~5 34), 10973#(<= ULTIMATE.start_main_~i~5 35), 10974#(<= ULTIMATE.start_main_~i~5 36), 10975#(<= ULTIMATE.start_main_~i~5 37), 10976#(<= ULTIMATE.start_main_~i~5 38), 10977#(<= ULTIMATE.start_main_~i~5 39), 10978#(<= ULTIMATE.start_main_~i~5 40), 10979#(<= ULTIMATE.start_main_~i~5 41), 10980#(<= ULTIMATE.start_main_~i~5 42), 10981#(<= ULTIMATE.start_main_~i~5 43), 10982#(<= ULTIMATE.start_main_~i~5 44), 10983#(<= ULTIMATE.start_main_~i~5 45), 10984#(<= ULTIMATE.start_main_~i~5 46)] [2018-07-23 13:50:11,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:11,820 INFO L450 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-23 13:50:11,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-23 13:50:11,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 13:50:11,821 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 49 states. [2018-07-23 13:50:11,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:11,867 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-07-23 13:50:11,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-23 13:50:11,868 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-07-23 13:50:11,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:11,869 INFO L225 Difference]: With dead ends: 101 [2018-07-23 13:50:11,869 INFO L226 Difference]: Without dead ends: 99 [2018-07-23 13:50:11,870 INFO L575 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-07-23 13:50:11,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-23 13:50:11,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-23 13:50:11,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-23 13:50:11,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-07-23 13:50:11,874 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2018-07-23 13:50:11,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:11,875 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-07-23 13:50:11,875 INFO L472 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-23 13:50:11,875 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-07-23 13:50:11,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-23 13:50:11,876 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:11,878 INFO L357 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2018-07-23 13:50:11,878 INFO L414 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:11,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1914229943, now seen corresponding path program 47 times [2018-07-23 13:50:11,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:12,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:12,117 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:12,118 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-23 13:50:12,118 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:12,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:12,119 INFO L185 omatonBuilderFactory]: Interpolants [11392#(<= ULTIMATE.start_main_~i~5 5), 11393#(<= ULTIMATE.start_main_~i~5 6), 11394#(<= ULTIMATE.start_main_~i~5 7), 11395#(<= ULTIMATE.start_main_~i~5 8), 11396#(<= ULTIMATE.start_main_~i~5 9), 11397#(<= ULTIMATE.start_main_~i~5 10), 11398#(<= ULTIMATE.start_main_~i~5 11), 11399#(<= ULTIMATE.start_main_~i~5 12), 11400#(<= ULTIMATE.start_main_~i~5 13), 11401#(<= ULTIMATE.start_main_~i~5 14), 11402#(<= ULTIMATE.start_main_~i~5 15), 11403#(<= ULTIMATE.start_main_~i~5 16), 11404#(<= ULTIMATE.start_main_~i~5 17), 11405#(<= ULTIMATE.start_main_~i~5 18), 11406#(<= ULTIMATE.start_main_~i~5 19), 11407#(<= ULTIMATE.start_main_~i~5 20), 11408#(<= ULTIMATE.start_main_~i~5 21), 11409#(<= ULTIMATE.start_main_~i~5 22), 11410#(<= ULTIMATE.start_main_~i~5 23), 11411#(<= ULTIMATE.start_main_~i~5 24), 11412#(<= ULTIMATE.start_main_~i~5 25), 11413#(<= ULTIMATE.start_main_~i~5 26), 11414#(<= ULTIMATE.start_main_~i~5 27), 11415#(<= ULTIMATE.start_main_~i~5 28), 11416#(<= ULTIMATE.start_main_~i~5 29), 11417#(<= ULTIMATE.start_main_~i~5 30), 11418#(<= ULTIMATE.start_main_~i~5 31), 11419#(<= ULTIMATE.start_main_~i~5 32), 11420#(<= ULTIMATE.start_main_~i~5 33), 11421#(<= ULTIMATE.start_main_~i~5 34), 11422#(<= ULTIMATE.start_main_~i~5 35), 11423#(<= ULTIMATE.start_main_~i~5 36), 11424#(<= ULTIMATE.start_main_~i~5 37), 11425#(<= ULTIMATE.start_main_~i~5 38), 11426#(<= ULTIMATE.start_main_~i~5 39), 11427#(<= ULTIMATE.start_main_~i~5 40), 11428#(<= ULTIMATE.start_main_~i~5 41), 11429#(<= ULTIMATE.start_main_~i~5 42), 11430#(<= ULTIMATE.start_main_~i~5 43), 11431#(<= ULTIMATE.start_main_~i~5 44), 11432#(<= ULTIMATE.start_main_~i~5 45), 11433#(<= ULTIMATE.start_main_~i~5 46), 11434#(<= ULTIMATE.start_main_~i~5 47), 11385#true, 11386#false, 11387#(<= ULTIMATE.start_main_~i~5 0), 11388#(<= ULTIMATE.start_main_~i~5 1), 11389#(<= ULTIMATE.start_main_~i~5 2), 11390#(<= ULTIMATE.start_main_~i~5 3), 11391#(<= ULTIMATE.start_main_~i~5 4)] [2018-07-23 13:50:12,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:12,120 INFO L450 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-23 13:50:12,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-23 13:50:12,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 13:50:12,122 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 50 states. [2018-07-23 13:50:12,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:12,168 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-23 13:50:12,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-23 13:50:12,169 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-07-23 13:50:12,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:12,170 INFO L225 Difference]: With dead ends: 103 [2018-07-23 13:50:12,170 INFO L226 Difference]: Without dead ends: 101 [2018-07-23 13:50:12,171 INFO L575 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-07-23 13:50:12,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-23 13:50:12,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-23 13:50:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-23 13:50:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-23 13:50:12,175 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2018-07-23 13:50:12,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:12,175 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-23 13:50:12,175 INFO L472 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-23 13:50:12,176 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-23 13:50:12,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-23 13:50:12,176 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:12,177 INFO L357 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2018-07-23 13:50:12,177 INFO L414 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:12,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1329039547, now seen corresponding path program 48 times [2018-07-23 13:50:12,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:12,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:12,441 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:12,442 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-23 13:50:12,442 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:12,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:12,443 INFO L185 omatonBuilderFactory]: Interpolants [11843#true, 11844#false, 11845#(<= ULTIMATE.start_main_~i~5 0), 11846#(<= ULTIMATE.start_main_~i~5 1), 11847#(<= ULTIMATE.start_main_~i~5 2), 11848#(<= ULTIMATE.start_main_~i~5 3), 11849#(<= ULTIMATE.start_main_~i~5 4), 11850#(<= ULTIMATE.start_main_~i~5 5), 11851#(<= ULTIMATE.start_main_~i~5 6), 11852#(<= ULTIMATE.start_main_~i~5 7), 11853#(<= ULTIMATE.start_main_~i~5 8), 11854#(<= ULTIMATE.start_main_~i~5 9), 11855#(<= ULTIMATE.start_main_~i~5 10), 11856#(<= ULTIMATE.start_main_~i~5 11), 11857#(<= ULTIMATE.start_main_~i~5 12), 11858#(<= ULTIMATE.start_main_~i~5 13), 11859#(<= ULTIMATE.start_main_~i~5 14), 11860#(<= ULTIMATE.start_main_~i~5 15), 11861#(<= ULTIMATE.start_main_~i~5 16), 11862#(<= ULTIMATE.start_main_~i~5 17), 11863#(<= ULTIMATE.start_main_~i~5 18), 11864#(<= ULTIMATE.start_main_~i~5 19), 11865#(<= ULTIMATE.start_main_~i~5 20), 11866#(<= ULTIMATE.start_main_~i~5 21), 11867#(<= ULTIMATE.start_main_~i~5 22), 11868#(<= ULTIMATE.start_main_~i~5 23), 11869#(<= ULTIMATE.start_main_~i~5 24), 11870#(<= ULTIMATE.start_main_~i~5 25), 11871#(<= ULTIMATE.start_main_~i~5 26), 11872#(<= ULTIMATE.start_main_~i~5 27), 11873#(<= ULTIMATE.start_main_~i~5 28), 11874#(<= ULTIMATE.start_main_~i~5 29), 11875#(<= ULTIMATE.start_main_~i~5 30), 11876#(<= ULTIMATE.start_main_~i~5 31), 11877#(<= ULTIMATE.start_main_~i~5 32), 11878#(<= ULTIMATE.start_main_~i~5 33), 11879#(<= ULTIMATE.start_main_~i~5 34), 11880#(<= ULTIMATE.start_main_~i~5 35), 11881#(<= ULTIMATE.start_main_~i~5 36), 11882#(<= ULTIMATE.start_main_~i~5 37), 11883#(<= ULTIMATE.start_main_~i~5 38), 11884#(<= ULTIMATE.start_main_~i~5 39), 11885#(<= ULTIMATE.start_main_~i~5 40), 11886#(<= ULTIMATE.start_main_~i~5 41), 11887#(<= ULTIMATE.start_main_~i~5 42), 11888#(<= ULTIMATE.start_main_~i~5 43), 11889#(<= ULTIMATE.start_main_~i~5 44), 11890#(<= ULTIMATE.start_main_~i~5 45), 11891#(<= ULTIMATE.start_main_~i~5 46), 11892#(<= ULTIMATE.start_main_~i~5 47), 11893#(<= ULTIMATE.start_main_~i~5 48)] [2018-07-23 13:50:12,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:12,444 INFO L450 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-23 13:50:12,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-23 13:50:12,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 13:50:12,446 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 51 states. [2018-07-23 13:50:12,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:12,502 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-23 13:50:12,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-23 13:50:12,503 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-07-23 13:50:12,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:12,504 INFO L225 Difference]: With dead ends: 105 [2018-07-23 13:50:12,504 INFO L226 Difference]: Without dead ends: 103 [2018-07-23 13:50:12,505 INFO L575 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-07-23 13:50:12,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-23 13:50:12,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-23 13:50:12,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-23 13:50:12,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-07-23 13:50:12,512 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2018-07-23 13:50:12,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:12,513 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-07-23 13:50:12,513 INFO L472 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-23 13:50:12,513 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-07-23 13:50:12,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-23 13:50:12,516 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:12,516 INFO L357 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2018-07-23 13:50:12,516 INFO L414 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:12,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1601784767, now seen corresponding path program 49 times [2018-07-23 13:50:12,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:12,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:12,823 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:12,824 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-23 13:50:12,824 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:12,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:12,825 INFO L185 omatonBuilderFactory]: Interpolants [12310#true, 12311#false, 12312#(<= ULTIMATE.start_main_~i~5 0), 12313#(<= ULTIMATE.start_main_~i~5 1), 12314#(<= ULTIMATE.start_main_~i~5 2), 12315#(<= ULTIMATE.start_main_~i~5 3), 12316#(<= ULTIMATE.start_main_~i~5 4), 12317#(<= ULTIMATE.start_main_~i~5 5), 12318#(<= ULTIMATE.start_main_~i~5 6), 12319#(<= ULTIMATE.start_main_~i~5 7), 12320#(<= ULTIMATE.start_main_~i~5 8), 12321#(<= ULTIMATE.start_main_~i~5 9), 12322#(<= ULTIMATE.start_main_~i~5 10), 12323#(<= ULTIMATE.start_main_~i~5 11), 12324#(<= ULTIMATE.start_main_~i~5 12), 12325#(<= ULTIMATE.start_main_~i~5 13), 12326#(<= ULTIMATE.start_main_~i~5 14), 12327#(<= ULTIMATE.start_main_~i~5 15), 12328#(<= ULTIMATE.start_main_~i~5 16), 12329#(<= ULTIMATE.start_main_~i~5 17), 12330#(<= ULTIMATE.start_main_~i~5 18), 12331#(<= ULTIMATE.start_main_~i~5 19), 12332#(<= ULTIMATE.start_main_~i~5 20), 12333#(<= ULTIMATE.start_main_~i~5 21), 12334#(<= ULTIMATE.start_main_~i~5 22), 12335#(<= ULTIMATE.start_main_~i~5 23), 12336#(<= ULTIMATE.start_main_~i~5 24), 12337#(<= ULTIMATE.start_main_~i~5 25), 12338#(<= ULTIMATE.start_main_~i~5 26), 12339#(<= ULTIMATE.start_main_~i~5 27), 12340#(<= ULTIMATE.start_main_~i~5 28), 12341#(<= ULTIMATE.start_main_~i~5 29), 12342#(<= ULTIMATE.start_main_~i~5 30), 12343#(<= ULTIMATE.start_main_~i~5 31), 12344#(<= ULTIMATE.start_main_~i~5 32), 12345#(<= ULTIMATE.start_main_~i~5 33), 12346#(<= ULTIMATE.start_main_~i~5 34), 12347#(<= ULTIMATE.start_main_~i~5 35), 12348#(<= ULTIMATE.start_main_~i~5 36), 12349#(<= ULTIMATE.start_main_~i~5 37), 12350#(<= ULTIMATE.start_main_~i~5 38), 12351#(<= ULTIMATE.start_main_~i~5 39), 12352#(<= ULTIMATE.start_main_~i~5 40), 12353#(<= ULTIMATE.start_main_~i~5 41), 12354#(<= ULTIMATE.start_main_~i~5 42), 12355#(<= ULTIMATE.start_main_~i~5 43), 12356#(<= ULTIMATE.start_main_~i~5 44), 12357#(<= ULTIMATE.start_main_~i~5 45), 12358#(<= ULTIMATE.start_main_~i~5 46), 12359#(<= ULTIMATE.start_main_~i~5 47), 12360#(<= ULTIMATE.start_main_~i~5 48), 12361#(<= ULTIMATE.start_main_~i~5 49)] [2018-07-23 13:50:12,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:12,826 INFO L450 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-23 13:50:12,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-23 13:50:12,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 13:50:12,828 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 52 states. [2018-07-23 13:50:12,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:12,882 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-23 13:50:12,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-23 13:50:12,883 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-07-23 13:50:12,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:12,884 INFO L225 Difference]: With dead ends: 107 [2018-07-23 13:50:12,884 INFO L226 Difference]: Without dead ends: 105 [2018-07-23 13:50:12,885 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 13:50:12,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-23 13:50:12,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-23 13:50:12,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-23 13:50:12,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-23 13:50:12,891 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2018-07-23 13:50:12,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:12,891 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-23 13:50:12,891 INFO L472 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-23 13:50:12,892 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-23 13:50:12,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-23 13:50:12,893 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:12,893 INFO L357 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2018-07-23 13:50:12,893 INFO L414 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:12,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1716936131, now seen corresponding path program 50 times [2018-07-23 13:50:12,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:13,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:13,207 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:13,207 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-23 13:50:13,207 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:13,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:13,208 INFO L185 omatonBuilderFactory]: Interpolants [12800#(<= ULTIMATE.start_main_~i~5 12), 12801#(<= ULTIMATE.start_main_~i~5 13), 12802#(<= ULTIMATE.start_main_~i~5 14), 12803#(<= ULTIMATE.start_main_~i~5 15), 12804#(<= ULTIMATE.start_main_~i~5 16), 12805#(<= ULTIMATE.start_main_~i~5 17), 12806#(<= ULTIMATE.start_main_~i~5 18), 12807#(<= ULTIMATE.start_main_~i~5 19), 12808#(<= ULTIMATE.start_main_~i~5 20), 12809#(<= ULTIMATE.start_main_~i~5 21), 12810#(<= ULTIMATE.start_main_~i~5 22), 12811#(<= ULTIMATE.start_main_~i~5 23), 12812#(<= ULTIMATE.start_main_~i~5 24), 12813#(<= ULTIMATE.start_main_~i~5 25), 12814#(<= ULTIMATE.start_main_~i~5 26), 12815#(<= ULTIMATE.start_main_~i~5 27), 12816#(<= ULTIMATE.start_main_~i~5 28), 12817#(<= ULTIMATE.start_main_~i~5 29), 12818#(<= ULTIMATE.start_main_~i~5 30), 12819#(<= ULTIMATE.start_main_~i~5 31), 12820#(<= ULTIMATE.start_main_~i~5 32), 12821#(<= ULTIMATE.start_main_~i~5 33), 12822#(<= ULTIMATE.start_main_~i~5 34), 12823#(<= ULTIMATE.start_main_~i~5 35), 12824#(<= ULTIMATE.start_main_~i~5 36), 12825#(<= ULTIMATE.start_main_~i~5 37), 12826#(<= ULTIMATE.start_main_~i~5 38), 12827#(<= ULTIMATE.start_main_~i~5 39), 12828#(<= ULTIMATE.start_main_~i~5 40), 12829#(<= ULTIMATE.start_main_~i~5 41), 12830#(<= ULTIMATE.start_main_~i~5 42), 12831#(<= ULTIMATE.start_main_~i~5 43), 12832#(<= ULTIMATE.start_main_~i~5 44), 12833#(<= ULTIMATE.start_main_~i~5 45), 12834#(<= ULTIMATE.start_main_~i~5 46), 12835#(<= ULTIMATE.start_main_~i~5 47), 12836#(<= ULTIMATE.start_main_~i~5 48), 12837#(<= ULTIMATE.start_main_~i~5 49), 12838#(<= ULTIMATE.start_main_~i~5 50), 12786#true, 12787#false, 12788#(<= ULTIMATE.start_main_~i~5 0), 12789#(<= ULTIMATE.start_main_~i~5 1), 12790#(<= ULTIMATE.start_main_~i~5 2), 12791#(<= ULTIMATE.start_main_~i~5 3), 12792#(<= ULTIMATE.start_main_~i~5 4), 12793#(<= ULTIMATE.start_main_~i~5 5), 12794#(<= ULTIMATE.start_main_~i~5 6), 12795#(<= ULTIMATE.start_main_~i~5 7), 12796#(<= ULTIMATE.start_main_~i~5 8), 12797#(<= ULTIMATE.start_main_~i~5 9), 12798#(<= ULTIMATE.start_main_~i~5 10), 12799#(<= ULTIMATE.start_main_~i~5 11)] [2018-07-23 13:50:13,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:13,209 INFO L450 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-23 13:50:13,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-23 13:50:13,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 13:50:13,210 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 53 states. [2018-07-23 13:50:13,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:13,259 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-07-23 13:50:13,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-23 13:50:13,260 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-07-23 13:50:13,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:13,261 INFO L225 Difference]: With dead ends: 109 [2018-07-23 13:50:13,261 INFO L226 Difference]: Without dead ends: 107 [2018-07-23 13:50:13,262 INFO L575 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-07-23 13:50:13,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-23 13:50:13,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-07-23 13:50:13,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-23 13:50:13,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-07-23 13:50:13,266 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2018-07-23 13:50:13,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:13,267 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-07-23 13:50:13,267 INFO L472 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-23 13:50:13,267 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-07-23 13:50:13,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-23 13:50:13,268 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:13,268 INFO L357 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2018-07-23 13:50:13,268 INFO L414 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:13,268 INFO L82 PathProgramCache]: Analyzing trace with hash -708247239, now seen corresponding path program 51 times [2018-07-23 13:50:13,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:13,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:13,512 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:13,512 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-23 13:50:13,512 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:13,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:13,513 INFO L185 omatonBuilderFactory]: Interpolants [13312#(<= ULTIMATE.start_main_~i~5 39), 13313#(<= ULTIMATE.start_main_~i~5 40), 13314#(<= ULTIMATE.start_main_~i~5 41), 13315#(<= ULTIMATE.start_main_~i~5 42), 13316#(<= ULTIMATE.start_main_~i~5 43), 13317#(<= ULTIMATE.start_main_~i~5 44), 13318#(<= ULTIMATE.start_main_~i~5 45), 13319#(<= ULTIMATE.start_main_~i~5 46), 13320#(<= ULTIMATE.start_main_~i~5 47), 13321#(<= ULTIMATE.start_main_~i~5 48), 13322#(<= ULTIMATE.start_main_~i~5 49), 13323#(<= ULTIMATE.start_main_~i~5 50), 13324#(<= ULTIMATE.start_main_~i~5 51), 13271#true, 13272#false, 13273#(<= ULTIMATE.start_main_~i~5 0), 13274#(<= ULTIMATE.start_main_~i~5 1), 13275#(<= ULTIMATE.start_main_~i~5 2), 13276#(<= ULTIMATE.start_main_~i~5 3), 13277#(<= ULTIMATE.start_main_~i~5 4), 13278#(<= ULTIMATE.start_main_~i~5 5), 13279#(<= ULTIMATE.start_main_~i~5 6), 13280#(<= ULTIMATE.start_main_~i~5 7), 13281#(<= ULTIMATE.start_main_~i~5 8), 13282#(<= ULTIMATE.start_main_~i~5 9), 13283#(<= ULTIMATE.start_main_~i~5 10), 13284#(<= ULTIMATE.start_main_~i~5 11), 13285#(<= ULTIMATE.start_main_~i~5 12), 13286#(<= ULTIMATE.start_main_~i~5 13), 13287#(<= ULTIMATE.start_main_~i~5 14), 13288#(<= ULTIMATE.start_main_~i~5 15), 13289#(<= ULTIMATE.start_main_~i~5 16), 13290#(<= ULTIMATE.start_main_~i~5 17), 13291#(<= ULTIMATE.start_main_~i~5 18), 13292#(<= ULTIMATE.start_main_~i~5 19), 13293#(<= ULTIMATE.start_main_~i~5 20), 13294#(<= ULTIMATE.start_main_~i~5 21), 13295#(<= ULTIMATE.start_main_~i~5 22), 13296#(<= ULTIMATE.start_main_~i~5 23), 13297#(<= ULTIMATE.start_main_~i~5 24), 13298#(<= ULTIMATE.start_main_~i~5 25), 13299#(<= ULTIMATE.start_main_~i~5 26), 13300#(<= ULTIMATE.start_main_~i~5 27), 13301#(<= ULTIMATE.start_main_~i~5 28), 13302#(<= ULTIMATE.start_main_~i~5 29), 13303#(<= ULTIMATE.start_main_~i~5 30), 13304#(<= ULTIMATE.start_main_~i~5 31), 13305#(<= ULTIMATE.start_main_~i~5 32), 13306#(<= ULTIMATE.start_main_~i~5 33), 13307#(<= ULTIMATE.start_main_~i~5 34), 13308#(<= ULTIMATE.start_main_~i~5 35), 13309#(<= ULTIMATE.start_main_~i~5 36), 13310#(<= ULTIMATE.start_main_~i~5 37), 13311#(<= ULTIMATE.start_main_~i~5 38)] [2018-07-23 13:50:13,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:13,514 INFO L450 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-23 13:50:13,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-23 13:50:13,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 13:50:13,515 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 54 states. [2018-07-23 13:50:13,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:13,552 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-07-23 13:50:13,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-23 13:50:13,552 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-07-23 13:50:13,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:13,553 INFO L225 Difference]: With dead ends: 111 [2018-07-23 13:50:13,553 INFO L226 Difference]: Without dead ends: 109 [2018-07-23 13:50:13,554 INFO L575 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-07-23 13:50:13,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-23 13:50:13,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-07-23 13:50:13,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-23 13:50:13,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-07-23 13:50:13,559 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2018-07-23 13:50:13,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:13,559 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-07-23 13:50:13,559 INFO L472 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-23 13:50:13,559 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-07-23 13:50:13,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-23 13:50:13,560 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:13,560 INFO L357 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2018-07-23 13:50:13,560 INFO L414 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:13,561 INFO L82 PathProgramCache]: Analyzing trace with hash -2020830923, now seen corresponding path program 52 times [2018-07-23 13:50:13,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:13,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:13,801 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:13,801 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-23 13:50:13,801 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:13,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:13,802 INFO L185 omatonBuilderFactory]: Interpolants [13765#true, 13766#false, 13767#(<= ULTIMATE.start_main_~i~5 0), 13768#(<= ULTIMATE.start_main_~i~5 1), 13769#(<= ULTIMATE.start_main_~i~5 2), 13770#(<= ULTIMATE.start_main_~i~5 3), 13771#(<= ULTIMATE.start_main_~i~5 4), 13772#(<= ULTIMATE.start_main_~i~5 5), 13773#(<= ULTIMATE.start_main_~i~5 6), 13774#(<= ULTIMATE.start_main_~i~5 7), 13775#(<= ULTIMATE.start_main_~i~5 8), 13776#(<= ULTIMATE.start_main_~i~5 9), 13777#(<= ULTIMATE.start_main_~i~5 10), 13778#(<= ULTIMATE.start_main_~i~5 11), 13779#(<= ULTIMATE.start_main_~i~5 12), 13780#(<= ULTIMATE.start_main_~i~5 13), 13781#(<= ULTIMATE.start_main_~i~5 14), 13782#(<= ULTIMATE.start_main_~i~5 15), 13783#(<= ULTIMATE.start_main_~i~5 16), 13784#(<= ULTIMATE.start_main_~i~5 17), 13785#(<= ULTIMATE.start_main_~i~5 18), 13786#(<= ULTIMATE.start_main_~i~5 19), 13787#(<= ULTIMATE.start_main_~i~5 20), 13788#(<= ULTIMATE.start_main_~i~5 21), 13789#(<= ULTIMATE.start_main_~i~5 22), 13790#(<= ULTIMATE.start_main_~i~5 23), 13791#(<= ULTIMATE.start_main_~i~5 24), 13792#(<= ULTIMATE.start_main_~i~5 25), 13793#(<= ULTIMATE.start_main_~i~5 26), 13794#(<= ULTIMATE.start_main_~i~5 27), 13795#(<= ULTIMATE.start_main_~i~5 28), 13796#(<= ULTIMATE.start_main_~i~5 29), 13797#(<= ULTIMATE.start_main_~i~5 30), 13798#(<= ULTIMATE.start_main_~i~5 31), 13799#(<= ULTIMATE.start_main_~i~5 32), 13800#(<= ULTIMATE.start_main_~i~5 33), 13801#(<= ULTIMATE.start_main_~i~5 34), 13802#(<= ULTIMATE.start_main_~i~5 35), 13803#(<= ULTIMATE.start_main_~i~5 36), 13804#(<= ULTIMATE.start_main_~i~5 37), 13805#(<= ULTIMATE.start_main_~i~5 38), 13806#(<= ULTIMATE.start_main_~i~5 39), 13807#(<= ULTIMATE.start_main_~i~5 40), 13808#(<= ULTIMATE.start_main_~i~5 41), 13809#(<= ULTIMATE.start_main_~i~5 42), 13810#(<= ULTIMATE.start_main_~i~5 43), 13811#(<= ULTIMATE.start_main_~i~5 44), 13812#(<= ULTIMATE.start_main_~i~5 45), 13813#(<= ULTIMATE.start_main_~i~5 46), 13814#(<= ULTIMATE.start_main_~i~5 47), 13815#(<= ULTIMATE.start_main_~i~5 48), 13816#(<= ULTIMATE.start_main_~i~5 49), 13817#(<= ULTIMATE.start_main_~i~5 50), 13818#(<= ULTIMATE.start_main_~i~5 51), 13819#(<= ULTIMATE.start_main_~i~5 52)] [2018-07-23 13:50:13,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:13,803 INFO L450 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-23 13:50:13,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-23 13:50:13,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 13:50:13,805 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 55 states. [2018-07-23 13:50:13,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:13,862 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-07-23 13:50:13,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-23 13:50:13,862 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-07-23 13:50:13,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:13,863 INFO L225 Difference]: With dead ends: 113 [2018-07-23 13:50:13,863 INFO L226 Difference]: Without dead ends: 111 [2018-07-23 13:50:13,864 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 13:50:13,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-07-23 13:50:13,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-07-23 13:50:13,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-23 13:50:13,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-07-23 13:50:13,872 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2018-07-23 13:50:13,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:13,872 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-07-23 13:50:13,872 INFO L472 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-23 13:50:13,872 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-07-23 13:50:13,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-23 13:50:13,873 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:13,874 INFO L357 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2018-07-23 13:50:13,874 INFO L414 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:13,874 INFO L82 PathProgramCache]: Analyzing trace with hash -693366223, now seen corresponding path program 53 times [2018-07-23 13:50:13,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:14,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:14,117 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:14,117 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-23 13:50:14,117 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:14,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:14,118 INFO L185 omatonBuilderFactory]: Interpolants [14268#true, 14269#false, 14270#(<= ULTIMATE.start_main_~i~5 0), 14271#(<= ULTIMATE.start_main_~i~5 1), 14272#(<= ULTIMATE.start_main_~i~5 2), 14273#(<= ULTIMATE.start_main_~i~5 3), 14274#(<= ULTIMATE.start_main_~i~5 4), 14275#(<= ULTIMATE.start_main_~i~5 5), 14276#(<= ULTIMATE.start_main_~i~5 6), 14277#(<= ULTIMATE.start_main_~i~5 7), 14278#(<= ULTIMATE.start_main_~i~5 8), 14279#(<= ULTIMATE.start_main_~i~5 9), 14280#(<= ULTIMATE.start_main_~i~5 10), 14281#(<= ULTIMATE.start_main_~i~5 11), 14282#(<= ULTIMATE.start_main_~i~5 12), 14283#(<= ULTIMATE.start_main_~i~5 13), 14284#(<= ULTIMATE.start_main_~i~5 14), 14285#(<= ULTIMATE.start_main_~i~5 15), 14286#(<= ULTIMATE.start_main_~i~5 16), 14287#(<= ULTIMATE.start_main_~i~5 17), 14288#(<= ULTIMATE.start_main_~i~5 18), 14289#(<= ULTIMATE.start_main_~i~5 19), 14290#(<= ULTIMATE.start_main_~i~5 20), 14291#(<= ULTIMATE.start_main_~i~5 21), 14292#(<= ULTIMATE.start_main_~i~5 22), 14293#(<= ULTIMATE.start_main_~i~5 23), 14294#(<= ULTIMATE.start_main_~i~5 24), 14295#(<= ULTIMATE.start_main_~i~5 25), 14296#(<= ULTIMATE.start_main_~i~5 26), 14297#(<= ULTIMATE.start_main_~i~5 27), 14298#(<= ULTIMATE.start_main_~i~5 28), 14299#(<= ULTIMATE.start_main_~i~5 29), 14300#(<= ULTIMATE.start_main_~i~5 30), 14301#(<= ULTIMATE.start_main_~i~5 31), 14302#(<= ULTIMATE.start_main_~i~5 32), 14303#(<= ULTIMATE.start_main_~i~5 33), 14304#(<= ULTIMATE.start_main_~i~5 34), 14305#(<= ULTIMATE.start_main_~i~5 35), 14306#(<= ULTIMATE.start_main_~i~5 36), 14307#(<= ULTIMATE.start_main_~i~5 37), 14308#(<= ULTIMATE.start_main_~i~5 38), 14309#(<= ULTIMATE.start_main_~i~5 39), 14310#(<= ULTIMATE.start_main_~i~5 40), 14311#(<= ULTIMATE.start_main_~i~5 41), 14312#(<= ULTIMATE.start_main_~i~5 42), 14313#(<= ULTIMATE.start_main_~i~5 43), 14314#(<= ULTIMATE.start_main_~i~5 44), 14315#(<= ULTIMATE.start_main_~i~5 45), 14316#(<= ULTIMATE.start_main_~i~5 46), 14317#(<= ULTIMATE.start_main_~i~5 47), 14318#(<= ULTIMATE.start_main_~i~5 48), 14319#(<= ULTIMATE.start_main_~i~5 49), 14320#(<= ULTIMATE.start_main_~i~5 50), 14321#(<= ULTIMATE.start_main_~i~5 51), 14322#(<= ULTIMATE.start_main_~i~5 52), 14323#(<= ULTIMATE.start_main_~i~5 53)] [2018-07-23 13:50:14,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:14,119 INFO L450 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-23 13:50:14,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-23 13:50:14,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 13:50:14,121 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 56 states. [2018-07-23 13:50:14,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:14,180 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-07-23 13:50:14,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-23 13:50:14,181 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-07-23 13:50:14,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:14,182 INFO L225 Difference]: With dead ends: 115 [2018-07-23 13:50:14,182 INFO L226 Difference]: Without dead ends: 113 [2018-07-23 13:50:14,183 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 13:50:14,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-23 13:50:14,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-07-23 13:50:14,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-23 13:50:14,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-07-23 13:50:14,187 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2018-07-23 13:50:14,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:14,187 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-07-23 13:50:14,188 INFO L472 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-23 13:50:14,188 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-07-23 13:50:14,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-23 13:50:14,189 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:14,189 INFO L357 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2018-07-23 13:50:14,189 INFO L414 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:14,189 INFO L82 PathProgramCache]: Analyzing trace with hash -605076435, now seen corresponding path program 54 times [2018-07-23 13:50:14,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:14,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:14,430 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:14,430 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-23 13:50:14,431 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:14,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:14,431 INFO L185 omatonBuilderFactory]: Interpolants [14780#true, 14781#false, 14782#(<= ULTIMATE.start_main_~i~5 0), 14783#(<= ULTIMATE.start_main_~i~5 1), 14784#(<= ULTIMATE.start_main_~i~5 2), 14785#(<= ULTIMATE.start_main_~i~5 3), 14786#(<= ULTIMATE.start_main_~i~5 4), 14787#(<= ULTIMATE.start_main_~i~5 5), 14788#(<= ULTIMATE.start_main_~i~5 6), 14789#(<= ULTIMATE.start_main_~i~5 7), 14790#(<= ULTIMATE.start_main_~i~5 8), 14791#(<= ULTIMATE.start_main_~i~5 9), 14792#(<= ULTIMATE.start_main_~i~5 10), 14793#(<= ULTIMATE.start_main_~i~5 11), 14794#(<= ULTIMATE.start_main_~i~5 12), 14795#(<= ULTIMATE.start_main_~i~5 13), 14796#(<= ULTIMATE.start_main_~i~5 14), 14797#(<= ULTIMATE.start_main_~i~5 15), 14798#(<= ULTIMATE.start_main_~i~5 16), 14799#(<= ULTIMATE.start_main_~i~5 17), 14800#(<= ULTIMATE.start_main_~i~5 18), 14801#(<= ULTIMATE.start_main_~i~5 19), 14802#(<= ULTIMATE.start_main_~i~5 20), 14803#(<= ULTIMATE.start_main_~i~5 21), 14804#(<= ULTIMATE.start_main_~i~5 22), 14805#(<= ULTIMATE.start_main_~i~5 23), 14806#(<= ULTIMATE.start_main_~i~5 24), 14807#(<= ULTIMATE.start_main_~i~5 25), 14808#(<= ULTIMATE.start_main_~i~5 26), 14809#(<= ULTIMATE.start_main_~i~5 27), 14810#(<= ULTIMATE.start_main_~i~5 28), 14811#(<= ULTIMATE.start_main_~i~5 29), 14812#(<= ULTIMATE.start_main_~i~5 30), 14813#(<= ULTIMATE.start_main_~i~5 31), 14814#(<= ULTIMATE.start_main_~i~5 32), 14815#(<= ULTIMATE.start_main_~i~5 33), 14816#(<= ULTIMATE.start_main_~i~5 34), 14817#(<= ULTIMATE.start_main_~i~5 35), 14818#(<= ULTIMATE.start_main_~i~5 36), 14819#(<= ULTIMATE.start_main_~i~5 37), 14820#(<= ULTIMATE.start_main_~i~5 38), 14821#(<= ULTIMATE.start_main_~i~5 39), 14822#(<= ULTIMATE.start_main_~i~5 40), 14823#(<= ULTIMATE.start_main_~i~5 41), 14824#(<= ULTIMATE.start_main_~i~5 42), 14825#(<= ULTIMATE.start_main_~i~5 43), 14826#(<= ULTIMATE.start_main_~i~5 44), 14827#(<= ULTIMATE.start_main_~i~5 45), 14828#(<= ULTIMATE.start_main_~i~5 46), 14829#(<= ULTIMATE.start_main_~i~5 47), 14830#(<= ULTIMATE.start_main_~i~5 48), 14831#(<= ULTIMATE.start_main_~i~5 49), 14832#(<= ULTIMATE.start_main_~i~5 50), 14833#(<= ULTIMATE.start_main_~i~5 51), 14834#(<= ULTIMATE.start_main_~i~5 52), 14835#(<= ULTIMATE.start_main_~i~5 53), 14836#(<= ULTIMATE.start_main_~i~5 54)] [2018-07-23 13:50:14,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:14,432 INFO L450 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-23 13:50:14,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-23 13:50:14,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 13:50:14,434 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 57 states. [2018-07-23 13:50:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:14,497 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-07-23 13:50:14,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-23 13:50:14,497 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-07-23 13:50:14,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:14,498 INFO L225 Difference]: With dead ends: 117 [2018-07-23 13:50:14,499 INFO L226 Difference]: Without dead ends: 115 [2018-07-23 13:50:14,500 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 13:50:14,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-23 13:50:14,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-07-23 13:50:14,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-23 13:50:14,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-07-23 13:50:14,504 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2018-07-23 13:50:14,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:14,504 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-07-23 13:50:14,504 INFO L472 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-23 13:50:14,505 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-07-23 13:50:14,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-23 13:50:14,506 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:14,506 INFO L357 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2018-07-23 13:50:14,506 INFO L414 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:14,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1657936087, now seen corresponding path program 55 times [2018-07-23 13:50:14,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:14,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:14,766 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:14,766 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-23 13:50:14,767 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:14,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:14,767 INFO L185 omatonBuilderFactory]: Interpolants [15301#true, 15302#false, 15303#(<= ULTIMATE.start_main_~i~5 0), 15304#(<= ULTIMATE.start_main_~i~5 1), 15305#(<= ULTIMATE.start_main_~i~5 2), 15306#(<= ULTIMATE.start_main_~i~5 3), 15307#(<= ULTIMATE.start_main_~i~5 4), 15308#(<= ULTIMATE.start_main_~i~5 5), 15309#(<= ULTIMATE.start_main_~i~5 6), 15310#(<= ULTIMATE.start_main_~i~5 7), 15311#(<= ULTIMATE.start_main_~i~5 8), 15312#(<= ULTIMATE.start_main_~i~5 9), 15313#(<= ULTIMATE.start_main_~i~5 10), 15314#(<= ULTIMATE.start_main_~i~5 11), 15315#(<= ULTIMATE.start_main_~i~5 12), 15316#(<= ULTIMATE.start_main_~i~5 13), 15317#(<= ULTIMATE.start_main_~i~5 14), 15318#(<= ULTIMATE.start_main_~i~5 15), 15319#(<= ULTIMATE.start_main_~i~5 16), 15320#(<= ULTIMATE.start_main_~i~5 17), 15321#(<= ULTIMATE.start_main_~i~5 18), 15322#(<= ULTIMATE.start_main_~i~5 19), 15323#(<= ULTIMATE.start_main_~i~5 20), 15324#(<= ULTIMATE.start_main_~i~5 21), 15325#(<= ULTIMATE.start_main_~i~5 22), 15326#(<= ULTIMATE.start_main_~i~5 23), 15327#(<= ULTIMATE.start_main_~i~5 24), 15328#(<= ULTIMATE.start_main_~i~5 25), 15329#(<= ULTIMATE.start_main_~i~5 26), 15330#(<= ULTIMATE.start_main_~i~5 27), 15331#(<= ULTIMATE.start_main_~i~5 28), 15332#(<= ULTIMATE.start_main_~i~5 29), 15333#(<= ULTIMATE.start_main_~i~5 30), 15334#(<= ULTIMATE.start_main_~i~5 31), 15335#(<= ULTIMATE.start_main_~i~5 32), 15336#(<= ULTIMATE.start_main_~i~5 33), 15337#(<= ULTIMATE.start_main_~i~5 34), 15338#(<= ULTIMATE.start_main_~i~5 35), 15339#(<= ULTIMATE.start_main_~i~5 36), 15340#(<= ULTIMATE.start_main_~i~5 37), 15341#(<= ULTIMATE.start_main_~i~5 38), 15342#(<= ULTIMATE.start_main_~i~5 39), 15343#(<= ULTIMATE.start_main_~i~5 40), 15344#(<= ULTIMATE.start_main_~i~5 41), 15345#(<= ULTIMATE.start_main_~i~5 42), 15346#(<= ULTIMATE.start_main_~i~5 43), 15347#(<= ULTIMATE.start_main_~i~5 44), 15348#(<= ULTIMATE.start_main_~i~5 45), 15349#(<= ULTIMATE.start_main_~i~5 46), 15350#(<= ULTIMATE.start_main_~i~5 47), 15351#(<= ULTIMATE.start_main_~i~5 48), 15352#(<= ULTIMATE.start_main_~i~5 49), 15353#(<= ULTIMATE.start_main_~i~5 50), 15354#(<= ULTIMATE.start_main_~i~5 51), 15355#(<= ULTIMATE.start_main_~i~5 52), 15356#(<= ULTIMATE.start_main_~i~5 53), 15357#(<= ULTIMATE.start_main_~i~5 54), 15358#(<= ULTIMATE.start_main_~i~5 55)] [2018-07-23 13:50:14,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:14,768 INFO L450 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-23 13:50:14,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-23 13:50:14,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 13:50:14,770 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 58 states. [2018-07-23 13:50:14,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:14,839 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-07-23 13:50:14,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-23 13:50:14,840 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-07-23 13:50:14,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:14,841 INFO L225 Difference]: With dead ends: 119 [2018-07-23 13:50:14,841 INFO L226 Difference]: Without dead ends: 117 [2018-07-23 13:50:14,842 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 13:50:14,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-07-23 13:50:14,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-07-23 13:50:14,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-23 13:50:14,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-07-23 13:50:14,847 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2018-07-23 13:50:14,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:14,847 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-07-23 13:50:14,848 INFO L472 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-23 13:50:14,848 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-07-23 13:50:14,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-23 13:50:14,849 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:14,849 INFO L357 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2018-07-23 13:50:14,849 INFO L414 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:14,850 INFO L82 PathProgramCache]: Analyzing trace with hash 156220197, now seen corresponding path program 56 times [2018-07-23 13:50:14,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:15,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:15,109 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:15,109 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-23 13:50:15,109 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:15,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:15,110 INFO L185 omatonBuilderFactory]: Interpolants [15872#(<= ULTIMATE.start_main_~i~5 39), 15873#(<= ULTIMATE.start_main_~i~5 40), 15874#(<= ULTIMATE.start_main_~i~5 41), 15875#(<= ULTIMATE.start_main_~i~5 42), 15876#(<= ULTIMATE.start_main_~i~5 43), 15877#(<= ULTIMATE.start_main_~i~5 44), 15878#(<= ULTIMATE.start_main_~i~5 45), 15879#(<= ULTIMATE.start_main_~i~5 46), 15880#(<= ULTIMATE.start_main_~i~5 47), 15881#(<= ULTIMATE.start_main_~i~5 48), 15882#(<= ULTIMATE.start_main_~i~5 49), 15883#(<= ULTIMATE.start_main_~i~5 50), 15884#(<= ULTIMATE.start_main_~i~5 51), 15885#(<= ULTIMATE.start_main_~i~5 52), 15886#(<= ULTIMATE.start_main_~i~5 53), 15887#(<= ULTIMATE.start_main_~i~5 54), 15888#(<= ULTIMATE.start_main_~i~5 55), 15889#(<= ULTIMATE.start_main_~i~5 56), 15831#true, 15832#false, 15833#(<= ULTIMATE.start_main_~i~5 0), 15834#(<= ULTIMATE.start_main_~i~5 1), 15835#(<= ULTIMATE.start_main_~i~5 2), 15836#(<= ULTIMATE.start_main_~i~5 3), 15837#(<= ULTIMATE.start_main_~i~5 4), 15838#(<= ULTIMATE.start_main_~i~5 5), 15839#(<= ULTIMATE.start_main_~i~5 6), 15840#(<= ULTIMATE.start_main_~i~5 7), 15841#(<= ULTIMATE.start_main_~i~5 8), 15842#(<= ULTIMATE.start_main_~i~5 9), 15843#(<= ULTIMATE.start_main_~i~5 10), 15844#(<= ULTIMATE.start_main_~i~5 11), 15845#(<= ULTIMATE.start_main_~i~5 12), 15846#(<= ULTIMATE.start_main_~i~5 13), 15847#(<= ULTIMATE.start_main_~i~5 14), 15848#(<= ULTIMATE.start_main_~i~5 15), 15849#(<= ULTIMATE.start_main_~i~5 16), 15850#(<= ULTIMATE.start_main_~i~5 17), 15851#(<= ULTIMATE.start_main_~i~5 18), 15852#(<= ULTIMATE.start_main_~i~5 19), 15853#(<= ULTIMATE.start_main_~i~5 20), 15854#(<= ULTIMATE.start_main_~i~5 21), 15855#(<= ULTIMATE.start_main_~i~5 22), 15856#(<= ULTIMATE.start_main_~i~5 23), 15857#(<= ULTIMATE.start_main_~i~5 24), 15858#(<= ULTIMATE.start_main_~i~5 25), 15859#(<= ULTIMATE.start_main_~i~5 26), 15860#(<= ULTIMATE.start_main_~i~5 27), 15861#(<= ULTIMATE.start_main_~i~5 28), 15862#(<= ULTIMATE.start_main_~i~5 29), 15863#(<= ULTIMATE.start_main_~i~5 30), 15864#(<= ULTIMATE.start_main_~i~5 31), 15865#(<= ULTIMATE.start_main_~i~5 32), 15866#(<= ULTIMATE.start_main_~i~5 33), 15867#(<= ULTIMATE.start_main_~i~5 34), 15868#(<= ULTIMATE.start_main_~i~5 35), 15869#(<= ULTIMATE.start_main_~i~5 36), 15870#(<= ULTIMATE.start_main_~i~5 37), 15871#(<= ULTIMATE.start_main_~i~5 38)] [2018-07-23 13:50:15,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:15,111 INFO L450 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-23 13:50:15,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-23 13:50:15,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 13:50:15,112 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 59 states. [2018-07-23 13:50:15,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:15,155 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-07-23 13:50:15,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-23 13:50:15,155 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2018-07-23 13:50:15,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:15,156 INFO L225 Difference]: With dead ends: 121 [2018-07-23 13:50:15,156 INFO L226 Difference]: Without dead ends: 119 [2018-07-23 13:50:15,158 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 13:50:15,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-23 13:50:15,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-07-23 13:50:15,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-23 13:50:15,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-07-23 13:50:15,162 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2018-07-23 13:50:15,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:15,162 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-07-23 13:50:15,162 INFO L472 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-23 13:50:15,162 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-07-23 13:50:15,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-23 13:50:15,163 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:15,163 INFO L357 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2018-07-23 13:50:15,164 INFO L414 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:15,164 INFO L82 PathProgramCache]: Analyzing trace with hash -196313055, now seen corresponding path program 57 times [2018-07-23 13:50:15,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:15,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:15,464 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:15,465 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-23 13:50:15,465 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:15,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:15,466 INFO L185 omatonBuilderFactory]: Interpolants [16384#(<= ULTIMATE.start_main_~i~5 12), 16385#(<= ULTIMATE.start_main_~i~5 13), 16386#(<= ULTIMATE.start_main_~i~5 14), 16387#(<= ULTIMATE.start_main_~i~5 15), 16388#(<= ULTIMATE.start_main_~i~5 16), 16389#(<= ULTIMATE.start_main_~i~5 17), 16390#(<= ULTIMATE.start_main_~i~5 18), 16391#(<= ULTIMATE.start_main_~i~5 19), 16392#(<= ULTIMATE.start_main_~i~5 20), 16393#(<= ULTIMATE.start_main_~i~5 21), 16394#(<= ULTIMATE.start_main_~i~5 22), 16395#(<= ULTIMATE.start_main_~i~5 23), 16396#(<= ULTIMATE.start_main_~i~5 24), 16397#(<= ULTIMATE.start_main_~i~5 25), 16398#(<= ULTIMATE.start_main_~i~5 26), 16399#(<= ULTIMATE.start_main_~i~5 27), 16400#(<= ULTIMATE.start_main_~i~5 28), 16401#(<= ULTIMATE.start_main_~i~5 29), 16402#(<= ULTIMATE.start_main_~i~5 30), 16403#(<= ULTIMATE.start_main_~i~5 31), 16404#(<= ULTIMATE.start_main_~i~5 32), 16405#(<= ULTIMATE.start_main_~i~5 33), 16406#(<= ULTIMATE.start_main_~i~5 34), 16407#(<= ULTIMATE.start_main_~i~5 35), 16408#(<= ULTIMATE.start_main_~i~5 36), 16409#(<= ULTIMATE.start_main_~i~5 37), 16410#(<= ULTIMATE.start_main_~i~5 38), 16411#(<= ULTIMATE.start_main_~i~5 39), 16412#(<= ULTIMATE.start_main_~i~5 40), 16413#(<= ULTIMATE.start_main_~i~5 41), 16414#(<= ULTIMATE.start_main_~i~5 42), 16415#(<= ULTIMATE.start_main_~i~5 43), 16416#(<= ULTIMATE.start_main_~i~5 44), 16417#(<= ULTIMATE.start_main_~i~5 45), 16418#(<= ULTIMATE.start_main_~i~5 46), 16419#(<= ULTIMATE.start_main_~i~5 47), 16420#(<= ULTIMATE.start_main_~i~5 48), 16421#(<= ULTIMATE.start_main_~i~5 49), 16422#(<= ULTIMATE.start_main_~i~5 50), 16423#(<= ULTIMATE.start_main_~i~5 51), 16424#(<= ULTIMATE.start_main_~i~5 52), 16425#(<= ULTIMATE.start_main_~i~5 53), 16426#(<= ULTIMATE.start_main_~i~5 54), 16427#(<= ULTIMATE.start_main_~i~5 55), 16428#(<= ULTIMATE.start_main_~i~5 56), 16429#(<= ULTIMATE.start_main_~i~5 57), 16370#true, 16371#false, 16372#(<= ULTIMATE.start_main_~i~5 0), 16373#(<= ULTIMATE.start_main_~i~5 1), 16374#(<= ULTIMATE.start_main_~i~5 2), 16375#(<= ULTIMATE.start_main_~i~5 3), 16376#(<= ULTIMATE.start_main_~i~5 4), 16377#(<= ULTIMATE.start_main_~i~5 5), 16378#(<= ULTIMATE.start_main_~i~5 6), 16379#(<= ULTIMATE.start_main_~i~5 7), 16380#(<= ULTIMATE.start_main_~i~5 8), 16381#(<= ULTIMATE.start_main_~i~5 9), 16382#(<= ULTIMATE.start_main_~i~5 10), 16383#(<= ULTIMATE.start_main_~i~5 11)] [2018-07-23 13:50:15,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:15,467 INFO L450 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-23 13:50:15,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-23 13:50:15,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 13:50:15,470 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 60 states. [2018-07-23 13:50:15,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:15,541 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-07-23 13:50:15,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-23 13:50:15,541 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-07-23 13:50:15,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:15,542 INFO L225 Difference]: With dead ends: 123 [2018-07-23 13:50:15,543 INFO L226 Difference]: Without dead ends: 121 [2018-07-23 13:50:15,544 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 13:50:15,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-23 13:50:15,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-07-23 13:50:15,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-23 13:50:15,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-07-23 13:50:15,550 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2018-07-23 13:50:15,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:15,551 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-07-23 13:50:15,551 INFO L472 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-23 13:50:15,551 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-07-23 13:50:15,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-23 13:50:15,552 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:15,552 INFO L357 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2018-07-23 13:50:15,553 INFO L414 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:15,553 INFO L82 PathProgramCache]: Analyzing trace with hash 321648157, now seen corresponding path program 58 times [2018-07-23 13:50:15,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:15,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:15,943 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:15,943 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-23 13:50:15,943 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:15,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:15,944 INFO L185 omatonBuilderFactory]: Interpolants [16918#true, 16919#false, 16920#(<= ULTIMATE.start_main_~i~5 0), 16921#(<= ULTIMATE.start_main_~i~5 1), 16922#(<= ULTIMATE.start_main_~i~5 2), 16923#(<= ULTIMATE.start_main_~i~5 3), 16924#(<= ULTIMATE.start_main_~i~5 4), 16925#(<= ULTIMATE.start_main_~i~5 5), 16926#(<= ULTIMATE.start_main_~i~5 6), 16927#(<= ULTIMATE.start_main_~i~5 7), 16928#(<= ULTIMATE.start_main_~i~5 8), 16929#(<= ULTIMATE.start_main_~i~5 9), 16930#(<= ULTIMATE.start_main_~i~5 10), 16931#(<= ULTIMATE.start_main_~i~5 11), 16932#(<= ULTIMATE.start_main_~i~5 12), 16933#(<= ULTIMATE.start_main_~i~5 13), 16934#(<= ULTIMATE.start_main_~i~5 14), 16935#(<= ULTIMATE.start_main_~i~5 15), 16936#(<= ULTIMATE.start_main_~i~5 16), 16937#(<= ULTIMATE.start_main_~i~5 17), 16938#(<= ULTIMATE.start_main_~i~5 18), 16939#(<= ULTIMATE.start_main_~i~5 19), 16940#(<= ULTIMATE.start_main_~i~5 20), 16941#(<= ULTIMATE.start_main_~i~5 21), 16942#(<= ULTIMATE.start_main_~i~5 22), 16943#(<= ULTIMATE.start_main_~i~5 23), 16944#(<= ULTIMATE.start_main_~i~5 24), 16945#(<= ULTIMATE.start_main_~i~5 25), 16946#(<= ULTIMATE.start_main_~i~5 26), 16947#(<= ULTIMATE.start_main_~i~5 27), 16948#(<= ULTIMATE.start_main_~i~5 28), 16949#(<= ULTIMATE.start_main_~i~5 29), 16950#(<= ULTIMATE.start_main_~i~5 30), 16951#(<= ULTIMATE.start_main_~i~5 31), 16952#(<= ULTIMATE.start_main_~i~5 32), 16953#(<= ULTIMATE.start_main_~i~5 33), 16954#(<= ULTIMATE.start_main_~i~5 34), 16955#(<= ULTIMATE.start_main_~i~5 35), 16956#(<= ULTIMATE.start_main_~i~5 36), 16957#(<= ULTIMATE.start_main_~i~5 37), 16958#(<= ULTIMATE.start_main_~i~5 38), 16959#(<= ULTIMATE.start_main_~i~5 39), 16960#(<= ULTIMATE.start_main_~i~5 40), 16961#(<= ULTIMATE.start_main_~i~5 41), 16962#(<= ULTIMATE.start_main_~i~5 42), 16963#(<= ULTIMATE.start_main_~i~5 43), 16964#(<= ULTIMATE.start_main_~i~5 44), 16965#(<= ULTIMATE.start_main_~i~5 45), 16966#(<= ULTIMATE.start_main_~i~5 46), 16967#(<= ULTIMATE.start_main_~i~5 47), 16968#(<= ULTIMATE.start_main_~i~5 48), 16969#(<= ULTIMATE.start_main_~i~5 49), 16970#(<= ULTIMATE.start_main_~i~5 50), 16971#(<= ULTIMATE.start_main_~i~5 51), 16972#(<= ULTIMATE.start_main_~i~5 52), 16973#(<= ULTIMATE.start_main_~i~5 53), 16974#(<= ULTIMATE.start_main_~i~5 54), 16975#(<= ULTIMATE.start_main_~i~5 55), 16976#(<= ULTIMATE.start_main_~i~5 56), 16977#(<= ULTIMATE.start_main_~i~5 57), 16978#(<= ULTIMATE.start_main_~i~5 58)] [2018-07-23 13:50:15,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:15,944 INFO L450 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-23 13:50:15,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-23 13:50:15,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 13:50:15,946 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 61 states. [2018-07-23 13:50:16,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:16,022 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-07-23 13:50:16,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-23 13:50:16,022 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-07-23 13:50:16,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:16,023 INFO L225 Difference]: With dead ends: 125 [2018-07-23 13:50:16,023 INFO L226 Difference]: Without dead ends: 123 [2018-07-23 13:50:16,025 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 13:50:16,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-23 13:50:16,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-07-23 13:50:16,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-07-23 13:50:16,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-07-23 13:50:16,029 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2018-07-23 13:50:16,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:16,030 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-07-23 13:50:16,030 INFO L472 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-23 13:50:16,030 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-07-23 13:50:16,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-23 13:50:16,031 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:16,032 INFO L357 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2018-07-23 13:50:16,032 INFO L414 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:16,032 INFO L82 PathProgramCache]: Analyzing trace with hash -133833447, now seen corresponding path program 59 times [2018-07-23 13:50:16,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:16,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:16,296 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:16,296 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-23 13:50:16,296 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:16,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:16,297 INFO L185 omatonBuilderFactory]: Interpolants [17536#(<= ULTIMATE.start_main_~i~5 59), 17475#true, 17476#false, 17477#(<= ULTIMATE.start_main_~i~5 0), 17478#(<= ULTIMATE.start_main_~i~5 1), 17479#(<= ULTIMATE.start_main_~i~5 2), 17480#(<= ULTIMATE.start_main_~i~5 3), 17481#(<= ULTIMATE.start_main_~i~5 4), 17482#(<= ULTIMATE.start_main_~i~5 5), 17483#(<= ULTIMATE.start_main_~i~5 6), 17484#(<= ULTIMATE.start_main_~i~5 7), 17485#(<= ULTIMATE.start_main_~i~5 8), 17486#(<= ULTIMATE.start_main_~i~5 9), 17487#(<= ULTIMATE.start_main_~i~5 10), 17488#(<= ULTIMATE.start_main_~i~5 11), 17489#(<= ULTIMATE.start_main_~i~5 12), 17490#(<= ULTIMATE.start_main_~i~5 13), 17491#(<= ULTIMATE.start_main_~i~5 14), 17492#(<= ULTIMATE.start_main_~i~5 15), 17493#(<= ULTIMATE.start_main_~i~5 16), 17494#(<= ULTIMATE.start_main_~i~5 17), 17495#(<= ULTIMATE.start_main_~i~5 18), 17496#(<= ULTIMATE.start_main_~i~5 19), 17497#(<= ULTIMATE.start_main_~i~5 20), 17498#(<= ULTIMATE.start_main_~i~5 21), 17499#(<= ULTIMATE.start_main_~i~5 22), 17500#(<= ULTIMATE.start_main_~i~5 23), 17501#(<= ULTIMATE.start_main_~i~5 24), 17502#(<= ULTIMATE.start_main_~i~5 25), 17503#(<= ULTIMATE.start_main_~i~5 26), 17504#(<= ULTIMATE.start_main_~i~5 27), 17505#(<= ULTIMATE.start_main_~i~5 28), 17506#(<= ULTIMATE.start_main_~i~5 29), 17507#(<= ULTIMATE.start_main_~i~5 30), 17508#(<= ULTIMATE.start_main_~i~5 31), 17509#(<= ULTIMATE.start_main_~i~5 32), 17510#(<= ULTIMATE.start_main_~i~5 33), 17511#(<= ULTIMATE.start_main_~i~5 34), 17512#(<= ULTIMATE.start_main_~i~5 35), 17513#(<= ULTIMATE.start_main_~i~5 36), 17514#(<= ULTIMATE.start_main_~i~5 37), 17515#(<= ULTIMATE.start_main_~i~5 38), 17516#(<= ULTIMATE.start_main_~i~5 39), 17517#(<= ULTIMATE.start_main_~i~5 40), 17518#(<= ULTIMATE.start_main_~i~5 41), 17519#(<= ULTIMATE.start_main_~i~5 42), 17520#(<= ULTIMATE.start_main_~i~5 43), 17521#(<= ULTIMATE.start_main_~i~5 44), 17522#(<= ULTIMATE.start_main_~i~5 45), 17523#(<= ULTIMATE.start_main_~i~5 46), 17524#(<= ULTIMATE.start_main_~i~5 47), 17525#(<= ULTIMATE.start_main_~i~5 48), 17526#(<= ULTIMATE.start_main_~i~5 49), 17527#(<= ULTIMATE.start_main_~i~5 50), 17528#(<= ULTIMATE.start_main_~i~5 51), 17529#(<= ULTIMATE.start_main_~i~5 52), 17530#(<= ULTIMATE.start_main_~i~5 53), 17531#(<= ULTIMATE.start_main_~i~5 54), 17532#(<= ULTIMATE.start_main_~i~5 55), 17533#(<= ULTIMATE.start_main_~i~5 56), 17534#(<= ULTIMATE.start_main_~i~5 57), 17535#(<= ULTIMATE.start_main_~i~5 58)] [2018-07-23 13:50:16,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:16,298 INFO L450 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-23 13:50:16,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-23 13:50:16,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 13:50:16,300 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 62 states. [2018-07-23 13:50:16,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:16,365 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-07-23 13:50:16,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-23 13:50:16,365 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-07-23 13:50:16,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:16,367 INFO L225 Difference]: With dead ends: 127 [2018-07-23 13:50:16,367 INFO L226 Difference]: Without dead ends: 125 [2018-07-23 13:50:16,368 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 13:50:16,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-23 13:50:16,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-07-23 13:50:16,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-23 13:50:16,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-07-23 13:50:16,373 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2018-07-23 13:50:16,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:16,373 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-07-23 13:50:16,373 INFO L472 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-23 13:50:16,373 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-07-23 13:50:16,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-23 13:50:16,374 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:16,375 INFO L357 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2018-07-23 13:50:16,375 INFO L414 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:16,375 INFO L82 PathProgramCache]: Analyzing trace with hash 235009301, now seen corresponding path program 60 times [2018-07-23 13:50:16,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:16,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:16,637 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:16,637 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-23 13:50:16,638 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:16,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:16,638 INFO L185 omatonBuilderFactory]: Interpolants [18048#(<= ULTIMATE.start_main_~i~5 5), 18049#(<= ULTIMATE.start_main_~i~5 6), 18050#(<= ULTIMATE.start_main_~i~5 7), 18051#(<= ULTIMATE.start_main_~i~5 8), 18052#(<= ULTIMATE.start_main_~i~5 9), 18053#(<= ULTIMATE.start_main_~i~5 10), 18054#(<= ULTIMATE.start_main_~i~5 11), 18055#(<= ULTIMATE.start_main_~i~5 12), 18056#(<= ULTIMATE.start_main_~i~5 13), 18057#(<= ULTIMATE.start_main_~i~5 14), 18058#(<= ULTIMATE.start_main_~i~5 15), 18059#(<= ULTIMATE.start_main_~i~5 16), 18060#(<= ULTIMATE.start_main_~i~5 17), 18061#(<= ULTIMATE.start_main_~i~5 18), 18062#(<= ULTIMATE.start_main_~i~5 19), 18063#(<= ULTIMATE.start_main_~i~5 20), 18064#(<= ULTIMATE.start_main_~i~5 21), 18065#(<= ULTIMATE.start_main_~i~5 22), 18066#(<= ULTIMATE.start_main_~i~5 23), 18067#(<= ULTIMATE.start_main_~i~5 24), 18068#(<= ULTIMATE.start_main_~i~5 25), 18069#(<= ULTIMATE.start_main_~i~5 26), 18070#(<= ULTIMATE.start_main_~i~5 27), 18071#(<= ULTIMATE.start_main_~i~5 28), 18072#(<= ULTIMATE.start_main_~i~5 29), 18073#(<= ULTIMATE.start_main_~i~5 30), 18074#(<= ULTIMATE.start_main_~i~5 31), 18075#(<= ULTIMATE.start_main_~i~5 32), 18076#(<= ULTIMATE.start_main_~i~5 33), 18077#(<= ULTIMATE.start_main_~i~5 34), 18078#(<= ULTIMATE.start_main_~i~5 35), 18079#(<= ULTIMATE.start_main_~i~5 36), 18080#(<= ULTIMATE.start_main_~i~5 37), 18081#(<= ULTIMATE.start_main_~i~5 38), 18082#(<= ULTIMATE.start_main_~i~5 39), 18083#(<= ULTIMATE.start_main_~i~5 40), 18084#(<= ULTIMATE.start_main_~i~5 41), 18085#(<= ULTIMATE.start_main_~i~5 42), 18086#(<= ULTIMATE.start_main_~i~5 43), 18087#(<= ULTIMATE.start_main_~i~5 44), 18088#(<= ULTIMATE.start_main_~i~5 45), 18089#(<= ULTIMATE.start_main_~i~5 46), 18090#(<= ULTIMATE.start_main_~i~5 47), 18091#(<= ULTIMATE.start_main_~i~5 48), 18092#(<= ULTIMATE.start_main_~i~5 49), 18093#(<= ULTIMATE.start_main_~i~5 50), 18094#(<= ULTIMATE.start_main_~i~5 51), 18095#(<= ULTIMATE.start_main_~i~5 52), 18096#(<= ULTIMATE.start_main_~i~5 53), 18097#(<= ULTIMATE.start_main_~i~5 54), 18098#(<= ULTIMATE.start_main_~i~5 55), 18099#(<= ULTIMATE.start_main_~i~5 56), 18100#(<= ULTIMATE.start_main_~i~5 57), 18101#(<= ULTIMATE.start_main_~i~5 58), 18102#(<= ULTIMATE.start_main_~i~5 59), 18103#(<= ULTIMATE.start_main_~i~5 60), 18041#true, 18042#false, 18043#(<= ULTIMATE.start_main_~i~5 0), 18044#(<= ULTIMATE.start_main_~i~5 1), 18045#(<= ULTIMATE.start_main_~i~5 2), 18046#(<= ULTIMATE.start_main_~i~5 3), 18047#(<= ULTIMATE.start_main_~i~5 4)] [2018-07-23 13:50:16,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:16,639 INFO L450 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-23 13:50:16,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-23 13:50:16,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 13:50:16,641 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 63 states. [2018-07-23 13:50:16,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:16,723 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-07-23 13:50:16,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-23 13:50:16,723 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-07-23 13:50:16,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:16,724 INFO L225 Difference]: With dead ends: 129 [2018-07-23 13:50:16,725 INFO L226 Difference]: Without dead ends: 127 [2018-07-23 13:50:16,726 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 13:50:16,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-23 13:50:16,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-07-23 13:50:16,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-23 13:50:16,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-07-23 13:50:16,731 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2018-07-23 13:50:16,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:16,732 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-07-23 13:50:16,732 INFO L472 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-23 13:50:16,732 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-07-23 13:50:16,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-23 13:50:16,733 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:16,733 INFO L357 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2018-07-23 13:50:16,733 INFO L414 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:16,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1789395439, now seen corresponding path program 61 times [2018-07-23 13:50:16,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:17,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:17,034 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:17,034 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-23 13:50:17,034 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:17,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:17,035 INFO L185 omatonBuilderFactory]: Interpolants [18616#true, 18617#false, 18618#(<= ULTIMATE.start_main_~i~5 0), 18619#(<= ULTIMATE.start_main_~i~5 1), 18620#(<= ULTIMATE.start_main_~i~5 2), 18621#(<= ULTIMATE.start_main_~i~5 3), 18622#(<= ULTIMATE.start_main_~i~5 4), 18623#(<= ULTIMATE.start_main_~i~5 5), 18624#(<= ULTIMATE.start_main_~i~5 6), 18625#(<= ULTIMATE.start_main_~i~5 7), 18626#(<= ULTIMATE.start_main_~i~5 8), 18627#(<= ULTIMATE.start_main_~i~5 9), 18628#(<= ULTIMATE.start_main_~i~5 10), 18629#(<= ULTIMATE.start_main_~i~5 11), 18630#(<= ULTIMATE.start_main_~i~5 12), 18631#(<= ULTIMATE.start_main_~i~5 13), 18632#(<= ULTIMATE.start_main_~i~5 14), 18633#(<= ULTIMATE.start_main_~i~5 15), 18634#(<= ULTIMATE.start_main_~i~5 16), 18635#(<= ULTIMATE.start_main_~i~5 17), 18636#(<= ULTIMATE.start_main_~i~5 18), 18637#(<= ULTIMATE.start_main_~i~5 19), 18638#(<= ULTIMATE.start_main_~i~5 20), 18639#(<= ULTIMATE.start_main_~i~5 21), 18640#(<= ULTIMATE.start_main_~i~5 22), 18641#(<= ULTIMATE.start_main_~i~5 23), 18642#(<= ULTIMATE.start_main_~i~5 24), 18643#(<= ULTIMATE.start_main_~i~5 25), 18644#(<= ULTIMATE.start_main_~i~5 26), 18645#(<= ULTIMATE.start_main_~i~5 27), 18646#(<= ULTIMATE.start_main_~i~5 28), 18647#(<= ULTIMATE.start_main_~i~5 29), 18648#(<= ULTIMATE.start_main_~i~5 30), 18649#(<= ULTIMATE.start_main_~i~5 31), 18650#(<= ULTIMATE.start_main_~i~5 32), 18651#(<= ULTIMATE.start_main_~i~5 33), 18652#(<= ULTIMATE.start_main_~i~5 34), 18653#(<= ULTIMATE.start_main_~i~5 35), 18654#(<= ULTIMATE.start_main_~i~5 36), 18655#(<= ULTIMATE.start_main_~i~5 37), 18656#(<= ULTIMATE.start_main_~i~5 38), 18657#(<= ULTIMATE.start_main_~i~5 39), 18658#(<= ULTIMATE.start_main_~i~5 40), 18659#(<= ULTIMATE.start_main_~i~5 41), 18660#(<= ULTIMATE.start_main_~i~5 42), 18661#(<= ULTIMATE.start_main_~i~5 43), 18662#(<= ULTIMATE.start_main_~i~5 44), 18663#(<= ULTIMATE.start_main_~i~5 45), 18664#(<= ULTIMATE.start_main_~i~5 46), 18665#(<= ULTIMATE.start_main_~i~5 47), 18666#(<= ULTIMATE.start_main_~i~5 48), 18667#(<= ULTIMATE.start_main_~i~5 49), 18668#(<= ULTIMATE.start_main_~i~5 50), 18669#(<= ULTIMATE.start_main_~i~5 51), 18670#(<= ULTIMATE.start_main_~i~5 52), 18671#(<= ULTIMATE.start_main_~i~5 53), 18672#(<= ULTIMATE.start_main_~i~5 54), 18673#(<= ULTIMATE.start_main_~i~5 55), 18674#(<= ULTIMATE.start_main_~i~5 56), 18675#(<= ULTIMATE.start_main_~i~5 57), 18676#(<= ULTIMATE.start_main_~i~5 58), 18677#(<= ULTIMATE.start_main_~i~5 59), 18678#(<= ULTIMATE.start_main_~i~5 60), 18679#(<= ULTIMATE.start_main_~i~5 61)] [2018-07-23 13:50:17,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:17,036 INFO L450 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-23 13:50:17,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-23 13:50:17,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 13:50:17,037 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 64 states. [2018-07-23 13:50:17,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:17,120 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-07-23 13:50:17,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-23 13:50:17,120 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-07-23 13:50:17,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:17,122 INFO L225 Difference]: With dead ends: 131 [2018-07-23 13:50:17,122 INFO L226 Difference]: Without dead ends: 129 [2018-07-23 13:50:17,123 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 13:50:17,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-23 13:50:17,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-07-23 13:50:17,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-23 13:50:17,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-07-23 13:50:17,128 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2018-07-23 13:50:17,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:17,128 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-07-23 13:50:17,129 INFO L472 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-23 13:50:17,129 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-07-23 13:50:17,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-23 13:50:17,130 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:17,130 INFO L357 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2018-07-23 13:50:17,130 INFO L414 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:17,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1622165491, now seen corresponding path program 62 times [2018-07-23 13:50:17,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:17,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:17,435 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:17,435 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-23 13:50:17,435 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:17,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:17,436 INFO L185 omatonBuilderFactory]: Interpolants [19200#true, 19201#false, 19202#(<= ULTIMATE.start_main_~i~5 0), 19203#(<= ULTIMATE.start_main_~i~5 1), 19204#(<= ULTIMATE.start_main_~i~5 2), 19205#(<= ULTIMATE.start_main_~i~5 3), 19206#(<= ULTIMATE.start_main_~i~5 4), 19207#(<= ULTIMATE.start_main_~i~5 5), 19208#(<= ULTIMATE.start_main_~i~5 6), 19209#(<= ULTIMATE.start_main_~i~5 7), 19210#(<= ULTIMATE.start_main_~i~5 8), 19211#(<= ULTIMATE.start_main_~i~5 9), 19212#(<= ULTIMATE.start_main_~i~5 10), 19213#(<= ULTIMATE.start_main_~i~5 11), 19214#(<= ULTIMATE.start_main_~i~5 12), 19215#(<= ULTIMATE.start_main_~i~5 13), 19216#(<= ULTIMATE.start_main_~i~5 14), 19217#(<= ULTIMATE.start_main_~i~5 15), 19218#(<= ULTIMATE.start_main_~i~5 16), 19219#(<= ULTIMATE.start_main_~i~5 17), 19220#(<= ULTIMATE.start_main_~i~5 18), 19221#(<= ULTIMATE.start_main_~i~5 19), 19222#(<= ULTIMATE.start_main_~i~5 20), 19223#(<= ULTIMATE.start_main_~i~5 21), 19224#(<= ULTIMATE.start_main_~i~5 22), 19225#(<= ULTIMATE.start_main_~i~5 23), 19226#(<= ULTIMATE.start_main_~i~5 24), 19227#(<= ULTIMATE.start_main_~i~5 25), 19228#(<= ULTIMATE.start_main_~i~5 26), 19229#(<= ULTIMATE.start_main_~i~5 27), 19230#(<= ULTIMATE.start_main_~i~5 28), 19231#(<= ULTIMATE.start_main_~i~5 29), 19232#(<= ULTIMATE.start_main_~i~5 30), 19233#(<= ULTIMATE.start_main_~i~5 31), 19234#(<= ULTIMATE.start_main_~i~5 32), 19235#(<= ULTIMATE.start_main_~i~5 33), 19236#(<= ULTIMATE.start_main_~i~5 34), 19237#(<= ULTIMATE.start_main_~i~5 35), 19238#(<= ULTIMATE.start_main_~i~5 36), 19239#(<= ULTIMATE.start_main_~i~5 37), 19240#(<= ULTIMATE.start_main_~i~5 38), 19241#(<= ULTIMATE.start_main_~i~5 39), 19242#(<= ULTIMATE.start_main_~i~5 40), 19243#(<= ULTIMATE.start_main_~i~5 41), 19244#(<= ULTIMATE.start_main_~i~5 42), 19245#(<= ULTIMATE.start_main_~i~5 43), 19246#(<= ULTIMATE.start_main_~i~5 44), 19247#(<= ULTIMATE.start_main_~i~5 45), 19248#(<= ULTIMATE.start_main_~i~5 46), 19249#(<= ULTIMATE.start_main_~i~5 47), 19250#(<= ULTIMATE.start_main_~i~5 48), 19251#(<= ULTIMATE.start_main_~i~5 49), 19252#(<= ULTIMATE.start_main_~i~5 50), 19253#(<= ULTIMATE.start_main_~i~5 51), 19254#(<= ULTIMATE.start_main_~i~5 52), 19255#(<= ULTIMATE.start_main_~i~5 53), 19256#(<= ULTIMATE.start_main_~i~5 54), 19257#(<= ULTIMATE.start_main_~i~5 55), 19258#(<= ULTIMATE.start_main_~i~5 56), 19259#(<= ULTIMATE.start_main_~i~5 57), 19260#(<= ULTIMATE.start_main_~i~5 58), 19261#(<= ULTIMATE.start_main_~i~5 59), 19262#(<= ULTIMATE.start_main_~i~5 60), 19263#(<= ULTIMATE.start_main_~i~5 61), 19264#(<= ULTIMATE.start_main_~i~5 62)] [2018-07-23 13:50:17,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:17,437 INFO L450 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-23 13:50:17,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-23 13:50:17,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 13:50:17,441 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 65 states. [2018-07-23 13:50:17,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:17,534 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-07-23 13:50:17,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-23 13:50:17,534 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-07-23 13:50:17,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:17,536 INFO L225 Difference]: With dead ends: 133 [2018-07-23 13:50:17,536 INFO L226 Difference]: Without dead ends: 131 [2018-07-23 13:50:17,537 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 13:50:17,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-23 13:50:17,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-07-23 13:50:17,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-23 13:50:17,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-07-23 13:50:17,542 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2018-07-23 13:50:17,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:17,542 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-07-23 13:50:17,543 INFO L472 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-23 13:50:17,543 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-07-23 13:50:17,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-23 13:50:17,544 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:17,544 INFO L357 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1] [2018-07-23 13:50:17,544 INFO L414 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:17,545 INFO L82 PathProgramCache]: Analyzing trace with hash 172024585, now seen corresponding path program 63 times [2018-07-23 13:50:17,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:17,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:17,819 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:17,819 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-23 13:50:17,819 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:17,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:17,820 INFO L185 omatonBuilderFactory]: Interpolants [19840#(<= ULTIMATE.start_main_~i~5 45), 19841#(<= ULTIMATE.start_main_~i~5 46), 19842#(<= ULTIMATE.start_main_~i~5 47), 19843#(<= ULTIMATE.start_main_~i~5 48), 19844#(<= ULTIMATE.start_main_~i~5 49), 19845#(<= ULTIMATE.start_main_~i~5 50), 19846#(<= ULTIMATE.start_main_~i~5 51), 19847#(<= ULTIMATE.start_main_~i~5 52), 19848#(<= ULTIMATE.start_main_~i~5 53), 19849#(<= ULTIMATE.start_main_~i~5 54), 19850#(<= ULTIMATE.start_main_~i~5 55), 19851#(<= ULTIMATE.start_main_~i~5 56), 19852#(<= ULTIMATE.start_main_~i~5 57), 19853#(<= ULTIMATE.start_main_~i~5 58), 19854#(<= ULTIMATE.start_main_~i~5 59), 19855#(<= ULTIMATE.start_main_~i~5 60), 19856#(<= ULTIMATE.start_main_~i~5 61), 19857#(<= ULTIMATE.start_main_~i~5 62), 19858#(<= ULTIMATE.start_main_~i~5 63), 19793#true, 19794#false, 19795#(<= ULTIMATE.start_main_~i~5 0), 19796#(<= ULTIMATE.start_main_~i~5 1), 19797#(<= ULTIMATE.start_main_~i~5 2), 19798#(<= ULTIMATE.start_main_~i~5 3), 19799#(<= ULTIMATE.start_main_~i~5 4), 19800#(<= ULTIMATE.start_main_~i~5 5), 19801#(<= ULTIMATE.start_main_~i~5 6), 19802#(<= ULTIMATE.start_main_~i~5 7), 19803#(<= ULTIMATE.start_main_~i~5 8), 19804#(<= ULTIMATE.start_main_~i~5 9), 19805#(<= ULTIMATE.start_main_~i~5 10), 19806#(<= ULTIMATE.start_main_~i~5 11), 19807#(<= ULTIMATE.start_main_~i~5 12), 19808#(<= ULTIMATE.start_main_~i~5 13), 19809#(<= ULTIMATE.start_main_~i~5 14), 19810#(<= ULTIMATE.start_main_~i~5 15), 19811#(<= ULTIMATE.start_main_~i~5 16), 19812#(<= ULTIMATE.start_main_~i~5 17), 19813#(<= ULTIMATE.start_main_~i~5 18), 19814#(<= ULTIMATE.start_main_~i~5 19), 19815#(<= ULTIMATE.start_main_~i~5 20), 19816#(<= ULTIMATE.start_main_~i~5 21), 19817#(<= ULTIMATE.start_main_~i~5 22), 19818#(<= ULTIMATE.start_main_~i~5 23), 19819#(<= ULTIMATE.start_main_~i~5 24), 19820#(<= ULTIMATE.start_main_~i~5 25), 19821#(<= ULTIMATE.start_main_~i~5 26), 19822#(<= ULTIMATE.start_main_~i~5 27), 19823#(<= ULTIMATE.start_main_~i~5 28), 19824#(<= ULTIMATE.start_main_~i~5 29), 19825#(<= ULTIMATE.start_main_~i~5 30), 19826#(<= ULTIMATE.start_main_~i~5 31), 19827#(<= ULTIMATE.start_main_~i~5 32), 19828#(<= ULTIMATE.start_main_~i~5 33), 19829#(<= ULTIMATE.start_main_~i~5 34), 19830#(<= ULTIMATE.start_main_~i~5 35), 19831#(<= ULTIMATE.start_main_~i~5 36), 19832#(<= ULTIMATE.start_main_~i~5 37), 19833#(<= ULTIMATE.start_main_~i~5 38), 19834#(<= ULTIMATE.start_main_~i~5 39), 19835#(<= ULTIMATE.start_main_~i~5 40), 19836#(<= ULTIMATE.start_main_~i~5 41), 19837#(<= ULTIMATE.start_main_~i~5 42), 19838#(<= ULTIMATE.start_main_~i~5 43), 19839#(<= ULTIMATE.start_main_~i~5 44)] [2018-07-23 13:50:17,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:17,821 INFO L450 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-23 13:50:17,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-23 13:50:17,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 13:50:17,822 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 66 states. [2018-07-23 13:50:17,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:17,870 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-07-23 13:50:17,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-23 13:50:17,870 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-07-23 13:50:17,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:17,871 INFO L225 Difference]: With dead ends: 135 [2018-07-23 13:50:17,872 INFO L226 Difference]: Without dead ends: 133 [2018-07-23 13:50:17,872 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 13:50:17,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-23 13:50:17,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-07-23 13:50:17,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-23 13:50:17,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-07-23 13:50:17,878 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2018-07-23 13:50:17,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:17,878 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-07-23 13:50:17,878 INFO L472 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-23 13:50:17,878 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-07-23 13:50:17,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-23 13:50:17,880 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:17,880 INFO L357 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1] [2018-07-23 13:50:17,880 INFO L414 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:17,880 INFO L82 PathProgramCache]: Analyzing trace with hash 2106801925, now seen corresponding path program 64 times [2018-07-23 13:50:17,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:18,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:18,170 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:18,170 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-23 13:50:18,170 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:18,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:18,171 INFO L185 omatonBuilderFactory]: Interpolants [20395#true, 20396#false, 20397#(<= ULTIMATE.start_main_~i~5 0), 20398#(<= ULTIMATE.start_main_~i~5 1), 20399#(<= ULTIMATE.start_main_~i~5 2), 20400#(<= ULTIMATE.start_main_~i~5 3), 20401#(<= ULTIMATE.start_main_~i~5 4), 20402#(<= ULTIMATE.start_main_~i~5 5), 20403#(<= ULTIMATE.start_main_~i~5 6), 20404#(<= ULTIMATE.start_main_~i~5 7), 20405#(<= ULTIMATE.start_main_~i~5 8), 20406#(<= ULTIMATE.start_main_~i~5 9), 20407#(<= ULTIMATE.start_main_~i~5 10), 20408#(<= ULTIMATE.start_main_~i~5 11), 20409#(<= ULTIMATE.start_main_~i~5 12), 20410#(<= ULTIMATE.start_main_~i~5 13), 20411#(<= ULTIMATE.start_main_~i~5 14), 20412#(<= ULTIMATE.start_main_~i~5 15), 20413#(<= ULTIMATE.start_main_~i~5 16), 20414#(<= ULTIMATE.start_main_~i~5 17), 20415#(<= ULTIMATE.start_main_~i~5 18), 20416#(<= ULTIMATE.start_main_~i~5 19), 20417#(<= ULTIMATE.start_main_~i~5 20), 20418#(<= ULTIMATE.start_main_~i~5 21), 20419#(<= ULTIMATE.start_main_~i~5 22), 20420#(<= ULTIMATE.start_main_~i~5 23), 20421#(<= ULTIMATE.start_main_~i~5 24), 20422#(<= ULTIMATE.start_main_~i~5 25), 20423#(<= ULTIMATE.start_main_~i~5 26), 20424#(<= ULTIMATE.start_main_~i~5 27), 20425#(<= ULTIMATE.start_main_~i~5 28), 20426#(<= ULTIMATE.start_main_~i~5 29), 20427#(<= ULTIMATE.start_main_~i~5 30), 20428#(<= ULTIMATE.start_main_~i~5 31), 20429#(<= ULTIMATE.start_main_~i~5 32), 20430#(<= ULTIMATE.start_main_~i~5 33), 20431#(<= ULTIMATE.start_main_~i~5 34), 20432#(<= ULTIMATE.start_main_~i~5 35), 20433#(<= ULTIMATE.start_main_~i~5 36), 20434#(<= ULTIMATE.start_main_~i~5 37), 20435#(<= ULTIMATE.start_main_~i~5 38), 20436#(<= ULTIMATE.start_main_~i~5 39), 20437#(<= ULTIMATE.start_main_~i~5 40), 20438#(<= ULTIMATE.start_main_~i~5 41), 20439#(<= ULTIMATE.start_main_~i~5 42), 20440#(<= ULTIMATE.start_main_~i~5 43), 20441#(<= ULTIMATE.start_main_~i~5 44), 20442#(<= ULTIMATE.start_main_~i~5 45), 20443#(<= ULTIMATE.start_main_~i~5 46), 20444#(<= ULTIMATE.start_main_~i~5 47), 20445#(<= ULTIMATE.start_main_~i~5 48), 20446#(<= ULTIMATE.start_main_~i~5 49), 20447#(<= ULTIMATE.start_main_~i~5 50), 20448#(<= ULTIMATE.start_main_~i~5 51), 20449#(<= ULTIMATE.start_main_~i~5 52), 20450#(<= ULTIMATE.start_main_~i~5 53), 20451#(<= ULTIMATE.start_main_~i~5 54), 20452#(<= ULTIMATE.start_main_~i~5 55), 20453#(<= ULTIMATE.start_main_~i~5 56), 20454#(<= ULTIMATE.start_main_~i~5 57), 20455#(<= ULTIMATE.start_main_~i~5 58), 20456#(<= ULTIMATE.start_main_~i~5 59), 20457#(<= ULTIMATE.start_main_~i~5 60), 20458#(<= ULTIMATE.start_main_~i~5 61), 20459#(<= ULTIMATE.start_main_~i~5 62), 20460#(<= ULTIMATE.start_main_~i~5 63), 20461#(<= ULTIMATE.start_main_~i~5 64)] [2018-07-23 13:50:18,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:18,172 INFO L450 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-23 13:50:18,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-23 13:50:18,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 13:50:18,174 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 67 states. [2018-07-23 13:50:18,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:18,265 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-07-23 13:50:18,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-23 13:50:18,266 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-07-23 13:50:18,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:18,267 INFO L225 Difference]: With dead ends: 137 [2018-07-23 13:50:18,267 INFO L226 Difference]: Without dead ends: 135 [2018-07-23 13:50:18,268 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 13:50:18,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-23 13:50:18,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-07-23 13:50:18,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-07-23 13:50:18,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-07-23 13:50:18,278 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2018-07-23 13:50:18,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:18,278 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-07-23 13:50:18,278 INFO L472 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-23 13:50:18,278 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-07-23 13:50:18,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-23 13:50:18,280 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:18,280 INFO L357 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1] [2018-07-23 13:50:18,280 INFO L414 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:18,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1706986497, now seen corresponding path program 65 times [2018-07-23 13:50:18,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:18,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:18,639 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:18,639 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-23 13:50:18,640 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:18,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:18,640 INFO L185 omatonBuilderFactory]: Interpolants [21006#true, 21007#false, 21008#(<= ULTIMATE.start_main_~i~5 0), 21009#(<= ULTIMATE.start_main_~i~5 1), 21010#(<= ULTIMATE.start_main_~i~5 2), 21011#(<= ULTIMATE.start_main_~i~5 3), 21012#(<= ULTIMATE.start_main_~i~5 4), 21013#(<= ULTIMATE.start_main_~i~5 5), 21014#(<= ULTIMATE.start_main_~i~5 6), 21015#(<= ULTIMATE.start_main_~i~5 7), 21016#(<= ULTIMATE.start_main_~i~5 8), 21017#(<= ULTIMATE.start_main_~i~5 9), 21018#(<= ULTIMATE.start_main_~i~5 10), 21019#(<= ULTIMATE.start_main_~i~5 11), 21020#(<= ULTIMATE.start_main_~i~5 12), 21021#(<= ULTIMATE.start_main_~i~5 13), 21022#(<= ULTIMATE.start_main_~i~5 14), 21023#(<= ULTIMATE.start_main_~i~5 15), 21024#(<= ULTIMATE.start_main_~i~5 16), 21025#(<= ULTIMATE.start_main_~i~5 17), 21026#(<= ULTIMATE.start_main_~i~5 18), 21027#(<= ULTIMATE.start_main_~i~5 19), 21028#(<= ULTIMATE.start_main_~i~5 20), 21029#(<= ULTIMATE.start_main_~i~5 21), 21030#(<= ULTIMATE.start_main_~i~5 22), 21031#(<= ULTIMATE.start_main_~i~5 23), 21032#(<= ULTIMATE.start_main_~i~5 24), 21033#(<= ULTIMATE.start_main_~i~5 25), 21034#(<= ULTIMATE.start_main_~i~5 26), 21035#(<= ULTIMATE.start_main_~i~5 27), 21036#(<= ULTIMATE.start_main_~i~5 28), 21037#(<= ULTIMATE.start_main_~i~5 29), 21038#(<= ULTIMATE.start_main_~i~5 30), 21039#(<= ULTIMATE.start_main_~i~5 31), 21040#(<= ULTIMATE.start_main_~i~5 32), 21041#(<= ULTIMATE.start_main_~i~5 33), 21042#(<= ULTIMATE.start_main_~i~5 34), 21043#(<= ULTIMATE.start_main_~i~5 35), 21044#(<= ULTIMATE.start_main_~i~5 36), 21045#(<= ULTIMATE.start_main_~i~5 37), 21046#(<= ULTIMATE.start_main_~i~5 38), 21047#(<= ULTIMATE.start_main_~i~5 39), 21048#(<= ULTIMATE.start_main_~i~5 40), 21049#(<= ULTIMATE.start_main_~i~5 41), 21050#(<= ULTIMATE.start_main_~i~5 42), 21051#(<= ULTIMATE.start_main_~i~5 43), 21052#(<= ULTIMATE.start_main_~i~5 44), 21053#(<= ULTIMATE.start_main_~i~5 45), 21054#(<= ULTIMATE.start_main_~i~5 46), 21055#(<= ULTIMATE.start_main_~i~5 47), 21056#(<= ULTIMATE.start_main_~i~5 48), 21057#(<= ULTIMATE.start_main_~i~5 49), 21058#(<= ULTIMATE.start_main_~i~5 50), 21059#(<= ULTIMATE.start_main_~i~5 51), 21060#(<= ULTIMATE.start_main_~i~5 52), 21061#(<= ULTIMATE.start_main_~i~5 53), 21062#(<= ULTIMATE.start_main_~i~5 54), 21063#(<= ULTIMATE.start_main_~i~5 55), 21064#(<= ULTIMATE.start_main_~i~5 56), 21065#(<= ULTIMATE.start_main_~i~5 57), 21066#(<= ULTIMATE.start_main_~i~5 58), 21067#(<= ULTIMATE.start_main_~i~5 59), 21068#(<= ULTIMATE.start_main_~i~5 60), 21069#(<= ULTIMATE.start_main_~i~5 61), 21070#(<= ULTIMATE.start_main_~i~5 62), 21071#(<= ULTIMATE.start_main_~i~5 63), 21072#(<= ULTIMATE.start_main_~i~5 64), 21073#(<= ULTIMATE.start_main_~i~5 65)] [2018-07-23 13:50:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:18,641 INFO L450 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-23 13:50:18,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-23 13:50:18,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 13:50:18,643 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 68 states. [2018-07-23 13:50:18,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:18,742 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-07-23 13:50:18,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-23 13:50:18,742 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-07-23 13:50:18,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:18,744 INFO L225 Difference]: With dead ends: 139 [2018-07-23 13:50:18,744 INFO L226 Difference]: Without dead ends: 137 [2018-07-23 13:50:18,745 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 13:50:18,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-23 13:50:18,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-07-23 13:50:18,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-23 13:50:18,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-07-23 13:50:18,751 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2018-07-23 13:50:18,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:18,751 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-07-23 13:50:18,751 INFO L472 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-23 13:50:18,751 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-07-23 13:50:18,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-23 13:50:18,753 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:18,753 INFO L357 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1] [2018-07-23 13:50:18,753 INFO L414 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:18,753 INFO L82 PathProgramCache]: Analyzing trace with hash -263550467, now seen corresponding path program 66 times [2018-07-23 13:50:18,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:19,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:19,044 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:19,045 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-23 13:50:19,045 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:19,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:19,045 INFO L185 omatonBuilderFactory]: Interpolants [21632#(<= ULTIMATE.start_main_~i~5 4), 21633#(<= ULTIMATE.start_main_~i~5 5), 21634#(<= ULTIMATE.start_main_~i~5 6), 21635#(<= ULTIMATE.start_main_~i~5 7), 21636#(<= ULTIMATE.start_main_~i~5 8), 21637#(<= ULTIMATE.start_main_~i~5 9), 21638#(<= ULTIMATE.start_main_~i~5 10), 21639#(<= ULTIMATE.start_main_~i~5 11), 21640#(<= ULTIMATE.start_main_~i~5 12), 21641#(<= ULTIMATE.start_main_~i~5 13), 21642#(<= ULTIMATE.start_main_~i~5 14), 21643#(<= ULTIMATE.start_main_~i~5 15), 21644#(<= ULTIMATE.start_main_~i~5 16), 21645#(<= ULTIMATE.start_main_~i~5 17), 21646#(<= ULTIMATE.start_main_~i~5 18), 21647#(<= ULTIMATE.start_main_~i~5 19), 21648#(<= ULTIMATE.start_main_~i~5 20), 21649#(<= ULTIMATE.start_main_~i~5 21), 21650#(<= ULTIMATE.start_main_~i~5 22), 21651#(<= ULTIMATE.start_main_~i~5 23), 21652#(<= ULTIMATE.start_main_~i~5 24), 21653#(<= ULTIMATE.start_main_~i~5 25), 21654#(<= ULTIMATE.start_main_~i~5 26), 21655#(<= ULTIMATE.start_main_~i~5 27), 21656#(<= ULTIMATE.start_main_~i~5 28), 21657#(<= ULTIMATE.start_main_~i~5 29), 21658#(<= ULTIMATE.start_main_~i~5 30), 21659#(<= ULTIMATE.start_main_~i~5 31), 21660#(<= ULTIMATE.start_main_~i~5 32), 21661#(<= ULTIMATE.start_main_~i~5 33), 21662#(<= ULTIMATE.start_main_~i~5 34), 21663#(<= ULTIMATE.start_main_~i~5 35), 21664#(<= ULTIMATE.start_main_~i~5 36), 21665#(<= ULTIMATE.start_main_~i~5 37), 21666#(<= ULTIMATE.start_main_~i~5 38), 21667#(<= ULTIMATE.start_main_~i~5 39), 21668#(<= ULTIMATE.start_main_~i~5 40), 21669#(<= ULTIMATE.start_main_~i~5 41), 21670#(<= ULTIMATE.start_main_~i~5 42), 21671#(<= ULTIMATE.start_main_~i~5 43), 21672#(<= ULTIMATE.start_main_~i~5 44), 21673#(<= ULTIMATE.start_main_~i~5 45), 21674#(<= ULTIMATE.start_main_~i~5 46), 21675#(<= ULTIMATE.start_main_~i~5 47), 21676#(<= ULTIMATE.start_main_~i~5 48), 21677#(<= ULTIMATE.start_main_~i~5 49), 21678#(<= ULTIMATE.start_main_~i~5 50), 21679#(<= ULTIMATE.start_main_~i~5 51), 21680#(<= ULTIMATE.start_main_~i~5 52), 21681#(<= ULTIMATE.start_main_~i~5 53), 21682#(<= ULTIMATE.start_main_~i~5 54), 21683#(<= ULTIMATE.start_main_~i~5 55), 21684#(<= ULTIMATE.start_main_~i~5 56), 21685#(<= ULTIMATE.start_main_~i~5 57), 21686#(<= ULTIMATE.start_main_~i~5 58), 21687#(<= ULTIMATE.start_main_~i~5 59), 21688#(<= ULTIMATE.start_main_~i~5 60), 21689#(<= ULTIMATE.start_main_~i~5 61), 21690#(<= ULTIMATE.start_main_~i~5 62), 21691#(<= ULTIMATE.start_main_~i~5 63), 21692#(<= ULTIMATE.start_main_~i~5 64), 21693#(<= ULTIMATE.start_main_~i~5 65), 21694#(<= ULTIMATE.start_main_~i~5 66), 21626#true, 21627#false, 21628#(<= ULTIMATE.start_main_~i~5 0), 21629#(<= ULTIMATE.start_main_~i~5 1), 21630#(<= ULTIMATE.start_main_~i~5 2), 21631#(<= ULTIMATE.start_main_~i~5 3)] [2018-07-23 13:50:19,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:19,047 INFO L450 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-23 13:50:19,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-23 13:50:19,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 13:50:19,048 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 69 states. [2018-07-23 13:50:19,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:19,157 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-07-23 13:50:19,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-23 13:50:19,157 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-07-23 13:50:19,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:19,159 INFO L225 Difference]: With dead ends: 141 [2018-07-23 13:50:19,159 INFO L226 Difference]: Without dead ends: 139 [2018-07-23 13:50:19,160 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 13:50:19,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-23 13:50:19,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-07-23 13:50:19,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-07-23 13:50:19,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-07-23 13:50:19,167 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2018-07-23 13:50:19,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:19,168 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-07-23 13:50:19,168 INFO L472 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-23 13:50:19,168 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-07-23 13:50:19,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-23 13:50:19,170 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:19,170 INFO L357 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1] [2018-07-23 13:50:19,170 INFO L414 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:19,170 INFO L82 PathProgramCache]: Analyzing trace with hash 131004665, now seen corresponding path program 67 times [2018-07-23 13:50:19,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:19,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:19,483 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:19,483 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-23 13:50:19,483 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:19,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:19,484 INFO L185 omatonBuilderFactory]: Interpolants [22272#(<= ULTIMATE.start_main_~i~5 15), 22273#(<= ULTIMATE.start_main_~i~5 16), 22274#(<= ULTIMATE.start_main_~i~5 17), 22275#(<= ULTIMATE.start_main_~i~5 18), 22276#(<= ULTIMATE.start_main_~i~5 19), 22277#(<= ULTIMATE.start_main_~i~5 20), 22278#(<= ULTIMATE.start_main_~i~5 21), 22279#(<= ULTIMATE.start_main_~i~5 22), 22280#(<= ULTIMATE.start_main_~i~5 23), 22281#(<= ULTIMATE.start_main_~i~5 24), 22282#(<= ULTIMATE.start_main_~i~5 25), 22283#(<= ULTIMATE.start_main_~i~5 26), 22284#(<= ULTIMATE.start_main_~i~5 27), 22285#(<= ULTIMATE.start_main_~i~5 28), 22286#(<= ULTIMATE.start_main_~i~5 29), 22287#(<= ULTIMATE.start_main_~i~5 30), 22288#(<= ULTIMATE.start_main_~i~5 31), 22289#(<= ULTIMATE.start_main_~i~5 32), 22290#(<= ULTIMATE.start_main_~i~5 33), 22291#(<= ULTIMATE.start_main_~i~5 34), 22292#(<= ULTIMATE.start_main_~i~5 35), 22293#(<= ULTIMATE.start_main_~i~5 36), 22294#(<= ULTIMATE.start_main_~i~5 37), 22295#(<= ULTIMATE.start_main_~i~5 38), 22296#(<= ULTIMATE.start_main_~i~5 39), 22297#(<= ULTIMATE.start_main_~i~5 40), 22298#(<= ULTIMATE.start_main_~i~5 41), 22299#(<= ULTIMATE.start_main_~i~5 42), 22300#(<= ULTIMATE.start_main_~i~5 43), 22301#(<= ULTIMATE.start_main_~i~5 44), 22302#(<= ULTIMATE.start_main_~i~5 45), 22303#(<= ULTIMATE.start_main_~i~5 46), 22304#(<= ULTIMATE.start_main_~i~5 47), 22305#(<= ULTIMATE.start_main_~i~5 48), 22306#(<= ULTIMATE.start_main_~i~5 49), 22307#(<= ULTIMATE.start_main_~i~5 50), 22308#(<= ULTIMATE.start_main_~i~5 51), 22309#(<= ULTIMATE.start_main_~i~5 52), 22310#(<= ULTIMATE.start_main_~i~5 53), 22311#(<= ULTIMATE.start_main_~i~5 54), 22312#(<= ULTIMATE.start_main_~i~5 55), 22313#(<= ULTIMATE.start_main_~i~5 56), 22314#(<= ULTIMATE.start_main_~i~5 57), 22315#(<= ULTIMATE.start_main_~i~5 58), 22316#(<= ULTIMATE.start_main_~i~5 59), 22317#(<= ULTIMATE.start_main_~i~5 60), 22318#(<= ULTIMATE.start_main_~i~5 61), 22319#(<= ULTIMATE.start_main_~i~5 62), 22320#(<= ULTIMATE.start_main_~i~5 63), 22321#(<= ULTIMATE.start_main_~i~5 64), 22322#(<= ULTIMATE.start_main_~i~5 65), 22323#(<= ULTIMATE.start_main_~i~5 66), 22324#(<= ULTIMATE.start_main_~i~5 67), 22255#true, 22256#false, 22257#(<= ULTIMATE.start_main_~i~5 0), 22258#(<= ULTIMATE.start_main_~i~5 1), 22259#(<= ULTIMATE.start_main_~i~5 2), 22260#(<= ULTIMATE.start_main_~i~5 3), 22261#(<= ULTIMATE.start_main_~i~5 4), 22262#(<= ULTIMATE.start_main_~i~5 5), 22263#(<= ULTIMATE.start_main_~i~5 6), 22264#(<= ULTIMATE.start_main_~i~5 7), 22265#(<= ULTIMATE.start_main_~i~5 8), 22266#(<= ULTIMATE.start_main_~i~5 9), 22267#(<= ULTIMATE.start_main_~i~5 10), 22268#(<= ULTIMATE.start_main_~i~5 11), 22269#(<= ULTIMATE.start_main_~i~5 12), 22270#(<= ULTIMATE.start_main_~i~5 13), 22271#(<= ULTIMATE.start_main_~i~5 14)] [2018-07-23 13:50:19,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:19,485 INFO L450 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-23 13:50:19,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-23 13:50:19,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 13:50:19,487 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 70 states. [2018-07-23 13:50:19,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:19,579 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-07-23 13:50:19,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-23 13:50:19,580 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-07-23 13:50:19,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:19,581 INFO L225 Difference]: With dead ends: 143 [2018-07-23 13:50:19,581 INFO L226 Difference]: Without dead ends: 141 [2018-07-23 13:50:19,582 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 13:50:19,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-07-23 13:50:19,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-07-23 13:50:19,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-23 13:50:19,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-07-23 13:50:19,588 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2018-07-23 13:50:19,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:19,588 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-07-23 13:50:19,588 INFO L472 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-23 13:50:19,588 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-07-23 13:50:19,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-23 13:50:19,590 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:19,590 INFO L357 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1] [2018-07-23 13:50:19,590 INFO L414 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:19,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1341364469, now seen corresponding path program 68 times [2018-07-23 13:50:19,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:19,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:19,902 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:19,903 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-23 13:50:19,903 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:19,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:19,904 INFO L185 omatonBuilderFactory]: Interpolants [22912#(<= ULTIMATE.start_main_~i~5 17), 22913#(<= ULTIMATE.start_main_~i~5 18), 22914#(<= ULTIMATE.start_main_~i~5 19), 22915#(<= ULTIMATE.start_main_~i~5 20), 22916#(<= ULTIMATE.start_main_~i~5 21), 22917#(<= ULTIMATE.start_main_~i~5 22), 22918#(<= ULTIMATE.start_main_~i~5 23), 22919#(<= ULTIMATE.start_main_~i~5 24), 22920#(<= ULTIMATE.start_main_~i~5 25), 22921#(<= ULTIMATE.start_main_~i~5 26), 22922#(<= ULTIMATE.start_main_~i~5 27), 22923#(<= ULTIMATE.start_main_~i~5 28), 22924#(<= ULTIMATE.start_main_~i~5 29), 22925#(<= ULTIMATE.start_main_~i~5 30), 22926#(<= ULTIMATE.start_main_~i~5 31), 22927#(<= ULTIMATE.start_main_~i~5 32), 22928#(<= ULTIMATE.start_main_~i~5 33), 22929#(<= ULTIMATE.start_main_~i~5 34), 22930#(<= ULTIMATE.start_main_~i~5 35), 22931#(<= ULTIMATE.start_main_~i~5 36), 22932#(<= ULTIMATE.start_main_~i~5 37), 22933#(<= ULTIMATE.start_main_~i~5 38), 22934#(<= ULTIMATE.start_main_~i~5 39), 22935#(<= ULTIMATE.start_main_~i~5 40), 22936#(<= ULTIMATE.start_main_~i~5 41), 22937#(<= ULTIMATE.start_main_~i~5 42), 22938#(<= ULTIMATE.start_main_~i~5 43), 22939#(<= ULTIMATE.start_main_~i~5 44), 22940#(<= ULTIMATE.start_main_~i~5 45), 22941#(<= ULTIMATE.start_main_~i~5 46), 22942#(<= ULTIMATE.start_main_~i~5 47), 22943#(<= ULTIMATE.start_main_~i~5 48), 22944#(<= ULTIMATE.start_main_~i~5 49), 22945#(<= ULTIMATE.start_main_~i~5 50), 22946#(<= ULTIMATE.start_main_~i~5 51), 22947#(<= ULTIMATE.start_main_~i~5 52), 22948#(<= ULTIMATE.start_main_~i~5 53), 22949#(<= ULTIMATE.start_main_~i~5 54), 22950#(<= ULTIMATE.start_main_~i~5 55), 22951#(<= ULTIMATE.start_main_~i~5 56), 22952#(<= ULTIMATE.start_main_~i~5 57), 22953#(<= ULTIMATE.start_main_~i~5 58), 22954#(<= ULTIMATE.start_main_~i~5 59), 22955#(<= ULTIMATE.start_main_~i~5 60), 22956#(<= ULTIMATE.start_main_~i~5 61), 22957#(<= ULTIMATE.start_main_~i~5 62), 22958#(<= ULTIMATE.start_main_~i~5 63), 22959#(<= ULTIMATE.start_main_~i~5 64), 22960#(<= ULTIMATE.start_main_~i~5 65), 22961#(<= ULTIMATE.start_main_~i~5 66), 22962#(<= ULTIMATE.start_main_~i~5 67), 22963#(<= ULTIMATE.start_main_~i~5 68), 22893#true, 22894#false, 22895#(<= ULTIMATE.start_main_~i~5 0), 22896#(<= ULTIMATE.start_main_~i~5 1), 22897#(<= ULTIMATE.start_main_~i~5 2), 22898#(<= ULTIMATE.start_main_~i~5 3), 22899#(<= ULTIMATE.start_main_~i~5 4), 22900#(<= ULTIMATE.start_main_~i~5 5), 22901#(<= ULTIMATE.start_main_~i~5 6), 22902#(<= ULTIMATE.start_main_~i~5 7), 22903#(<= ULTIMATE.start_main_~i~5 8), 22904#(<= ULTIMATE.start_main_~i~5 9), 22905#(<= ULTIMATE.start_main_~i~5 10), 22906#(<= ULTIMATE.start_main_~i~5 11), 22907#(<= ULTIMATE.start_main_~i~5 12), 22908#(<= ULTIMATE.start_main_~i~5 13), 22909#(<= ULTIMATE.start_main_~i~5 14), 22910#(<= ULTIMATE.start_main_~i~5 15), 22911#(<= ULTIMATE.start_main_~i~5 16)] [2018-07-23 13:50:19,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:19,905 INFO L450 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-23 13:50:19,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-23 13:50:19,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 13:50:19,906 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 71 states. [2018-07-23 13:50:19,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:19,994 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-07-23 13:50:19,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-23 13:50:19,994 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2018-07-23 13:50:19,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:19,995 INFO L225 Difference]: With dead ends: 145 [2018-07-23 13:50:19,995 INFO L226 Difference]: Without dead ends: 143 [2018-07-23 13:50:19,996 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 13:50:19,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-23 13:50:20,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-07-23 13:50:20,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-23 13:50:20,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-07-23 13:50:20,002 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2018-07-23 13:50:20,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:20,002 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-07-23 13:50:20,002 INFO L472 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-23 13:50:20,002 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-07-23 13:50:20,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-23 13:50:20,004 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:20,004 INFO L357 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1] [2018-07-23 13:50:20,004 INFO L414 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:20,004 INFO L82 PathProgramCache]: Analyzing trace with hash 560998897, now seen corresponding path program 69 times [2018-07-23 13:50:20,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:20,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:20,304 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:20,304 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-23 13:50:20,305 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:20,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:20,305 INFO L185 omatonBuilderFactory]: Interpolants [23552#(<= ULTIMATE.start_main_~i~5 10), 23553#(<= ULTIMATE.start_main_~i~5 11), 23554#(<= ULTIMATE.start_main_~i~5 12), 23555#(<= ULTIMATE.start_main_~i~5 13), 23556#(<= ULTIMATE.start_main_~i~5 14), 23557#(<= ULTIMATE.start_main_~i~5 15), 23558#(<= ULTIMATE.start_main_~i~5 16), 23559#(<= ULTIMATE.start_main_~i~5 17), 23560#(<= ULTIMATE.start_main_~i~5 18), 23561#(<= ULTIMATE.start_main_~i~5 19), 23562#(<= ULTIMATE.start_main_~i~5 20), 23563#(<= ULTIMATE.start_main_~i~5 21), 23564#(<= ULTIMATE.start_main_~i~5 22), 23565#(<= ULTIMATE.start_main_~i~5 23), 23566#(<= ULTIMATE.start_main_~i~5 24), 23567#(<= ULTIMATE.start_main_~i~5 25), 23568#(<= ULTIMATE.start_main_~i~5 26), 23569#(<= ULTIMATE.start_main_~i~5 27), 23570#(<= ULTIMATE.start_main_~i~5 28), 23571#(<= ULTIMATE.start_main_~i~5 29), 23572#(<= ULTIMATE.start_main_~i~5 30), 23573#(<= ULTIMATE.start_main_~i~5 31), 23574#(<= ULTIMATE.start_main_~i~5 32), 23575#(<= ULTIMATE.start_main_~i~5 33), 23576#(<= ULTIMATE.start_main_~i~5 34), 23577#(<= ULTIMATE.start_main_~i~5 35), 23578#(<= ULTIMATE.start_main_~i~5 36), 23579#(<= ULTIMATE.start_main_~i~5 37), 23580#(<= ULTIMATE.start_main_~i~5 38), 23581#(<= ULTIMATE.start_main_~i~5 39), 23582#(<= ULTIMATE.start_main_~i~5 40), 23583#(<= ULTIMATE.start_main_~i~5 41), 23584#(<= ULTIMATE.start_main_~i~5 42), 23585#(<= ULTIMATE.start_main_~i~5 43), 23586#(<= ULTIMATE.start_main_~i~5 44), 23587#(<= ULTIMATE.start_main_~i~5 45), 23588#(<= ULTIMATE.start_main_~i~5 46), 23589#(<= ULTIMATE.start_main_~i~5 47), 23590#(<= ULTIMATE.start_main_~i~5 48), 23591#(<= ULTIMATE.start_main_~i~5 49), 23592#(<= ULTIMATE.start_main_~i~5 50), 23593#(<= ULTIMATE.start_main_~i~5 51), 23594#(<= ULTIMATE.start_main_~i~5 52), 23595#(<= ULTIMATE.start_main_~i~5 53), 23596#(<= ULTIMATE.start_main_~i~5 54), 23597#(<= ULTIMATE.start_main_~i~5 55), 23598#(<= ULTIMATE.start_main_~i~5 56), 23599#(<= ULTIMATE.start_main_~i~5 57), 23600#(<= ULTIMATE.start_main_~i~5 58), 23601#(<= ULTIMATE.start_main_~i~5 59), 23602#(<= ULTIMATE.start_main_~i~5 60), 23603#(<= ULTIMATE.start_main_~i~5 61), 23604#(<= ULTIMATE.start_main_~i~5 62), 23605#(<= ULTIMATE.start_main_~i~5 63), 23606#(<= ULTIMATE.start_main_~i~5 64), 23607#(<= ULTIMATE.start_main_~i~5 65), 23608#(<= ULTIMATE.start_main_~i~5 66), 23609#(<= ULTIMATE.start_main_~i~5 67), 23610#(<= ULTIMATE.start_main_~i~5 68), 23611#(<= ULTIMATE.start_main_~i~5 69), 23540#true, 23541#false, 23542#(<= ULTIMATE.start_main_~i~5 0), 23543#(<= ULTIMATE.start_main_~i~5 1), 23544#(<= ULTIMATE.start_main_~i~5 2), 23545#(<= ULTIMATE.start_main_~i~5 3), 23546#(<= ULTIMATE.start_main_~i~5 4), 23547#(<= ULTIMATE.start_main_~i~5 5), 23548#(<= ULTIMATE.start_main_~i~5 6), 23549#(<= ULTIMATE.start_main_~i~5 7), 23550#(<= ULTIMATE.start_main_~i~5 8), 23551#(<= ULTIMATE.start_main_~i~5 9)] [2018-07-23 13:50:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:20,306 INFO L450 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-23 13:50:20,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-23 13:50:20,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 13:50:20,308 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 72 states. [2018-07-23 13:50:20,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:20,416 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-07-23 13:50:20,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-23 13:50:20,416 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-07-23 13:50:20,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:20,418 INFO L225 Difference]: With dead ends: 147 [2018-07-23 13:50:20,418 INFO L226 Difference]: Without dead ends: 145 [2018-07-23 13:50:20,419 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 13:50:20,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-23 13:50:20,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-07-23 13:50:20,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-23 13:50:20,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-07-23 13:50:20,424 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2018-07-23 13:50:20,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:20,424 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-07-23 13:50:20,424 INFO L472 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-23 13:50:20,424 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-07-23 13:50:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-23 13:50:20,426 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:20,426 INFO L357 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1] [2018-07-23 13:50:20,426 INFO L414 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:20,426 INFO L82 PathProgramCache]: Analyzing trace with hash -2046006291, now seen corresponding path program 70 times [2018-07-23 13:50:20,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:20,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:20,748 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:20,748 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-23 13:50:20,748 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:20,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:20,749 INFO L185 omatonBuilderFactory]: Interpolants [24196#true, 24197#false, 24198#(<= ULTIMATE.start_main_~i~5 0), 24199#(<= ULTIMATE.start_main_~i~5 1), 24200#(<= ULTIMATE.start_main_~i~5 2), 24201#(<= ULTIMATE.start_main_~i~5 3), 24202#(<= ULTIMATE.start_main_~i~5 4), 24203#(<= ULTIMATE.start_main_~i~5 5), 24204#(<= ULTIMATE.start_main_~i~5 6), 24205#(<= ULTIMATE.start_main_~i~5 7), 24206#(<= ULTIMATE.start_main_~i~5 8), 24207#(<= ULTIMATE.start_main_~i~5 9), 24208#(<= ULTIMATE.start_main_~i~5 10), 24209#(<= ULTIMATE.start_main_~i~5 11), 24210#(<= ULTIMATE.start_main_~i~5 12), 24211#(<= ULTIMATE.start_main_~i~5 13), 24212#(<= ULTIMATE.start_main_~i~5 14), 24213#(<= ULTIMATE.start_main_~i~5 15), 24214#(<= ULTIMATE.start_main_~i~5 16), 24215#(<= ULTIMATE.start_main_~i~5 17), 24216#(<= ULTIMATE.start_main_~i~5 18), 24217#(<= ULTIMATE.start_main_~i~5 19), 24218#(<= ULTIMATE.start_main_~i~5 20), 24219#(<= ULTIMATE.start_main_~i~5 21), 24220#(<= ULTIMATE.start_main_~i~5 22), 24221#(<= ULTIMATE.start_main_~i~5 23), 24222#(<= ULTIMATE.start_main_~i~5 24), 24223#(<= ULTIMATE.start_main_~i~5 25), 24224#(<= ULTIMATE.start_main_~i~5 26), 24225#(<= ULTIMATE.start_main_~i~5 27), 24226#(<= ULTIMATE.start_main_~i~5 28), 24227#(<= ULTIMATE.start_main_~i~5 29), 24228#(<= ULTIMATE.start_main_~i~5 30), 24229#(<= ULTIMATE.start_main_~i~5 31), 24230#(<= ULTIMATE.start_main_~i~5 32), 24231#(<= ULTIMATE.start_main_~i~5 33), 24232#(<= ULTIMATE.start_main_~i~5 34), 24233#(<= ULTIMATE.start_main_~i~5 35), 24234#(<= ULTIMATE.start_main_~i~5 36), 24235#(<= ULTIMATE.start_main_~i~5 37), 24236#(<= ULTIMATE.start_main_~i~5 38), 24237#(<= ULTIMATE.start_main_~i~5 39), 24238#(<= ULTIMATE.start_main_~i~5 40), 24239#(<= ULTIMATE.start_main_~i~5 41), 24240#(<= ULTIMATE.start_main_~i~5 42), 24241#(<= ULTIMATE.start_main_~i~5 43), 24242#(<= ULTIMATE.start_main_~i~5 44), 24243#(<= ULTIMATE.start_main_~i~5 45), 24244#(<= ULTIMATE.start_main_~i~5 46), 24245#(<= ULTIMATE.start_main_~i~5 47), 24246#(<= ULTIMATE.start_main_~i~5 48), 24247#(<= ULTIMATE.start_main_~i~5 49), 24248#(<= ULTIMATE.start_main_~i~5 50), 24249#(<= ULTIMATE.start_main_~i~5 51), 24250#(<= ULTIMATE.start_main_~i~5 52), 24251#(<= ULTIMATE.start_main_~i~5 53), 24252#(<= ULTIMATE.start_main_~i~5 54), 24253#(<= ULTIMATE.start_main_~i~5 55), 24254#(<= ULTIMATE.start_main_~i~5 56), 24255#(<= ULTIMATE.start_main_~i~5 57), 24256#(<= ULTIMATE.start_main_~i~5 58), 24257#(<= ULTIMATE.start_main_~i~5 59), 24258#(<= ULTIMATE.start_main_~i~5 60), 24259#(<= ULTIMATE.start_main_~i~5 61), 24260#(<= ULTIMATE.start_main_~i~5 62), 24261#(<= ULTIMATE.start_main_~i~5 63), 24262#(<= ULTIMATE.start_main_~i~5 64), 24263#(<= ULTIMATE.start_main_~i~5 65), 24264#(<= ULTIMATE.start_main_~i~5 66), 24265#(<= ULTIMATE.start_main_~i~5 67), 24266#(<= ULTIMATE.start_main_~i~5 68), 24267#(<= ULTIMATE.start_main_~i~5 69), 24268#(<= ULTIMATE.start_main_~i~5 70)] [2018-07-23 13:50:20,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:20,750 INFO L450 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-23 13:50:20,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-23 13:50:20,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 13:50:20,751 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 73 states. [2018-07-23 13:50:20,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:20,868 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-07-23 13:50:20,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-23 13:50:20,868 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-07-23 13:50:20,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:20,869 INFO L225 Difference]: With dead ends: 149 [2018-07-23 13:50:20,872 INFO L226 Difference]: Without dead ends: 147 [2018-07-23 13:50:20,873 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 13:50:20,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-23 13:50:20,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-07-23 13:50:20,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-07-23 13:50:20,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-07-23 13:50:20,878 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2018-07-23 13:50:20,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:20,878 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-07-23 13:50:20,878 INFO L472 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-23 13:50:20,879 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-07-23 13:50:20,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-07-23 13:50:20,880 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:20,880 INFO L357 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1] [2018-07-23 13:50:20,881 INFO L414 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:20,881 INFO L82 PathProgramCache]: Analyzing trace with hash 882908905, now seen corresponding path program 71 times [2018-07-23 13:50:20,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:21,243 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:21,244 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:21,244 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-23 13:50:21,244 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:21,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:21,245 INFO L185 omatonBuilderFactory]: Interpolants [24861#true, 24862#false, 24863#(<= ULTIMATE.start_main_~i~5 0), 24864#(<= ULTIMATE.start_main_~i~5 1), 24865#(<= ULTIMATE.start_main_~i~5 2), 24866#(<= ULTIMATE.start_main_~i~5 3), 24867#(<= ULTIMATE.start_main_~i~5 4), 24868#(<= ULTIMATE.start_main_~i~5 5), 24869#(<= ULTIMATE.start_main_~i~5 6), 24870#(<= ULTIMATE.start_main_~i~5 7), 24871#(<= ULTIMATE.start_main_~i~5 8), 24872#(<= ULTIMATE.start_main_~i~5 9), 24873#(<= ULTIMATE.start_main_~i~5 10), 24874#(<= ULTIMATE.start_main_~i~5 11), 24875#(<= ULTIMATE.start_main_~i~5 12), 24876#(<= ULTIMATE.start_main_~i~5 13), 24877#(<= ULTIMATE.start_main_~i~5 14), 24878#(<= ULTIMATE.start_main_~i~5 15), 24879#(<= ULTIMATE.start_main_~i~5 16), 24880#(<= ULTIMATE.start_main_~i~5 17), 24881#(<= ULTIMATE.start_main_~i~5 18), 24882#(<= ULTIMATE.start_main_~i~5 19), 24883#(<= ULTIMATE.start_main_~i~5 20), 24884#(<= ULTIMATE.start_main_~i~5 21), 24885#(<= ULTIMATE.start_main_~i~5 22), 24886#(<= ULTIMATE.start_main_~i~5 23), 24887#(<= ULTIMATE.start_main_~i~5 24), 24888#(<= ULTIMATE.start_main_~i~5 25), 24889#(<= ULTIMATE.start_main_~i~5 26), 24890#(<= ULTIMATE.start_main_~i~5 27), 24891#(<= ULTIMATE.start_main_~i~5 28), 24892#(<= ULTIMATE.start_main_~i~5 29), 24893#(<= ULTIMATE.start_main_~i~5 30), 24894#(<= ULTIMATE.start_main_~i~5 31), 24895#(<= ULTIMATE.start_main_~i~5 32), 24896#(<= ULTIMATE.start_main_~i~5 33), 24897#(<= ULTIMATE.start_main_~i~5 34), 24898#(<= ULTIMATE.start_main_~i~5 35), 24899#(<= ULTIMATE.start_main_~i~5 36), 24900#(<= ULTIMATE.start_main_~i~5 37), 24901#(<= ULTIMATE.start_main_~i~5 38), 24902#(<= ULTIMATE.start_main_~i~5 39), 24903#(<= ULTIMATE.start_main_~i~5 40), 24904#(<= ULTIMATE.start_main_~i~5 41), 24905#(<= ULTIMATE.start_main_~i~5 42), 24906#(<= ULTIMATE.start_main_~i~5 43), 24907#(<= ULTIMATE.start_main_~i~5 44), 24908#(<= ULTIMATE.start_main_~i~5 45), 24909#(<= ULTIMATE.start_main_~i~5 46), 24910#(<= ULTIMATE.start_main_~i~5 47), 24911#(<= ULTIMATE.start_main_~i~5 48), 24912#(<= ULTIMATE.start_main_~i~5 49), 24913#(<= ULTIMATE.start_main_~i~5 50), 24914#(<= ULTIMATE.start_main_~i~5 51), 24915#(<= ULTIMATE.start_main_~i~5 52), 24916#(<= ULTIMATE.start_main_~i~5 53), 24917#(<= ULTIMATE.start_main_~i~5 54), 24918#(<= ULTIMATE.start_main_~i~5 55), 24919#(<= ULTIMATE.start_main_~i~5 56), 24920#(<= ULTIMATE.start_main_~i~5 57), 24921#(<= ULTIMATE.start_main_~i~5 58), 24922#(<= ULTIMATE.start_main_~i~5 59), 24923#(<= ULTIMATE.start_main_~i~5 60), 24924#(<= ULTIMATE.start_main_~i~5 61), 24925#(<= ULTIMATE.start_main_~i~5 62), 24926#(<= ULTIMATE.start_main_~i~5 63), 24927#(<= ULTIMATE.start_main_~i~5 64), 24928#(<= ULTIMATE.start_main_~i~5 65), 24929#(<= ULTIMATE.start_main_~i~5 66), 24930#(<= ULTIMATE.start_main_~i~5 67), 24931#(<= ULTIMATE.start_main_~i~5 68), 24932#(<= ULTIMATE.start_main_~i~5 69), 24933#(<= ULTIMATE.start_main_~i~5 70), 24934#(<= ULTIMATE.start_main_~i~5 71)] [2018-07-23 13:50:21,246 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:21,247 INFO L450 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-23 13:50:21,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-23 13:50:21,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 13:50:21,249 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 74 states. [2018-07-23 13:50:21,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:21,371 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-07-23 13:50:21,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-23 13:50:21,372 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-07-23 13:50:21,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:21,373 INFO L225 Difference]: With dead ends: 151 [2018-07-23 13:50:21,374 INFO L226 Difference]: Without dead ends: 149 [2018-07-23 13:50:21,375 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 13:50:21,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-23 13:50:21,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-07-23 13:50:21,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-23 13:50:21,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-07-23 13:50:21,381 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2018-07-23 13:50:21,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:21,382 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-07-23 13:50:21,382 INFO L472 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-23 13:50:21,382 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-07-23 13:50:21,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-23 13:50:21,384 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:21,384 INFO L357 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1] [2018-07-23 13:50:21,384 INFO L414 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:21,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1928133915, now seen corresponding path program 72 times [2018-07-23 13:50:21,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:21,812 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:21,812 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:21,812 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-23 13:50:21,813 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:21,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:21,813 INFO L185 omatonBuilderFactory]: Interpolants [25600#(<= ULTIMATE.start_main_~i~5 63), 25601#(<= ULTIMATE.start_main_~i~5 64), 25602#(<= ULTIMATE.start_main_~i~5 65), 25603#(<= ULTIMATE.start_main_~i~5 66), 25604#(<= ULTIMATE.start_main_~i~5 67), 25605#(<= ULTIMATE.start_main_~i~5 68), 25606#(<= ULTIMATE.start_main_~i~5 69), 25607#(<= ULTIMATE.start_main_~i~5 70), 25608#(<= ULTIMATE.start_main_~i~5 71), 25609#(<= ULTIMATE.start_main_~i~5 72), 25535#true, 25536#false, 25537#(<= ULTIMATE.start_main_~i~5 0), 25538#(<= ULTIMATE.start_main_~i~5 1), 25539#(<= ULTIMATE.start_main_~i~5 2), 25540#(<= ULTIMATE.start_main_~i~5 3), 25541#(<= ULTIMATE.start_main_~i~5 4), 25542#(<= ULTIMATE.start_main_~i~5 5), 25543#(<= ULTIMATE.start_main_~i~5 6), 25544#(<= ULTIMATE.start_main_~i~5 7), 25545#(<= ULTIMATE.start_main_~i~5 8), 25546#(<= ULTIMATE.start_main_~i~5 9), 25547#(<= ULTIMATE.start_main_~i~5 10), 25548#(<= ULTIMATE.start_main_~i~5 11), 25549#(<= ULTIMATE.start_main_~i~5 12), 25550#(<= ULTIMATE.start_main_~i~5 13), 25551#(<= ULTIMATE.start_main_~i~5 14), 25552#(<= ULTIMATE.start_main_~i~5 15), 25553#(<= ULTIMATE.start_main_~i~5 16), 25554#(<= ULTIMATE.start_main_~i~5 17), 25555#(<= ULTIMATE.start_main_~i~5 18), 25556#(<= ULTIMATE.start_main_~i~5 19), 25557#(<= ULTIMATE.start_main_~i~5 20), 25558#(<= ULTIMATE.start_main_~i~5 21), 25559#(<= ULTIMATE.start_main_~i~5 22), 25560#(<= ULTIMATE.start_main_~i~5 23), 25561#(<= ULTIMATE.start_main_~i~5 24), 25562#(<= ULTIMATE.start_main_~i~5 25), 25563#(<= ULTIMATE.start_main_~i~5 26), 25564#(<= ULTIMATE.start_main_~i~5 27), 25565#(<= ULTIMATE.start_main_~i~5 28), 25566#(<= ULTIMATE.start_main_~i~5 29), 25567#(<= ULTIMATE.start_main_~i~5 30), 25568#(<= ULTIMATE.start_main_~i~5 31), 25569#(<= ULTIMATE.start_main_~i~5 32), 25570#(<= ULTIMATE.start_main_~i~5 33), 25571#(<= ULTIMATE.start_main_~i~5 34), 25572#(<= ULTIMATE.start_main_~i~5 35), 25573#(<= ULTIMATE.start_main_~i~5 36), 25574#(<= ULTIMATE.start_main_~i~5 37), 25575#(<= ULTIMATE.start_main_~i~5 38), 25576#(<= ULTIMATE.start_main_~i~5 39), 25577#(<= ULTIMATE.start_main_~i~5 40), 25578#(<= ULTIMATE.start_main_~i~5 41), 25579#(<= ULTIMATE.start_main_~i~5 42), 25580#(<= ULTIMATE.start_main_~i~5 43), 25581#(<= ULTIMATE.start_main_~i~5 44), 25582#(<= ULTIMATE.start_main_~i~5 45), 25583#(<= ULTIMATE.start_main_~i~5 46), 25584#(<= ULTIMATE.start_main_~i~5 47), 25585#(<= ULTIMATE.start_main_~i~5 48), 25586#(<= ULTIMATE.start_main_~i~5 49), 25587#(<= ULTIMATE.start_main_~i~5 50), 25588#(<= ULTIMATE.start_main_~i~5 51), 25589#(<= ULTIMATE.start_main_~i~5 52), 25590#(<= ULTIMATE.start_main_~i~5 53), 25591#(<= ULTIMATE.start_main_~i~5 54), 25592#(<= ULTIMATE.start_main_~i~5 55), 25593#(<= ULTIMATE.start_main_~i~5 56), 25594#(<= ULTIMATE.start_main_~i~5 57), 25595#(<= ULTIMATE.start_main_~i~5 58), 25596#(<= ULTIMATE.start_main_~i~5 59), 25597#(<= ULTIMATE.start_main_~i~5 60), 25598#(<= ULTIMATE.start_main_~i~5 61), 25599#(<= ULTIMATE.start_main_~i~5 62)] [2018-07-23 13:50:21,814 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:21,814 INFO L450 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-23 13:50:21,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-23 13:50:21,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 13:50:21,815 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 75 states. [2018-07-23 13:50:21,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:21,900 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-07-23 13:50:21,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-23 13:50:21,901 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-07-23 13:50:21,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:21,902 INFO L225 Difference]: With dead ends: 153 [2018-07-23 13:50:21,902 INFO L226 Difference]: Without dead ends: 151 [2018-07-23 13:50:21,903 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 13:50:21,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-07-23 13:50:21,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-07-23 13:50:21,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-23 13:50:21,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-07-23 13:50:21,910 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2018-07-23 13:50:21,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:21,910 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-07-23 13:50:21,910 INFO L472 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-23 13:50:21,910 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-07-23 13:50:21,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-23 13:50:21,911 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:21,912 INFO L357 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1] [2018-07-23 13:50:21,912 INFO L414 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:21,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1805854751, now seen corresponding path program 73 times [2018-07-23 13:50:21,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:22,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:22,192 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:22,192 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-23 13:50:22,192 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:22,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:22,193 INFO L185 omatonBuilderFactory]: Interpolants [26240#(<= ULTIMATE.start_main_~i~5 20), 26241#(<= ULTIMATE.start_main_~i~5 21), 26242#(<= ULTIMATE.start_main_~i~5 22), 26243#(<= ULTIMATE.start_main_~i~5 23), 26244#(<= ULTIMATE.start_main_~i~5 24), 26245#(<= ULTIMATE.start_main_~i~5 25), 26246#(<= ULTIMATE.start_main_~i~5 26), 26247#(<= ULTIMATE.start_main_~i~5 27), 26248#(<= ULTIMATE.start_main_~i~5 28), 26249#(<= ULTIMATE.start_main_~i~5 29), 26250#(<= ULTIMATE.start_main_~i~5 30), 26251#(<= ULTIMATE.start_main_~i~5 31), 26252#(<= ULTIMATE.start_main_~i~5 32), 26253#(<= ULTIMATE.start_main_~i~5 33), 26254#(<= ULTIMATE.start_main_~i~5 34), 26255#(<= ULTIMATE.start_main_~i~5 35), 26256#(<= ULTIMATE.start_main_~i~5 36), 26257#(<= ULTIMATE.start_main_~i~5 37), 26258#(<= ULTIMATE.start_main_~i~5 38), 26259#(<= ULTIMATE.start_main_~i~5 39), 26260#(<= ULTIMATE.start_main_~i~5 40), 26261#(<= ULTIMATE.start_main_~i~5 41), 26262#(<= ULTIMATE.start_main_~i~5 42), 26263#(<= ULTIMATE.start_main_~i~5 43), 26264#(<= ULTIMATE.start_main_~i~5 44), 26265#(<= ULTIMATE.start_main_~i~5 45), 26266#(<= ULTIMATE.start_main_~i~5 46), 26267#(<= ULTIMATE.start_main_~i~5 47), 26268#(<= ULTIMATE.start_main_~i~5 48), 26269#(<= ULTIMATE.start_main_~i~5 49), 26270#(<= ULTIMATE.start_main_~i~5 50), 26271#(<= ULTIMATE.start_main_~i~5 51), 26272#(<= ULTIMATE.start_main_~i~5 52), 26273#(<= ULTIMATE.start_main_~i~5 53), 26274#(<= ULTIMATE.start_main_~i~5 54), 26275#(<= ULTIMATE.start_main_~i~5 55), 26276#(<= ULTIMATE.start_main_~i~5 56), 26277#(<= ULTIMATE.start_main_~i~5 57), 26278#(<= ULTIMATE.start_main_~i~5 58), 26279#(<= ULTIMATE.start_main_~i~5 59), 26280#(<= ULTIMATE.start_main_~i~5 60), 26281#(<= ULTIMATE.start_main_~i~5 61), 26282#(<= ULTIMATE.start_main_~i~5 62), 26283#(<= ULTIMATE.start_main_~i~5 63), 26284#(<= ULTIMATE.start_main_~i~5 64), 26285#(<= ULTIMATE.start_main_~i~5 65), 26286#(<= ULTIMATE.start_main_~i~5 66), 26287#(<= ULTIMATE.start_main_~i~5 67), 26288#(<= ULTIMATE.start_main_~i~5 68), 26289#(<= ULTIMATE.start_main_~i~5 69), 26290#(<= ULTIMATE.start_main_~i~5 70), 26291#(<= ULTIMATE.start_main_~i~5 71), 26292#(<= ULTIMATE.start_main_~i~5 72), 26293#(<= ULTIMATE.start_main_~i~5 73), 26218#true, 26219#false, 26220#(<= ULTIMATE.start_main_~i~5 0), 26221#(<= ULTIMATE.start_main_~i~5 1), 26222#(<= ULTIMATE.start_main_~i~5 2), 26223#(<= ULTIMATE.start_main_~i~5 3), 26224#(<= ULTIMATE.start_main_~i~5 4), 26225#(<= ULTIMATE.start_main_~i~5 5), 26226#(<= ULTIMATE.start_main_~i~5 6), 26227#(<= ULTIMATE.start_main_~i~5 7), 26228#(<= ULTIMATE.start_main_~i~5 8), 26229#(<= ULTIMATE.start_main_~i~5 9), 26230#(<= ULTIMATE.start_main_~i~5 10), 26231#(<= ULTIMATE.start_main_~i~5 11), 26232#(<= ULTIMATE.start_main_~i~5 12), 26233#(<= ULTIMATE.start_main_~i~5 13), 26234#(<= ULTIMATE.start_main_~i~5 14), 26235#(<= ULTIMATE.start_main_~i~5 15), 26236#(<= ULTIMATE.start_main_~i~5 16), 26237#(<= ULTIMATE.start_main_~i~5 17), 26238#(<= ULTIMATE.start_main_~i~5 18), 26239#(<= ULTIMATE.start_main_~i~5 19)] [2018-07-23 13:50:22,193 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:22,194 INFO L450 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-23 13:50:22,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-23 13:50:22,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 13:50:22,195 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 76 states. [2018-07-23 13:50:22,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:22,285 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-07-23 13:50:22,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-23 13:50:22,285 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-07-23 13:50:22,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:22,287 INFO L225 Difference]: With dead ends: 155 [2018-07-23 13:50:22,287 INFO L226 Difference]: Without dead ends: 153 [2018-07-23 13:50:22,288 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 13:50:22,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-07-23 13:50:22,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-07-23 13:50:22,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-23 13:50:22,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-07-23 13:50:22,293 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2018-07-23 13:50:22,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:22,294 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-07-23 13:50:22,294 INFO L472 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-23 13:50:22,294 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-07-23 13:50:22,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-23 13:50:22,295 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:22,295 INFO L357 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1] [2018-07-23 13:50:22,296 INFO L414 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:22,296 INFO L82 PathProgramCache]: Analyzing trace with hash -259695139, now seen corresponding path program 74 times [2018-07-23 13:50:22,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:22,604 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:22,604 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:22,604 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-23 13:50:22,605 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:22,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:22,605 INFO L185 omatonBuilderFactory]: Interpolants [26910#true, 26911#false, 26912#(<= ULTIMATE.start_main_~i~5 0), 26913#(<= ULTIMATE.start_main_~i~5 1), 26914#(<= ULTIMATE.start_main_~i~5 2), 26915#(<= ULTIMATE.start_main_~i~5 3), 26916#(<= ULTIMATE.start_main_~i~5 4), 26917#(<= ULTIMATE.start_main_~i~5 5), 26918#(<= ULTIMATE.start_main_~i~5 6), 26919#(<= ULTIMATE.start_main_~i~5 7), 26920#(<= ULTIMATE.start_main_~i~5 8), 26921#(<= ULTIMATE.start_main_~i~5 9), 26922#(<= ULTIMATE.start_main_~i~5 10), 26923#(<= ULTIMATE.start_main_~i~5 11), 26924#(<= ULTIMATE.start_main_~i~5 12), 26925#(<= ULTIMATE.start_main_~i~5 13), 26926#(<= ULTIMATE.start_main_~i~5 14), 26927#(<= ULTIMATE.start_main_~i~5 15), 26928#(<= ULTIMATE.start_main_~i~5 16), 26929#(<= ULTIMATE.start_main_~i~5 17), 26930#(<= ULTIMATE.start_main_~i~5 18), 26931#(<= ULTIMATE.start_main_~i~5 19), 26932#(<= ULTIMATE.start_main_~i~5 20), 26933#(<= ULTIMATE.start_main_~i~5 21), 26934#(<= ULTIMATE.start_main_~i~5 22), 26935#(<= ULTIMATE.start_main_~i~5 23), 26936#(<= ULTIMATE.start_main_~i~5 24), 26937#(<= ULTIMATE.start_main_~i~5 25), 26938#(<= ULTIMATE.start_main_~i~5 26), 26939#(<= ULTIMATE.start_main_~i~5 27), 26940#(<= ULTIMATE.start_main_~i~5 28), 26941#(<= ULTIMATE.start_main_~i~5 29), 26942#(<= ULTIMATE.start_main_~i~5 30), 26943#(<= ULTIMATE.start_main_~i~5 31), 26944#(<= ULTIMATE.start_main_~i~5 32), 26945#(<= ULTIMATE.start_main_~i~5 33), 26946#(<= ULTIMATE.start_main_~i~5 34), 26947#(<= ULTIMATE.start_main_~i~5 35), 26948#(<= ULTIMATE.start_main_~i~5 36), 26949#(<= ULTIMATE.start_main_~i~5 37), 26950#(<= ULTIMATE.start_main_~i~5 38), 26951#(<= ULTIMATE.start_main_~i~5 39), 26952#(<= ULTIMATE.start_main_~i~5 40), 26953#(<= ULTIMATE.start_main_~i~5 41), 26954#(<= ULTIMATE.start_main_~i~5 42), 26955#(<= ULTIMATE.start_main_~i~5 43), 26956#(<= ULTIMATE.start_main_~i~5 44), 26957#(<= ULTIMATE.start_main_~i~5 45), 26958#(<= ULTIMATE.start_main_~i~5 46), 26959#(<= ULTIMATE.start_main_~i~5 47), 26960#(<= ULTIMATE.start_main_~i~5 48), 26961#(<= ULTIMATE.start_main_~i~5 49), 26962#(<= ULTIMATE.start_main_~i~5 50), 26963#(<= ULTIMATE.start_main_~i~5 51), 26964#(<= ULTIMATE.start_main_~i~5 52), 26965#(<= ULTIMATE.start_main_~i~5 53), 26966#(<= ULTIMATE.start_main_~i~5 54), 26967#(<= ULTIMATE.start_main_~i~5 55), 26968#(<= ULTIMATE.start_main_~i~5 56), 26969#(<= ULTIMATE.start_main_~i~5 57), 26970#(<= ULTIMATE.start_main_~i~5 58), 26971#(<= ULTIMATE.start_main_~i~5 59), 26972#(<= ULTIMATE.start_main_~i~5 60), 26973#(<= ULTIMATE.start_main_~i~5 61), 26974#(<= ULTIMATE.start_main_~i~5 62), 26975#(<= ULTIMATE.start_main_~i~5 63), 26976#(<= ULTIMATE.start_main_~i~5 64), 26977#(<= ULTIMATE.start_main_~i~5 65), 26978#(<= ULTIMATE.start_main_~i~5 66), 26979#(<= ULTIMATE.start_main_~i~5 67), 26980#(<= ULTIMATE.start_main_~i~5 68), 26981#(<= ULTIMATE.start_main_~i~5 69), 26982#(<= ULTIMATE.start_main_~i~5 70), 26983#(<= ULTIMATE.start_main_~i~5 71), 26984#(<= ULTIMATE.start_main_~i~5 72), 26985#(<= ULTIMATE.start_main_~i~5 73), 26986#(<= ULTIMATE.start_main_~i~5 74)] [2018-07-23 13:50:22,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:22,606 INFO L450 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-23 13:50:22,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-23 13:50:22,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 13:50:22,608 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 77 states. [2018-07-23 13:50:22,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:22,744 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-07-23 13:50:22,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-23 13:50:22,745 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2018-07-23 13:50:22,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:22,746 INFO L225 Difference]: With dead ends: 157 [2018-07-23 13:50:22,746 INFO L226 Difference]: Without dead ends: 155 [2018-07-23 13:50:22,747 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 13:50:22,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-23 13:50:22,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-07-23 13:50:22,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-23 13:50:22,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-07-23 13:50:22,753 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2018-07-23 13:50:22,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:22,753 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-07-23 13:50:22,753 INFO L472 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-23 13:50:22,754 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-07-23 13:50:22,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-23 13:50:22,755 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:22,756 INFO L357 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1] [2018-07-23 13:50:22,756 INFO L414 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:22,756 INFO L82 PathProgramCache]: Analyzing trace with hash -458992423, now seen corresponding path program 75 times [2018-07-23 13:50:22,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:23,106 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:23,107 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:23,107 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-23 13:50:23,107 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:23,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:23,108 INFO L185 omatonBuilderFactory]: Interpolants [27648#(<= ULTIMATE.start_main_~i~5 35), 27649#(<= ULTIMATE.start_main_~i~5 36), 27650#(<= ULTIMATE.start_main_~i~5 37), 27651#(<= ULTIMATE.start_main_~i~5 38), 27652#(<= ULTIMATE.start_main_~i~5 39), 27653#(<= ULTIMATE.start_main_~i~5 40), 27654#(<= ULTIMATE.start_main_~i~5 41), 27655#(<= ULTIMATE.start_main_~i~5 42), 27656#(<= ULTIMATE.start_main_~i~5 43), 27657#(<= ULTIMATE.start_main_~i~5 44), 27658#(<= ULTIMATE.start_main_~i~5 45), 27659#(<= ULTIMATE.start_main_~i~5 46), 27660#(<= ULTIMATE.start_main_~i~5 47), 27661#(<= ULTIMATE.start_main_~i~5 48), 27662#(<= ULTIMATE.start_main_~i~5 49), 27663#(<= ULTIMATE.start_main_~i~5 50), 27664#(<= ULTIMATE.start_main_~i~5 51), 27665#(<= ULTIMATE.start_main_~i~5 52), 27666#(<= ULTIMATE.start_main_~i~5 53), 27667#(<= ULTIMATE.start_main_~i~5 54), 27668#(<= ULTIMATE.start_main_~i~5 55), 27669#(<= ULTIMATE.start_main_~i~5 56), 27670#(<= ULTIMATE.start_main_~i~5 57), 27671#(<= ULTIMATE.start_main_~i~5 58), 27672#(<= ULTIMATE.start_main_~i~5 59), 27673#(<= ULTIMATE.start_main_~i~5 60), 27674#(<= ULTIMATE.start_main_~i~5 61), 27675#(<= ULTIMATE.start_main_~i~5 62), 27676#(<= ULTIMATE.start_main_~i~5 63), 27677#(<= ULTIMATE.start_main_~i~5 64), 27678#(<= ULTIMATE.start_main_~i~5 65), 27679#(<= ULTIMATE.start_main_~i~5 66), 27680#(<= ULTIMATE.start_main_~i~5 67), 27681#(<= ULTIMATE.start_main_~i~5 68), 27682#(<= ULTIMATE.start_main_~i~5 69), 27683#(<= ULTIMATE.start_main_~i~5 70), 27684#(<= ULTIMATE.start_main_~i~5 71), 27685#(<= ULTIMATE.start_main_~i~5 72), 27686#(<= ULTIMATE.start_main_~i~5 73), 27687#(<= ULTIMATE.start_main_~i~5 74), 27688#(<= ULTIMATE.start_main_~i~5 75), 27611#true, 27612#false, 27613#(<= ULTIMATE.start_main_~i~5 0), 27614#(<= ULTIMATE.start_main_~i~5 1), 27615#(<= ULTIMATE.start_main_~i~5 2), 27616#(<= ULTIMATE.start_main_~i~5 3), 27617#(<= ULTIMATE.start_main_~i~5 4), 27618#(<= ULTIMATE.start_main_~i~5 5), 27619#(<= ULTIMATE.start_main_~i~5 6), 27620#(<= ULTIMATE.start_main_~i~5 7), 27621#(<= ULTIMATE.start_main_~i~5 8), 27622#(<= ULTIMATE.start_main_~i~5 9), 27623#(<= ULTIMATE.start_main_~i~5 10), 27624#(<= ULTIMATE.start_main_~i~5 11), 27625#(<= ULTIMATE.start_main_~i~5 12), 27626#(<= ULTIMATE.start_main_~i~5 13), 27627#(<= ULTIMATE.start_main_~i~5 14), 27628#(<= ULTIMATE.start_main_~i~5 15), 27629#(<= ULTIMATE.start_main_~i~5 16), 27630#(<= ULTIMATE.start_main_~i~5 17), 27631#(<= ULTIMATE.start_main_~i~5 18), 27632#(<= ULTIMATE.start_main_~i~5 19), 27633#(<= ULTIMATE.start_main_~i~5 20), 27634#(<= ULTIMATE.start_main_~i~5 21), 27635#(<= ULTIMATE.start_main_~i~5 22), 27636#(<= ULTIMATE.start_main_~i~5 23), 27637#(<= ULTIMATE.start_main_~i~5 24), 27638#(<= ULTIMATE.start_main_~i~5 25), 27639#(<= ULTIMATE.start_main_~i~5 26), 27640#(<= ULTIMATE.start_main_~i~5 27), 27641#(<= ULTIMATE.start_main_~i~5 28), 27642#(<= ULTIMATE.start_main_~i~5 29), 27643#(<= ULTIMATE.start_main_~i~5 30), 27644#(<= ULTIMATE.start_main_~i~5 31), 27645#(<= ULTIMATE.start_main_~i~5 32), 27646#(<= ULTIMATE.start_main_~i~5 33), 27647#(<= ULTIMATE.start_main_~i~5 34)] [2018-07-23 13:50:23,109 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:23,109 INFO L450 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-23 13:50:23,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-23 13:50:23,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 13:50:23,111 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 78 states. [2018-07-23 13:50:23,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:23,184 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-07-23 13:50:23,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-23 13:50:23,185 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-07-23 13:50:23,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:23,186 INFO L225 Difference]: With dead ends: 159 [2018-07-23 13:50:23,186 INFO L226 Difference]: Without dead ends: 157 [2018-07-23 13:50:23,187 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 13:50:23,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-07-23 13:50:23,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-07-23 13:50:23,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-07-23 13:50:23,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-07-23 13:50:23,195 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2018-07-23 13:50:23,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:23,195 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-07-23 13:50:23,195 INFO L472 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-23 13:50:23,195 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-07-23 13:50:23,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-23 13:50:23,197 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:23,197 INFO L357 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1] [2018-07-23 13:50:23,197 INFO L414 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:23,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1289845973, now seen corresponding path program 76 times [2018-07-23 13:50:23,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:23,538 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:23,538 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:23,539 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-23 13:50:23,539 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:23,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:23,540 INFO L185 omatonBuilderFactory]: Interpolants [28321#true, 28322#false, 28323#(<= ULTIMATE.start_main_~i~5 0), 28324#(<= ULTIMATE.start_main_~i~5 1), 28325#(<= ULTIMATE.start_main_~i~5 2), 28326#(<= ULTIMATE.start_main_~i~5 3), 28327#(<= ULTIMATE.start_main_~i~5 4), 28328#(<= ULTIMATE.start_main_~i~5 5), 28329#(<= ULTIMATE.start_main_~i~5 6), 28330#(<= ULTIMATE.start_main_~i~5 7), 28331#(<= ULTIMATE.start_main_~i~5 8), 28332#(<= ULTIMATE.start_main_~i~5 9), 28333#(<= ULTIMATE.start_main_~i~5 10), 28334#(<= ULTIMATE.start_main_~i~5 11), 28335#(<= ULTIMATE.start_main_~i~5 12), 28336#(<= ULTIMATE.start_main_~i~5 13), 28337#(<= ULTIMATE.start_main_~i~5 14), 28338#(<= ULTIMATE.start_main_~i~5 15), 28339#(<= ULTIMATE.start_main_~i~5 16), 28340#(<= ULTIMATE.start_main_~i~5 17), 28341#(<= ULTIMATE.start_main_~i~5 18), 28342#(<= ULTIMATE.start_main_~i~5 19), 28343#(<= ULTIMATE.start_main_~i~5 20), 28344#(<= ULTIMATE.start_main_~i~5 21), 28345#(<= ULTIMATE.start_main_~i~5 22), 28346#(<= ULTIMATE.start_main_~i~5 23), 28347#(<= ULTIMATE.start_main_~i~5 24), 28348#(<= ULTIMATE.start_main_~i~5 25), 28349#(<= ULTIMATE.start_main_~i~5 26), 28350#(<= ULTIMATE.start_main_~i~5 27), 28351#(<= ULTIMATE.start_main_~i~5 28), 28352#(<= ULTIMATE.start_main_~i~5 29), 28353#(<= ULTIMATE.start_main_~i~5 30), 28354#(<= ULTIMATE.start_main_~i~5 31), 28355#(<= ULTIMATE.start_main_~i~5 32), 28356#(<= ULTIMATE.start_main_~i~5 33), 28357#(<= ULTIMATE.start_main_~i~5 34), 28358#(<= ULTIMATE.start_main_~i~5 35), 28359#(<= ULTIMATE.start_main_~i~5 36), 28360#(<= ULTIMATE.start_main_~i~5 37), 28361#(<= ULTIMATE.start_main_~i~5 38), 28362#(<= ULTIMATE.start_main_~i~5 39), 28363#(<= ULTIMATE.start_main_~i~5 40), 28364#(<= ULTIMATE.start_main_~i~5 41), 28365#(<= ULTIMATE.start_main_~i~5 42), 28366#(<= ULTIMATE.start_main_~i~5 43), 28367#(<= ULTIMATE.start_main_~i~5 44), 28368#(<= ULTIMATE.start_main_~i~5 45), 28369#(<= ULTIMATE.start_main_~i~5 46), 28370#(<= ULTIMATE.start_main_~i~5 47), 28371#(<= ULTIMATE.start_main_~i~5 48), 28372#(<= ULTIMATE.start_main_~i~5 49), 28373#(<= ULTIMATE.start_main_~i~5 50), 28374#(<= ULTIMATE.start_main_~i~5 51), 28375#(<= ULTIMATE.start_main_~i~5 52), 28376#(<= ULTIMATE.start_main_~i~5 53), 28377#(<= ULTIMATE.start_main_~i~5 54), 28378#(<= ULTIMATE.start_main_~i~5 55), 28379#(<= ULTIMATE.start_main_~i~5 56), 28380#(<= ULTIMATE.start_main_~i~5 57), 28381#(<= ULTIMATE.start_main_~i~5 58), 28382#(<= ULTIMATE.start_main_~i~5 59), 28383#(<= ULTIMATE.start_main_~i~5 60), 28384#(<= ULTIMATE.start_main_~i~5 61), 28385#(<= ULTIMATE.start_main_~i~5 62), 28386#(<= ULTIMATE.start_main_~i~5 63), 28387#(<= ULTIMATE.start_main_~i~5 64), 28388#(<= ULTIMATE.start_main_~i~5 65), 28389#(<= ULTIMATE.start_main_~i~5 66), 28390#(<= ULTIMATE.start_main_~i~5 67), 28391#(<= ULTIMATE.start_main_~i~5 68), 28392#(<= ULTIMATE.start_main_~i~5 69), 28393#(<= ULTIMATE.start_main_~i~5 70), 28394#(<= ULTIMATE.start_main_~i~5 71), 28395#(<= ULTIMATE.start_main_~i~5 72), 28396#(<= ULTIMATE.start_main_~i~5 73), 28397#(<= ULTIMATE.start_main_~i~5 74), 28398#(<= ULTIMATE.start_main_~i~5 75), 28399#(<= ULTIMATE.start_main_~i~5 76)] [2018-07-23 13:50:23,540 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:23,541 INFO L450 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-23 13:50:23,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-23 13:50:23,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 13:50:23,543 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 79 states. [2018-07-23 13:50:23,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:23,680 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-07-23 13:50:23,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-23 13:50:23,681 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-07-23 13:50:23,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:23,682 INFO L225 Difference]: With dead ends: 161 [2018-07-23 13:50:23,682 INFO L226 Difference]: Without dead ends: 159 [2018-07-23 13:50:23,684 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 13:50:23,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-07-23 13:50:23,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-07-23 13:50:23,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-07-23 13:50:23,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-07-23 13:50:23,690 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2018-07-23 13:50:23,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:23,690 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-07-23 13:50:23,690 INFO L472 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-23 13:50:23,690 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-07-23 13:50:23,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-23 13:50:23,692 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:23,692 INFO L357 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1] [2018-07-23 13:50:23,693 INFO L414 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:23,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1703635503, now seen corresponding path program 77 times [2018-07-23 13:50:23,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:24,044 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:24,044 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:24,045 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-23 13:50:24,045 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:24,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:24,046 INFO L185 omatonBuilderFactory]: Interpolants [29056#(<= ULTIMATE.start_main_~i~5 14), 29057#(<= ULTIMATE.start_main_~i~5 15), 29058#(<= ULTIMATE.start_main_~i~5 16), 29059#(<= ULTIMATE.start_main_~i~5 17), 29060#(<= ULTIMATE.start_main_~i~5 18), 29061#(<= ULTIMATE.start_main_~i~5 19), 29062#(<= ULTIMATE.start_main_~i~5 20), 29063#(<= ULTIMATE.start_main_~i~5 21), 29064#(<= ULTIMATE.start_main_~i~5 22), 29065#(<= ULTIMATE.start_main_~i~5 23), 29066#(<= ULTIMATE.start_main_~i~5 24), 29067#(<= ULTIMATE.start_main_~i~5 25), 29068#(<= ULTIMATE.start_main_~i~5 26), 29069#(<= ULTIMATE.start_main_~i~5 27), 29070#(<= ULTIMATE.start_main_~i~5 28), 29071#(<= ULTIMATE.start_main_~i~5 29), 29072#(<= ULTIMATE.start_main_~i~5 30), 29073#(<= ULTIMATE.start_main_~i~5 31), 29074#(<= ULTIMATE.start_main_~i~5 32), 29075#(<= ULTIMATE.start_main_~i~5 33), 29076#(<= ULTIMATE.start_main_~i~5 34), 29077#(<= ULTIMATE.start_main_~i~5 35), 29078#(<= ULTIMATE.start_main_~i~5 36), 29079#(<= ULTIMATE.start_main_~i~5 37), 29080#(<= ULTIMATE.start_main_~i~5 38), 29081#(<= ULTIMATE.start_main_~i~5 39), 29082#(<= ULTIMATE.start_main_~i~5 40), 29083#(<= ULTIMATE.start_main_~i~5 41), 29084#(<= ULTIMATE.start_main_~i~5 42), 29085#(<= ULTIMATE.start_main_~i~5 43), 29086#(<= ULTIMATE.start_main_~i~5 44), 29087#(<= ULTIMATE.start_main_~i~5 45), 29088#(<= ULTIMATE.start_main_~i~5 46), 29089#(<= ULTIMATE.start_main_~i~5 47), 29090#(<= ULTIMATE.start_main_~i~5 48), 29091#(<= ULTIMATE.start_main_~i~5 49), 29092#(<= ULTIMATE.start_main_~i~5 50), 29093#(<= ULTIMATE.start_main_~i~5 51), 29094#(<= ULTIMATE.start_main_~i~5 52), 29095#(<= ULTIMATE.start_main_~i~5 53), 29096#(<= ULTIMATE.start_main_~i~5 54), 29097#(<= ULTIMATE.start_main_~i~5 55), 29098#(<= ULTIMATE.start_main_~i~5 56), 29099#(<= ULTIMATE.start_main_~i~5 57), 29100#(<= ULTIMATE.start_main_~i~5 58), 29101#(<= ULTIMATE.start_main_~i~5 59), 29102#(<= ULTIMATE.start_main_~i~5 60), 29103#(<= ULTIMATE.start_main_~i~5 61), 29104#(<= ULTIMATE.start_main_~i~5 62), 29105#(<= ULTIMATE.start_main_~i~5 63), 29106#(<= ULTIMATE.start_main_~i~5 64), 29107#(<= ULTIMATE.start_main_~i~5 65), 29108#(<= ULTIMATE.start_main_~i~5 66), 29109#(<= ULTIMATE.start_main_~i~5 67), 29110#(<= ULTIMATE.start_main_~i~5 68), 29111#(<= ULTIMATE.start_main_~i~5 69), 29112#(<= ULTIMATE.start_main_~i~5 70), 29113#(<= ULTIMATE.start_main_~i~5 71), 29114#(<= ULTIMATE.start_main_~i~5 72), 29115#(<= ULTIMATE.start_main_~i~5 73), 29116#(<= ULTIMATE.start_main_~i~5 74), 29117#(<= ULTIMATE.start_main_~i~5 75), 29118#(<= ULTIMATE.start_main_~i~5 76), 29119#(<= ULTIMATE.start_main_~i~5 77), 29040#true, 29041#false, 29042#(<= ULTIMATE.start_main_~i~5 0), 29043#(<= ULTIMATE.start_main_~i~5 1), 29044#(<= ULTIMATE.start_main_~i~5 2), 29045#(<= ULTIMATE.start_main_~i~5 3), 29046#(<= ULTIMATE.start_main_~i~5 4), 29047#(<= ULTIMATE.start_main_~i~5 5), 29048#(<= ULTIMATE.start_main_~i~5 6), 29049#(<= ULTIMATE.start_main_~i~5 7), 29050#(<= ULTIMATE.start_main_~i~5 8), 29051#(<= ULTIMATE.start_main_~i~5 9), 29052#(<= ULTIMATE.start_main_~i~5 10), 29053#(<= ULTIMATE.start_main_~i~5 11), 29054#(<= ULTIMATE.start_main_~i~5 12), 29055#(<= ULTIMATE.start_main_~i~5 13)] [2018-07-23 13:50:24,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:24,047 INFO L450 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-23 13:50:24,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-23 13:50:24,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 13:50:24,049 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 80 states. [2018-07-23 13:50:24,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:24,181 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-07-23 13:50:24,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-23 13:50:24,181 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-07-23 13:50:24,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:24,183 INFO L225 Difference]: With dead ends: 163 [2018-07-23 13:50:24,183 INFO L226 Difference]: Without dead ends: 161 [2018-07-23 13:50:24,184 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 13:50:24,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-07-23 13:50:24,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-07-23 13:50:24,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-23 13:50:24,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-07-23 13:50:24,192 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2018-07-23 13:50:24,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:24,192 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-07-23 13:50:24,193 INFO L472 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-23 13:50:24,193 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-07-23 13:50:24,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-23 13:50:24,194 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:24,195 INFO L357 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1] [2018-07-23 13:50:24,195 INFO L414 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:24,195 INFO L82 PathProgramCache]: Analyzing trace with hash -811245619, now seen corresponding path program 78 times [2018-07-23 13:50:24,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:24,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:24,570 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:24,570 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-23 13:50:24,570 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:24,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:24,571 INFO L185 omatonBuilderFactory]: Interpolants [29824#(<= ULTIMATE.start_main_~i~5 54), 29825#(<= ULTIMATE.start_main_~i~5 55), 29826#(<= ULTIMATE.start_main_~i~5 56), 29827#(<= ULTIMATE.start_main_~i~5 57), 29828#(<= ULTIMATE.start_main_~i~5 58), 29829#(<= ULTIMATE.start_main_~i~5 59), 29830#(<= ULTIMATE.start_main_~i~5 60), 29831#(<= ULTIMATE.start_main_~i~5 61), 29832#(<= ULTIMATE.start_main_~i~5 62), 29833#(<= ULTIMATE.start_main_~i~5 63), 29834#(<= ULTIMATE.start_main_~i~5 64), 29835#(<= ULTIMATE.start_main_~i~5 65), 29836#(<= ULTIMATE.start_main_~i~5 66), 29837#(<= ULTIMATE.start_main_~i~5 67), 29838#(<= ULTIMATE.start_main_~i~5 68), 29839#(<= ULTIMATE.start_main_~i~5 69), 29840#(<= ULTIMATE.start_main_~i~5 70), 29841#(<= ULTIMATE.start_main_~i~5 71), 29842#(<= ULTIMATE.start_main_~i~5 72), 29843#(<= ULTIMATE.start_main_~i~5 73), 29844#(<= ULTIMATE.start_main_~i~5 74), 29845#(<= ULTIMATE.start_main_~i~5 75), 29846#(<= ULTIMATE.start_main_~i~5 76), 29847#(<= ULTIMATE.start_main_~i~5 77), 29848#(<= ULTIMATE.start_main_~i~5 78), 29768#true, 29769#false, 29770#(<= ULTIMATE.start_main_~i~5 0), 29771#(<= ULTIMATE.start_main_~i~5 1), 29772#(<= ULTIMATE.start_main_~i~5 2), 29773#(<= ULTIMATE.start_main_~i~5 3), 29774#(<= ULTIMATE.start_main_~i~5 4), 29775#(<= ULTIMATE.start_main_~i~5 5), 29776#(<= ULTIMATE.start_main_~i~5 6), 29777#(<= ULTIMATE.start_main_~i~5 7), 29778#(<= ULTIMATE.start_main_~i~5 8), 29779#(<= ULTIMATE.start_main_~i~5 9), 29780#(<= ULTIMATE.start_main_~i~5 10), 29781#(<= ULTIMATE.start_main_~i~5 11), 29782#(<= ULTIMATE.start_main_~i~5 12), 29783#(<= ULTIMATE.start_main_~i~5 13), 29784#(<= ULTIMATE.start_main_~i~5 14), 29785#(<= ULTIMATE.start_main_~i~5 15), 29786#(<= ULTIMATE.start_main_~i~5 16), 29787#(<= ULTIMATE.start_main_~i~5 17), 29788#(<= ULTIMATE.start_main_~i~5 18), 29789#(<= ULTIMATE.start_main_~i~5 19), 29790#(<= ULTIMATE.start_main_~i~5 20), 29791#(<= ULTIMATE.start_main_~i~5 21), 29792#(<= ULTIMATE.start_main_~i~5 22), 29793#(<= ULTIMATE.start_main_~i~5 23), 29794#(<= ULTIMATE.start_main_~i~5 24), 29795#(<= ULTIMATE.start_main_~i~5 25), 29796#(<= ULTIMATE.start_main_~i~5 26), 29797#(<= ULTIMATE.start_main_~i~5 27), 29798#(<= ULTIMATE.start_main_~i~5 28), 29799#(<= ULTIMATE.start_main_~i~5 29), 29800#(<= ULTIMATE.start_main_~i~5 30), 29801#(<= ULTIMATE.start_main_~i~5 31), 29802#(<= ULTIMATE.start_main_~i~5 32), 29803#(<= ULTIMATE.start_main_~i~5 33), 29804#(<= ULTIMATE.start_main_~i~5 34), 29805#(<= ULTIMATE.start_main_~i~5 35), 29806#(<= ULTIMATE.start_main_~i~5 36), 29807#(<= ULTIMATE.start_main_~i~5 37), 29808#(<= ULTIMATE.start_main_~i~5 38), 29809#(<= ULTIMATE.start_main_~i~5 39), 29810#(<= ULTIMATE.start_main_~i~5 40), 29811#(<= ULTIMATE.start_main_~i~5 41), 29812#(<= ULTIMATE.start_main_~i~5 42), 29813#(<= ULTIMATE.start_main_~i~5 43), 29814#(<= ULTIMATE.start_main_~i~5 44), 29815#(<= ULTIMATE.start_main_~i~5 45), 29816#(<= ULTIMATE.start_main_~i~5 46), 29817#(<= ULTIMATE.start_main_~i~5 47), 29818#(<= ULTIMATE.start_main_~i~5 48), 29819#(<= ULTIMATE.start_main_~i~5 49), 29820#(<= ULTIMATE.start_main_~i~5 50), 29821#(<= ULTIMATE.start_main_~i~5 51), 29822#(<= ULTIMATE.start_main_~i~5 52), 29823#(<= ULTIMATE.start_main_~i~5 53)] [2018-07-23 13:50:24,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:24,572 INFO L450 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-23 13:50:24,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-23 13:50:24,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 13:50:24,573 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 81 states. [2018-07-23 13:50:24,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:24,641 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-07-23 13:50:24,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-23 13:50:24,641 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-07-23 13:50:24,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:24,643 INFO L225 Difference]: With dead ends: 165 [2018-07-23 13:50:24,643 INFO L226 Difference]: Without dead ends: 163 [2018-07-23 13:50:24,643 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 13:50:24,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-23 13:50:24,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-07-23 13:50:24,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-23 13:50:24,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-07-23 13:50:24,649 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2018-07-23 13:50:24,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:24,649 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-07-23 13:50:24,649 INFO L472 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-23 13:50:24,649 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-07-23 13:50:24,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-07-23 13:50:24,651 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:24,651 INFO L357 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1] [2018-07-23 13:50:24,651 INFO L414 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:24,651 INFO L82 PathProgramCache]: Analyzing trace with hash 2076941001, now seen corresponding path program 79 times [2018-07-23 13:50:24,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:24,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:24,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:24,978 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:24,978 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-23 13:50:24,979 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:24,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:24,979 INFO L185 omatonBuilderFactory]: Interpolants [30505#true, 30506#false, 30507#(<= ULTIMATE.start_main_~i~5 0), 30508#(<= ULTIMATE.start_main_~i~5 1), 30509#(<= ULTIMATE.start_main_~i~5 2), 30510#(<= ULTIMATE.start_main_~i~5 3), 30511#(<= ULTIMATE.start_main_~i~5 4), 30512#(<= ULTIMATE.start_main_~i~5 5), 30513#(<= ULTIMATE.start_main_~i~5 6), 30514#(<= ULTIMATE.start_main_~i~5 7), 30515#(<= ULTIMATE.start_main_~i~5 8), 30516#(<= ULTIMATE.start_main_~i~5 9), 30517#(<= ULTIMATE.start_main_~i~5 10), 30518#(<= ULTIMATE.start_main_~i~5 11), 30519#(<= ULTIMATE.start_main_~i~5 12), 30520#(<= ULTIMATE.start_main_~i~5 13), 30521#(<= ULTIMATE.start_main_~i~5 14), 30522#(<= ULTIMATE.start_main_~i~5 15), 30523#(<= ULTIMATE.start_main_~i~5 16), 30524#(<= ULTIMATE.start_main_~i~5 17), 30525#(<= ULTIMATE.start_main_~i~5 18), 30526#(<= ULTIMATE.start_main_~i~5 19), 30527#(<= ULTIMATE.start_main_~i~5 20), 30528#(<= ULTIMATE.start_main_~i~5 21), 30529#(<= ULTIMATE.start_main_~i~5 22), 30530#(<= ULTIMATE.start_main_~i~5 23), 30531#(<= ULTIMATE.start_main_~i~5 24), 30532#(<= ULTIMATE.start_main_~i~5 25), 30533#(<= ULTIMATE.start_main_~i~5 26), 30534#(<= ULTIMATE.start_main_~i~5 27), 30535#(<= ULTIMATE.start_main_~i~5 28), 30536#(<= ULTIMATE.start_main_~i~5 29), 30537#(<= ULTIMATE.start_main_~i~5 30), 30538#(<= ULTIMATE.start_main_~i~5 31), 30539#(<= ULTIMATE.start_main_~i~5 32), 30540#(<= ULTIMATE.start_main_~i~5 33), 30541#(<= ULTIMATE.start_main_~i~5 34), 30542#(<= ULTIMATE.start_main_~i~5 35), 30543#(<= ULTIMATE.start_main_~i~5 36), 30544#(<= ULTIMATE.start_main_~i~5 37), 30545#(<= ULTIMATE.start_main_~i~5 38), 30546#(<= ULTIMATE.start_main_~i~5 39), 30547#(<= ULTIMATE.start_main_~i~5 40), 30548#(<= ULTIMATE.start_main_~i~5 41), 30549#(<= ULTIMATE.start_main_~i~5 42), 30550#(<= ULTIMATE.start_main_~i~5 43), 30551#(<= ULTIMATE.start_main_~i~5 44), 30552#(<= ULTIMATE.start_main_~i~5 45), 30553#(<= ULTIMATE.start_main_~i~5 46), 30554#(<= ULTIMATE.start_main_~i~5 47), 30555#(<= ULTIMATE.start_main_~i~5 48), 30556#(<= ULTIMATE.start_main_~i~5 49), 30557#(<= ULTIMATE.start_main_~i~5 50), 30558#(<= ULTIMATE.start_main_~i~5 51), 30559#(<= ULTIMATE.start_main_~i~5 52), 30560#(<= ULTIMATE.start_main_~i~5 53), 30561#(<= ULTIMATE.start_main_~i~5 54), 30562#(<= ULTIMATE.start_main_~i~5 55), 30563#(<= ULTIMATE.start_main_~i~5 56), 30564#(<= ULTIMATE.start_main_~i~5 57), 30565#(<= ULTIMATE.start_main_~i~5 58), 30566#(<= ULTIMATE.start_main_~i~5 59), 30567#(<= ULTIMATE.start_main_~i~5 60), 30568#(<= ULTIMATE.start_main_~i~5 61), 30569#(<= ULTIMATE.start_main_~i~5 62), 30570#(<= ULTIMATE.start_main_~i~5 63), 30571#(<= ULTIMATE.start_main_~i~5 64), 30572#(<= ULTIMATE.start_main_~i~5 65), 30573#(<= ULTIMATE.start_main_~i~5 66), 30574#(<= ULTIMATE.start_main_~i~5 67), 30575#(<= ULTIMATE.start_main_~i~5 68), 30576#(<= ULTIMATE.start_main_~i~5 69), 30577#(<= ULTIMATE.start_main_~i~5 70), 30578#(<= ULTIMATE.start_main_~i~5 71), 30579#(<= ULTIMATE.start_main_~i~5 72), 30580#(<= ULTIMATE.start_main_~i~5 73), 30581#(<= ULTIMATE.start_main_~i~5 74), 30582#(<= ULTIMATE.start_main_~i~5 75), 30583#(<= ULTIMATE.start_main_~i~5 76), 30584#(<= ULTIMATE.start_main_~i~5 77), 30585#(<= ULTIMATE.start_main_~i~5 78), 30586#(<= ULTIMATE.start_main_~i~5 79)] [2018-07-23 13:50:24,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:24,981 INFO L450 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-23 13:50:24,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-23 13:50:24,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 13:50:24,983 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 82 states. [2018-07-23 13:50:25,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:25,124 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-07-23 13:50:25,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-23 13:50:25,124 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2018-07-23 13:50:25,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:25,125 INFO L225 Difference]: With dead ends: 167 [2018-07-23 13:50:25,126 INFO L226 Difference]: Without dead ends: 165 [2018-07-23 13:50:25,127 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 13:50:25,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-07-23 13:50:25,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-07-23 13:50:25,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-07-23 13:50:25,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-07-23 13:50:25,132 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2018-07-23 13:50:25,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:25,132 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-07-23 13:50:25,132 INFO L472 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-23 13:50:25,132 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-07-23 13:50:25,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-23 13:50:25,134 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:25,134 INFO L357 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1] [2018-07-23 13:50:25,134 INFO L414 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:25,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1219557691, now seen corresponding path program 80 times [2018-07-23 13:50:25,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:25,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:25,459 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:25,460 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-23 13:50:25,460 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:25,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:25,461 INFO L185 omatonBuilderFactory]: Interpolants [31251#true, 31252#false, 31253#(<= ULTIMATE.start_main_~i~5 0), 31254#(<= ULTIMATE.start_main_~i~5 1), 31255#(<= ULTIMATE.start_main_~i~5 2), 31256#(<= ULTIMATE.start_main_~i~5 3), 31257#(<= ULTIMATE.start_main_~i~5 4), 31258#(<= ULTIMATE.start_main_~i~5 5), 31259#(<= ULTIMATE.start_main_~i~5 6), 31260#(<= ULTIMATE.start_main_~i~5 7), 31261#(<= ULTIMATE.start_main_~i~5 8), 31262#(<= ULTIMATE.start_main_~i~5 9), 31263#(<= ULTIMATE.start_main_~i~5 10), 31264#(<= ULTIMATE.start_main_~i~5 11), 31265#(<= ULTIMATE.start_main_~i~5 12), 31266#(<= ULTIMATE.start_main_~i~5 13), 31267#(<= ULTIMATE.start_main_~i~5 14), 31268#(<= ULTIMATE.start_main_~i~5 15), 31269#(<= ULTIMATE.start_main_~i~5 16), 31270#(<= ULTIMATE.start_main_~i~5 17), 31271#(<= ULTIMATE.start_main_~i~5 18), 31272#(<= ULTIMATE.start_main_~i~5 19), 31273#(<= ULTIMATE.start_main_~i~5 20), 31274#(<= ULTIMATE.start_main_~i~5 21), 31275#(<= ULTIMATE.start_main_~i~5 22), 31276#(<= ULTIMATE.start_main_~i~5 23), 31277#(<= ULTIMATE.start_main_~i~5 24), 31278#(<= ULTIMATE.start_main_~i~5 25), 31279#(<= ULTIMATE.start_main_~i~5 26), 31280#(<= ULTIMATE.start_main_~i~5 27), 31281#(<= ULTIMATE.start_main_~i~5 28), 31282#(<= ULTIMATE.start_main_~i~5 29), 31283#(<= ULTIMATE.start_main_~i~5 30), 31284#(<= ULTIMATE.start_main_~i~5 31), 31285#(<= ULTIMATE.start_main_~i~5 32), 31286#(<= ULTIMATE.start_main_~i~5 33), 31287#(<= ULTIMATE.start_main_~i~5 34), 31288#(<= ULTIMATE.start_main_~i~5 35), 31289#(<= ULTIMATE.start_main_~i~5 36), 31290#(<= ULTIMATE.start_main_~i~5 37), 31291#(<= ULTIMATE.start_main_~i~5 38), 31292#(<= ULTIMATE.start_main_~i~5 39), 31293#(<= ULTIMATE.start_main_~i~5 40), 31294#(<= ULTIMATE.start_main_~i~5 41), 31295#(<= ULTIMATE.start_main_~i~5 42), 31296#(<= ULTIMATE.start_main_~i~5 43), 31297#(<= ULTIMATE.start_main_~i~5 44), 31298#(<= ULTIMATE.start_main_~i~5 45), 31299#(<= ULTIMATE.start_main_~i~5 46), 31300#(<= ULTIMATE.start_main_~i~5 47), 31301#(<= ULTIMATE.start_main_~i~5 48), 31302#(<= ULTIMATE.start_main_~i~5 49), 31303#(<= ULTIMATE.start_main_~i~5 50), 31304#(<= ULTIMATE.start_main_~i~5 51), 31305#(<= ULTIMATE.start_main_~i~5 52), 31306#(<= ULTIMATE.start_main_~i~5 53), 31307#(<= ULTIMATE.start_main_~i~5 54), 31308#(<= ULTIMATE.start_main_~i~5 55), 31309#(<= ULTIMATE.start_main_~i~5 56), 31310#(<= ULTIMATE.start_main_~i~5 57), 31311#(<= ULTIMATE.start_main_~i~5 58), 31312#(<= ULTIMATE.start_main_~i~5 59), 31313#(<= ULTIMATE.start_main_~i~5 60), 31314#(<= ULTIMATE.start_main_~i~5 61), 31315#(<= ULTIMATE.start_main_~i~5 62), 31316#(<= ULTIMATE.start_main_~i~5 63), 31317#(<= ULTIMATE.start_main_~i~5 64), 31318#(<= ULTIMATE.start_main_~i~5 65), 31319#(<= ULTIMATE.start_main_~i~5 66), 31320#(<= ULTIMATE.start_main_~i~5 67), 31321#(<= ULTIMATE.start_main_~i~5 68), 31322#(<= ULTIMATE.start_main_~i~5 69), 31323#(<= ULTIMATE.start_main_~i~5 70), 31324#(<= ULTIMATE.start_main_~i~5 71), 31325#(<= ULTIMATE.start_main_~i~5 72), 31326#(<= ULTIMATE.start_main_~i~5 73), 31327#(<= ULTIMATE.start_main_~i~5 74), 31328#(<= ULTIMATE.start_main_~i~5 75), 31329#(<= ULTIMATE.start_main_~i~5 76), 31330#(<= ULTIMATE.start_main_~i~5 77), 31331#(<= ULTIMATE.start_main_~i~5 78), 31332#(<= ULTIMATE.start_main_~i~5 79), 31333#(<= ULTIMATE.start_main_~i~5 80)] [2018-07-23 13:50:25,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:25,462 INFO L450 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-23 13:50:25,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-23 13:50:25,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 13:50:25,464 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 83 states. [2018-07-23 13:50:25,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:25,616 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-07-23 13:50:25,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-23 13:50:25,616 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2018-07-23 13:50:25,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:25,618 INFO L225 Difference]: With dead ends: 169 [2018-07-23 13:50:25,618 INFO L226 Difference]: Without dead ends: 167 [2018-07-23 13:50:25,619 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 13:50:25,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-23 13:50:25,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-07-23 13:50:25,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-07-23 13:50:25,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-07-23 13:50:25,624 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2018-07-23 13:50:25,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:25,625 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-07-23 13:50:25,625 INFO L472 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-23 13:50:25,625 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-07-23 13:50:25,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-07-23 13:50:25,627 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:25,627 INFO L357 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1] [2018-07-23 13:50:25,627 INFO L414 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:25,627 INFO L82 PathProgramCache]: Analyzing trace with hash 531063745, now seen corresponding path program 81 times [2018-07-23 13:50:25,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:25,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:25,965 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:25,966 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-23 13:50:25,966 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:25,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:25,966 INFO L185 omatonBuilderFactory]: Interpolants [32006#true, 32007#false, 32008#(<= ULTIMATE.start_main_~i~5 0), 32009#(<= ULTIMATE.start_main_~i~5 1), 32010#(<= ULTIMATE.start_main_~i~5 2), 32011#(<= ULTIMATE.start_main_~i~5 3), 32012#(<= ULTIMATE.start_main_~i~5 4), 32013#(<= ULTIMATE.start_main_~i~5 5), 32014#(<= ULTIMATE.start_main_~i~5 6), 32015#(<= ULTIMATE.start_main_~i~5 7), 32016#(<= ULTIMATE.start_main_~i~5 8), 32017#(<= ULTIMATE.start_main_~i~5 9), 32018#(<= ULTIMATE.start_main_~i~5 10), 32019#(<= ULTIMATE.start_main_~i~5 11), 32020#(<= ULTIMATE.start_main_~i~5 12), 32021#(<= ULTIMATE.start_main_~i~5 13), 32022#(<= ULTIMATE.start_main_~i~5 14), 32023#(<= ULTIMATE.start_main_~i~5 15), 32024#(<= ULTIMATE.start_main_~i~5 16), 32025#(<= ULTIMATE.start_main_~i~5 17), 32026#(<= ULTIMATE.start_main_~i~5 18), 32027#(<= ULTIMATE.start_main_~i~5 19), 32028#(<= ULTIMATE.start_main_~i~5 20), 32029#(<= ULTIMATE.start_main_~i~5 21), 32030#(<= ULTIMATE.start_main_~i~5 22), 32031#(<= ULTIMATE.start_main_~i~5 23), 32032#(<= ULTIMATE.start_main_~i~5 24), 32033#(<= ULTIMATE.start_main_~i~5 25), 32034#(<= ULTIMATE.start_main_~i~5 26), 32035#(<= ULTIMATE.start_main_~i~5 27), 32036#(<= ULTIMATE.start_main_~i~5 28), 32037#(<= ULTIMATE.start_main_~i~5 29), 32038#(<= ULTIMATE.start_main_~i~5 30), 32039#(<= ULTIMATE.start_main_~i~5 31), 32040#(<= ULTIMATE.start_main_~i~5 32), 32041#(<= ULTIMATE.start_main_~i~5 33), 32042#(<= ULTIMATE.start_main_~i~5 34), 32043#(<= ULTIMATE.start_main_~i~5 35), 32044#(<= ULTIMATE.start_main_~i~5 36), 32045#(<= ULTIMATE.start_main_~i~5 37), 32046#(<= ULTIMATE.start_main_~i~5 38), 32047#(<= ULTIMATE.start_main_~i~5 39), 32048#(<= ULTIMATE.start_main_~i~5 40), 32049#(<= ULTIMATE.start_main_~i~5 41), 32050#(<= ULTIMATE.start_main_~i~5 42), 32051#(<= ULTIMATE.start_main_~i~5 43), 32052#(<= ULTIMATE.start_main_~i~5 44), 32053#(<= ULTIMATE.start_main_~i~5 45), 32054#(<= ULTIMATE.start_main_~i~5 46), 32055#(<= ULTIMATE.start_main_~i~5 47), 32056#(<= ULTIMATE.start_main_~i~5 48), 32057#(<= ULTIMATE.start_main_~i~5 49), 32058#(<= ULTIMATE.start_main_~i~5 50), 32059#(<= ULTIMATE.start_main_~i~5 51), 32060#(<= ULTIMATE.start_main_~i~5 52), 32061#(<= ULTIMATE.start_main_~i~5 53), 32062#(<= ULTIMATE.start_main_~i~5 54), 32063#(<= ULTIMATE.start_main_~i~5 55), 32064#(<= ULTIMATE.start_main_~i~5 56), 32065#(<= ULTIMATE.start_main_~i~5 57), 32066#(<= ULTIMATE.start_main_~i~5 58), 32067#(<= ULTIMATE.start_main_~i~5 59), 32068#(<= ULTIMATE.start_main_~i~5 60), 32069#(<= ULTIMATE.start_main_~i~5 61), 32070#(<= ULTIMATE.start_main_~i~5 62), 32071#(<= ULTIMATE.start_main_~i~5 63), 32072#(<= ULTIMATE.start_main_~i~5 64), 32073#(<= ULTIMATE.start_main_~i~5 65), 32074#(<= ULTIMATE.start_main_~i~5 66), 32075#(<= ULTIMATE.start_main_~i~5 67), 32076#(<= ULTIMATE.start_main_~i~5 68), 32077#(<= ULTIMATE.start_main_~i~5 69), 32078#(<= ULTIMATE.start_main_~i~5 70), 32079#(<= ULTIMATE.start_main_~i~5 71), 32080#(<= ULTIMATE.start_main_~i~5 72), 32081#(<= ULTIMATE.start_main_~i~5 73), 32082#(<= ULTIMATE.start_main_~i~5 74), 32083#(<= ULTIMATE.start_main_~i~5 75), 32084#(<= ULTIMATE.start_main_~i~5 76), 32085#(<= ULTIMATE.start_main_~i~5 77), 32086#(<= ULTIMATE.start_main_~i~5 78), 32087#(<= ULTIMATE.start_main_~i~5 79), 32088#(<= ULTIMATE.start_main_~i~5 80), 32089#(<= ULTIMATE.start_main_~i~5 81)] [2018-07-23 13:50:25,967 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:25,967 INFO L450 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-23 13:50:25,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-23 13:50:25,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 13:50:25,969 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 84 states. [2018-07-23 13:50:26,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:26,128 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-07-23 13:50:26,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-23 13:50:26,128 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2018-07-23 13:50:26,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:26,130 INFO L225 Difference]: With dead ends: 171 [2018-07-23 13:50:26,130 INFO L226 Difference]: Without dead ends: 169 [2018-07-23 13:50:26,130 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 13:50:26,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-07-23 13:50:26,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-07-23 13:50:26,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-07-23 13:50:26,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-07-23 13:50:26,135 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2018-07-23 13:50:26,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:26,135 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-07-23 13:50:26,136 INFO L472 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-23 13:50:26,136 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-07-23 13:50:26,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-07-23 13:50:26,137 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:26,138 INFO L357 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1] [2018-07-23 13:50:26,138 INFO L414 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:26,138 INFO L82 PathProgramCache]: Analyzing trace with hash -748916291, now seen corresponding path program 82 times [2018-07-23 13:50:26,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:26,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:26,496 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:26,496 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-23 13:50:26,496 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:26,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:26,497 INFO L185 omatonBuilderFactory]: Interpolants [32770#true, 32771#false, 32772#(<= ULTIMATE.start_main_~i~5 0), 32773#(<= ULTIMATE.start_main_~i~5 1), 32774#(<= ULTIMATE.start_main_~i~5 2), 32775#(<= ULTIMATE.start_main_~i~5 3), 32776#(<= ULTIMATE.start_main_~i~5 4), 32777#(<= ULTIMATE.start_main_~i~5 5), 32778#(<= ULTIMATE.start_main_~i~5 6), 32779#(<= ULTIMATE.start_main_~i~5 7), 32780#(<= ULTIMATE.start_main_~i~5 8), 32781#(<= ULTIMATE.start_main_~i~5 9), 32782#(<= ULTIMATE.start_main_~i~5 10), 32783#(<= ULTIMATE.start_main_~i~5 11), 32784#(<= ULTIMATE.start_main_~i~5 12), 32785#(<= ULTIMATE.start_main_~i~5 13), 32786#(<= ULTIMATE.start_main_~i~5 14), 32787#(<= ULTIMATE.start_main_~i~5 15), 32788#(<= ULTIMATE.start_main_~i~5 16), 32789#(<= ULTIMATE.start_main_~i~5 17), 32790#(<= ULTIMATE.start_main_~i~5 18), 32791#(<= ULTIMATE.start_main_~i~5 19), 32792#(<= ULTIMATE.start_main_~i~5 20), 32793#(<= ULTIMATE.start_main_~i~5 21), 32794#(<= ULTIMATE.start_main_~i~5 22), 32795#(<= ULTIMATE.start_main_~i~5 23), 32796#(<= ULTIMATE.start_main_~i~5 24), 32797#(<= ULTIMATE.start_main_~i~5 25), 32798#(<= ULTIMATE.start_main_~i~5 26), 32799#(<= ULTIMATE.start_main_~i~5 27), 32800#(<= ULTIMATE.start_main_~i~5 28), 32801#(<= ULTIMATE.start_main_~i~5 29), 32802#(<= ULTIMATE.start_main_~i~5 30), 32803#(<= ULTIMATE.start_main_~i~5 31), 32804#(<= ULTIMATE.start_main_~i~5 32), 32805#(<= ULTIMATE.start_main_~i~5 33), 32806#(<= ULTIMATE.start_main_~i~5 34), 32807#(<= ULTIMATE.start_main_~i~5 35), 32808#(<= ULTIMATE.start_main_~i~5 36), 32809#(<= ULTIMATE.start_main_~i~5 37), 32810#(<= ULTIMATE.start_main_~i~5 38), 32811#(<= ULTIMATE.start_main_~i~5 39), 32812#(<= ULTIMATE.start_main_~i~5 40), 32813#(<= ULTIMATE.start_main_~i~5 41), 32814#(<= ULTIMATE.start_main_~i~5 42), 32815#(<= ULTIMATE.start_main_~i~5 43), 32816#(<= ULTIMATE.start_main_~i~5 44), 32817#(<= ULTIMATE.start_main_~i~5 45), 32818#(<= ULTIMATE.start_main_~i~5 46), 32819#(<= ULTIMATE.start_main_~i~5 47), 32820#(<= ULTIMATE.start_main_~i~5 48), 32821#(<= ULTIMATE.start_main_~i~5 49), 32822#(<= ULTIMATE.start_main_~i~5 50), 32823#(<= ULTIMATE.start_main_~i~5 51), 32824#(<= ULTIMATE.start_main_~i~5 52), 32825#(<= ULTIMATE.start_main_~i~5 53), 32826#(<= ULTIMATE.start_main_~i~5 54), 32827#(<= ULTIMATE.start_main_~i~5 55), 32828#(<= ULTIMATE.start_main_~i~5 56), 32829#(<= ULTIMATE.start_main_~i~5 57), 32830#(<= ULTIMATE.start_main_~i~5 58), 32831#(<= ULTIMATE.start_main_~i~5 59), 32832#(<= ULTIMATE.start_main_~i~5 60), 32833#(<= ULTIMATE.start_main_~i~5 61), 32834#(<= ULTIMATE.start_main_~i~5 62), 32835#(<= ULTIMATE.start_main_~i~5 63), 32836#(<= ULTIMATE.start_main_~i~5 64), 32837#(<= ULTIMATE.start_main_~i~5 65), 32838#(<= ULTIMATE.start_main_~i~5 66), 32839#(<= ULTIMATE.start_main_~i~5 67), 32840#(<= ULTIMATE.start_main_~i~5 68), 32841#(<= ULTIMATE.start_main_~i~5 69), 32842#(<= ULTIMATE.start_main_~i~5 70), 32843#(<= ULTIMATE.start_main_~i~5 71), 32844#(<= ULTIMATE.start_main_~i~5 72), 32845#(<= ULTIMATE.start_main_~i~5 73), 32846#(<= ULTIMATE.start_main_~i~5 74), 32847#(<= ULTIMATE.start_main_~i~5 75), 32848#(<= ULTIMATE.start_main_~i~5 76), 32849#(<= ULTIMATE.start_main_~i~5 77), 32850#(<= ULTIMATE.start_main_~i~5 78), 32851#(<= ULTIMATE.start_main_~i~5 79), 32852#(<= ULTIMATE.start_main_~i~5 80), 32853#(<= ULTIMATE.start_main_~i~5 81), 32854#(<= ULTIMATE.start_main_~i~5 82)] [2018-07-23 13:50:26,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:26,498 INFO L450 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-23 13:50:26,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-23 13:50:26,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 13:50:26,500 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 85 states. [2018-07-23 13:50:26,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:26,694 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-07-23 13:50:26,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-23 13:50:26,695 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2018-07-23 13:50:26,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:26,696 INFO L225 Difference]: With dead ends: 173 [2018-07-23 13:50:26,696 INFO L226 Difference]: Without dead ends: 171 [2018-07-23 13:50:26,697 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 13:50:26,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-07-23 13:50:26,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-07-23 13:50:26,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-07-23 13:50:26,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-07-23 13:50:26,702 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2018-07-23 13:50:26,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:26,702 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-07-23 13:50:26,702 INFO L472 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-23 13:50:26,702 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-07-23 13:50:26,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-07-23 13:50:26,704 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:26,704 INFO L357 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1] [2018-07-23 13:50:26,704 INFO L414 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:26,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1845883065, now seen corresponding path program 83 times [2018-07-23 13:50:26,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:27,086 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:27,086 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-23 13:50:27,086 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:27,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:27,087 INFO L185 omatonBuilderFactory]: Interpolants [33543#true, 33544#false, 33545#(<= ULTIMATE.start_main_~i~5 0), 33546#(<= ULTIMATE.start_main_~i~5 1), 33547#(<= ULTIMATE.start_main_~i~5 2), 33548#(<= ULTIMATE.start_main_~i~5 3), 33549#(<= ULTIMATE.start_main_~i~5 4), 33550#(<= ULTIMATE.start_main_~i~5 5), 33551#(<= ULTIMATE.start_main_~i~5 6), 33552#(<= ULTIMATE.start_main_~i~5 7), 33553#(<= ULTIMATE.start_main_~i~5 8), 33554#(<= ULTIMATE.start_main_~i~5 9), 33555#(<= ULTIMATE.start_main_~i~5 10), 33556#(<= ULTIMATE.start_main_~i~5 11), 33557#(<= ULTIMATE.start_main_~i~5 12), 33558#(<= ULTIMATE.start_main_~i~5 13), 33559#(<= ULTIMATE.start_main_~i~5 14), 33560#(<= ULTIMATE.start_main_~i~5 15), 33561#(<= ULTIMATE.start_main_~i~5 16), 33562#(<= ULTIMATE.start_main_~i~5 17), 33563#(<= ULTIMATE.start_main_~i~5 18), 33564#(<= ULTIMATE.start_main_~i~5 19), 33565#(<= ULTIMATE.start_main_~i~5 20), 33566#(<= ULTIMATE.start_main_~i~5 21), 33567#(<= ULTIMATE.start_main_~i~5 22), 33568#(<= ULTIMATE.start_main_~i~5 23), 33569#(<= ULTIMATE.start_main_~i~5 24), 33570#(<= ULTIMATE.start_main_~i~5 25), 33571#(<= ULTIMATE.start_main_~i~5 26), 33572#(<= ULTIMATE.start_main_~i~5 27), 33573#(<= ULTIMATE.start_main_~i~5 28), 33574#(<= ULTIMATE.start_main_~i~5 29), 33575#(<= ULTIMATE.start_main_~i~5 30), 33576#(<= ULTIMATE.start_main_~i~5 31), 33577#(<= ULTIMATE.start_main_~i~5 32), 33578#(<= ULTIMATE.start_main_~i~5 33), 33579#(<= ULTIMATE.start_main_~i~5 34), 33580#(<= ULTIMATE.start_main_~i~5 35), 33581#(<= ULTIMATE.start_main_~i~5 36), 33582#(<= ULTIMATE.start_main_~i~5 37), 33583#(<= ULTIMATE.start_main_~i~5 38), 33584#(<= ULTIMATE.start_main_~i~5 39), 33585#(<= ULTIMATE.start_main_~i~5 40), 33586#(<= ULTIMATE.start_main_~i~5 41), 33587#(<= ULTIMATE.start_main_~i~5 42), 33588#(<= ULTIMATE.start_main_~i~5 43), 33589#(<= ULTIMATE.start_main_~i~5 44), 33590#(<= ULTIMATE.start_main_~i~5 45), 33591#(<= ULTIMATE.start_main_~i~5 46), 33592#(<= ULTIMATE.start_main_~i~5 47), 33593#(<= ULTIMATE.start_main_~i~5 48), 33594#(<= ULTIMATE.start_main_~i~5 49), 33595#(<= ULTIMATE.start_main_~i~5 50), 33596#(<= ULTIMATE.start_main_~i~5 51), 33597#(<= ULTIMATE.start_main_~i~5 52), 33598#(<= ULTIMATE.start_main_~i~5 53), 33599#(<= ULTIMATE.start_main_~i~5 54), 33600#(<= ULTIMATE.start_main_~i~5 55), 33601#(<= ULTIMATE.start_main_~i~5 56), 33602#(<= ULTIMATE.start_main_~i~5 57), 33603#(<= ULTIMATE.start_main_~i~5 58), 33604#(<= ULTIMATE.start_main_~i~5 59), 33605#(<= ULTIMATE.start_main_~i~5 60), 33606#(<= ULTIMATE.start_main_~i~5 61), 33607#(<= ULTIMATE.start_main_~i~5 62), 33608#(<= ULTIMATE.start_main_~i~5 63), 33609#(<= ULTIMATE.start_main_~i~5 64), 33610#(<= ULTIMATE.start_main_~i~5 65), 33611#(<= ULTIMATE.start_main_~i~5 66), 33612#(<= ULTIMATE.start_main_~i~5 67), 33613#(<= ULTIMATE.start_main_~i~5 68), 33614#(<= ULTIMATE.start_main_~i~5 69), 33615#(<= ULTIMATE.start_main_~i~5 70), 33616#(<= ULTIMATE.start_main_~i~5 71), 33617#(<= ULTIMATE.start_main_~i~5 72), 33618#(<= ULTIMATE.start_main_~i~5 73), 33619#(<= ULTIMATE.start_main_~i~5 74), 33620#(<= ULTIMATE.start_main_~i~5 75), 33621#(<= ULTIMATE.start_main_~i~5 76), 33622#(<= ULTIMATE.start_main_~i~5 77), 33623#(<= ULTIMATE.start_main_~i~5 78), 33624#(<= ULTIMATE.start_main_~i~5 79), 33625#(<= ULTIMATE.start_main_~i~5 80), 33626#(<= ULTIMATE.start_main_~i~5 81), 33627#(<= ULTIMATE.start_main_~i~5 82), 33628#(<= ULTIMATE.start_main_~i~5 83)] [2018-07-23 13:50:27,088 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:27,088 INFO L450 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-23 13:50:27,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-23 13:50:27,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 13:50:27,090 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 86 states. [2018-07-23 13:50:27,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:27,272 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-07-23 13:50:27,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-23 13:50:27,272 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2018-07-23 13:50:27,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:27,273 INFO L225 Difference]: With dead ends: 175 [2018-07-23 13:50:27,273 INFO L226 Difference]: Without dead ends: 173 [2018-07-23 13:50:27,274 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 13:50:27,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-07-23 13:50:27,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-07-23 13:50:27,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-23 13:50:27,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-07-23 13:50:27,279 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2018-07-23 13:50:27,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:27,279 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-07-23 13:50:27,279 INFO L472 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-23 13:50:27,280 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-07-23 13:50:27,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-07-23 13:50:27,281 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:27,281 INFO L357 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1] [2018-07-23 13:50:27,281 INFO L414 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:27,282 INFO L82 PathProgramCache]: Analyzing trace with hash 72065205, now seen corresponding path program 84 times [2018-07-23 13:50:27,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:27,708 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:27,708 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:27,708 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-23 13:50:27,709 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:27,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:27,709 INFO L185 omatonBuilderFactory]: Interpolants [34325#true, 34326#false, 34327#(<= ULTIMATE.start_main_~i~5 0), 34328#(<= ULTIMATE.start_main_~i~5 1), 34329#(<= ULTIMATE.start_main_~i~5 2), 34330#(<= ULTIMATE.start_main_~i~5 3), 34331#(<= ULTIMATE.start_main_~i~5 4), 34332#(<= ULTIMATE.start_main_~i~5 5), 34333#(<= ULTIMATE.start_main_~i~5 6), 34334#(<= ULTIMATE.start_main_~i~5 7), 34335#(<= ULTIMATE.start_main_~i~5 8), 34336#(<= ULTIMATE.start_main_~i~5 9), 34337#(<= ULTIMATE.start_main_~i~5 10), 34338#(<= ULTIMATE.start_main_~i~5 11), 34339#(<= ULTIMATE.start_main_~i~5 12), 34340#(<= ULTIMATE.start_main_~i~5 13), 34341#(<= ULTIMATE.start_main_~i~5 14), 34342#(<= ULTIMATE.start_main_~i~5 15), 34343#(<= ULTIMATE.start_main_~i~5 16), 34344#(<= ULTIMATE.start_main_~i~5 17), 34345#(<= ULTIMATE.start_main_~i~5 18), 34346#(<= ULTIMATE.start_main_~i~5 19), 34347#(<= ULTIMATE.start_main_~i~5 20), 34348#(<= ULTIMATE.start_main_~i~5 21), 34349#(<= ULTIMATE.start_main_~i~5 22), 34350#(<= ULTIMATE.start_main_~i~5 23), 34351#(<= ULTIMATE.start_main_~i~5 24), 34352#(<= ULTIMATE.start_main_~i~5 25), 34353#(<= ULTIMATE.start_main_~i~5 26), 34354#(<= ULTIMATE.start_main_~i~5 27), 34355#(<= ULTIMATE.start_main_~i~5 28), 34356#(<= ULTIMATE.start_main_~i~5 29), 34357#(<= ULTIMATE.start_main_~i~5 30), 34358#(<= ULTIMATE.start_main_~i~5 31), 34359#(<= ULTIMATE.start_main_~i~5 32), 34360#(<= ULTIMATE.start_main_~i~5 33), 34361#(<= ULTIMATE.start_main_~i~5 34), 34362#(<= ULTIMATE.start_main_~i~5 35), 34363#(<= ULTIMATE.start_main_~i~5 36), 34364#(<= ULTIMATE.start_main_~i~5 37), 34365#(<= ULTIMATE.start_main_~i~5 38), 34366#(<= ULTIMATE.start_main_~i~5 39), 34367#(<= ULTIMATE.start_main_~i~5 40), 34368#(<= ULTIMATE.start_main_~i~5 41), 34369#(<= ULTIMATE.start_main_~i~5 42), 34370#(<= ULTIMATE.start_main_~i~5 43), 34371#(<= ULTIMATE.start_main_~i~5 44), 34372#(<= ULTIMATE.start_main_~i~5 45), 34373#(<= ULTIMATE.start_main_~i~5 46), 34374#(<= ULTIMATE.start_main_~i~5 47), 34375#(<= ULTIMATE.start_main_~i~5 48), 34376#(<= ULTIMATE.start_main_~i~5 49), 34377#(<= ULTIMATE.start_main_~i~5 50), 34378#(<= ULTIMATE.start_main_~i~5 51), 34379#(<= ULTIMATE.start_main_~i~5 52), 34380#(<= ULTIMATE.start_main_~i~5 53), 34381#(<= ULTIMATE.start_main_~i~5 54), 34382#(<= ULTIMATE.start_main_~i~5 55), 34383#(<= ULTIMATE.start_main_~i~5 56), 34384#(<= ULTIMATE.start_main_~i~5 57), 34385#(<= ULTIMATE.start_main_~i~5 58), 34386#(<= ULTIMATE.start_main_~i~5 59), 34387#(<= ULTIMATE.start_main_~i~5 60), 34388#(<= ULTIMATE.start_main_~i~5 61), 34389#(<= ULTIMATE.start_main_~i~5 62), 34390#(<= ULTIMATE.start_main_~i~5 63), 34391#(<= ULTIMATE.start_main_~i~5 64), 34392#(<= ULTIMATE.start_main_~i~5 65), 34393#(<= ULTIMATE.start_main_~i~5 66), 34394#(<= ULTIMATE.start_main_~i~5 67), 34395#(<= ULTIMATE.start_main_~i~5 68), 34396#(<= ULTIMATE.start_main_~i~5 69), 34397#(<= ULTIMATE.start_main_~i~5 70), 34398#(<= ULTIMATE.start_main_~i~5 71), 34399#(<= ULTIMATE.start_main_~i~5 72), 34400#(<= ULTIMATE.start_main_~i~5 73), 34401#(<= ULTIMATE.start_main_~i~5 74), 34402#(<= ULTIMATE.start_main_~i~5 75), 34403#(<= ULTIMATE.start_main_~i~5 76), 34404#(<= ULTIMATE.start_main_~i~5 77), 34405#(<= ULTIMATE.start_main_~i~5 78), 34406#(<= ULTIMATE.start_main_~i~5 79), 34407#(<= ULTIMATE.start_main_~i~5 80), 34408#(<= ULTIMATE.start_main_~i~5 81), 34409#(<= ULTIMATE.start_main_~i~5 82), 34410#(<= ULTIMATE.start_main_~i~5 83), 34411#(<= ULTIMATE.start_main_~i~5 84)] [2018-07-23 13:50:27,710 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:27,710 INFO L450 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-23 13:50:27,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-23 13:50:27,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 13:50:27,712 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 87 states. [2018-07-23 13:50:27,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:27,890 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-07-23 13:50:27,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-23 13:50:27,890 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2018-07-23 13:50:27,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:27,891 INFO L225 Difference]: With dead ends: 177 [2018-07-23 13:50:27,892 INFO L226 Difference]: Without dead ends: 175 [2018-07-23 13:50:27,892 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 13:50:27,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-07-23 13:50:27,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-07-23 13:50:27,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-07-23 13:50:27,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-07-23 13:50:27,900 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2018-07-23 13:50:27,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:27,900 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-07-23 13:50:27,900 INFO L472 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-23 13:50:27,900 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-07-23 13:50:27,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-07-23 13:50:27,903 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:27,903 INFO L357 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1] [2018-07-23 13:50:27,903 INFO L414 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:27,904 INFO L82 PathProgramCache]: Analyzing trace with hash 535118257, now seen corresponding path program 85 times [2018-07-23 13:50:27,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:28,364 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:28,365 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:28,365 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-23 13:50:28,365 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:28,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:28,366 INFO L185 omatonBuilderFactory]: Interpolants [35200#(<= ULTIMATE.start_main_~i~5 82), 35201#(<= ULTIMATE.start_main_~i~5 83), 35202#(<= ULTIMATE.start_main_~i~5 84), 35203#(<= ULTIMATE.start_main_~i~5 85), 35116#true, 35117#false, 35118#(<= ULTIMATE.start_main_~i~5 0), 35119#(<= ULTIMATE.start_main_~i~5 1), 35120#(<= ULTIMATE.start_main_~i~5 2), 35121#(<= ULTIMATE.start_main_~i~5 3), 35122#(<= ULTIMATE.start_main_~i~5 4), 35123#(<= ULTIMATE.start_main_~i~5 5), 35124#(<= ULTIMATE.start_main_~i~5 6), 35125#(<= ULTIMATE.start_main_~i~5 7), 35126#(<= ULTIMATE.start_main_~i~5 8), 35127#(<= ULTIMATE.start_main_~i~5 9), 35128#(<= ULTIMATE.start_main_~i~5 10), 35129#(<= ULTIMATE.start_main_~i~5 11), 35130#(<= ULTIMATE.start_main_~i~5 12), 35131#(<= ULTIMATE.start_main_~i~5 13), 35132#(<= ULTIMATE.start_main_~i~5 14), 35133#(<= ULTIMATE.start_main_~i~5 15), 35134#(<= ULTIMATE.start_main_~i~5 16), 35135#(<= ULTIMATE.start_main_~i~5 17), 35136#(<= ULTIMATE.start_main_~i~5 18), 35137#(<= ULTIMATE.start_main_~i~5 19), 35138#(<= ULTIMATE.start_main_~i~5 20), 35139#(<= ULTIMATE.start_main_~i~5 21), 35140#(<= ULTIMATE.start_main_~i~5 22), 35141#(<= ULTIMATE.start_main_~i~5 23), 35142#(<= ULTIMATE.start_main_~i~5 24), 35143#(<= ULTIMATE.start_main_~i~5 25), 35144#(<= ULTIMATE.start_main_~i~5 26), 35145#(<= ULTIMATE.start_main_~i~5 27), 35146#(<= ULTIMATE.start_main_~i~5 28), 35147#(<= ULTIMATE.start_main_~i~5 29), 35148#(<= ULTIMATE.start_main_~i~5 30), 35149#(<= ULTIMATE.start_main_~i~5 31), 35150#(<= ULTIMATE.start_main_~i~5 32), 35151#(<= ULTIMATE.start_main_~i~5 33), 35152#(<= ULTIMATE.start_main_~i~5 34), 35153#(<= ULTIMATE.start_main_~i~5 35), 35154#(<= ULTIMATE.start_main_~i~5 36), 35155#(<= ULTIMATE.start_main_~i~5 37), 35156#(<= ULTIMATE.start_main_~i~5 38), 35157#(<= ULTIMATE.start_main_~i~5 39), 35158#(<= ULTIMATE.start_main_~i~5 40), 35159#(<= ULTIMATE.start_main_~i~5 41), 35160#(<= ULTIMATE.start_main_~i~5 42), 35161#(<= ULTIMATE.start_main_~i~5 43), 35162#(<= ULTIMATE.start_main_~i~5 44), 35163#(<= ULTIMATE.start_main_~i~5 45), 35164#(<= ULTIMATE.start_main_~i~5 46), 35165#(<= ULTIMATE.start_main_~i~5 47), 35166#(<= ULTIMATE.start_main_~i~5 48), 35167#(<= ULTIMATE.start_main_~i~5 49), 35168#(<= ULTIMATE.start_main_~i~5 50), 35169#(<= ULTIMATE.start_main_~i~5 51), 35170#(<= ULTIMATE.start_main_~i~5 52), 35171#(<= ULTIMATE.start_main_~i~5 53), 35172#(<= ULTIMATE.start_main_~i~5 54), 35173#(<= ULTIMATE.start_main_~i~5 55), 35174#(<= ULTIMATE.start_main_~i~5 56), 35175#(<= ULTIMATE.start_main_~i~5 57), 35176#(<= ULTIMATE.start_main_~i~5 58), 35177#(<= ULTIMATE.start_main_~i~5 59), 35178#(<= ULTIMATE.start_main_~i~5 60), 35179#(<= ULTIMATE.start_main_~i~5 61), 35180#(<= ULTIMATE.start_main_~i~5 62), 35181#(<= ULTIMATE.start_main_~i~5 63), 35182#(<= ULTIMATE.start_main_~i~5 64), 35183#(<= ULTIMATE.start_main_~i~5 65), 35184#(<= ULTIMATE.start_main_~i~5 66), 35185#(<= ULTIMATE.start_main_~i~5 67), 35186#(<= ULTIMATE.start_main_~i~5 68), 35187#(<= ULTIMATE.start_main_~i~5 69), 35188#(<= ULTIMATE.start_main_~i~5 70), 35189#(<= ULTIMATE.start_main_~i~5 71), 35190#(<= ULTIMATE.start_main_~i~5 72), 35191#(<= ULTIMATE.start_main_~i~5 73), 35192#(<= ULTIMATE.start_main_~i~5 74), 35193#(<= ULTIMATE.start_main_~i~5 75), 35194#(<= ULTIMATE.start_main_~i~5 76), 35195#(<= ULTIMATE.start_main_~i~5 77), 35196#(<= ULTIMATE.start_main_~i~5 78), 35197#(<= ULTIMATE.start_main_~i~5 79), 35198#(<= ULTIMATE.start_main_~i~5 80), 35199#(<= ULTIMATE.start_main_~i~5 81)] [2018-07-23 13:50:28,367 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:28,367 INFO L450 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-23 13:50:28,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-23 13:50:28,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 13:50:28,369 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 88 states. [2018-07-23 13:50:28,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:28,518 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-07-23 13:50:28,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-23 13:50:28,518 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2018-07-23 13:50:28,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:28,520 INFO L225 Difference]: With dead ends: 179 [2018-07-23 13:50:28,520 INFO L226 Difference]: Without dead ends: 177 [2018-07-23 13:50:28,521 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 13:50:28,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-07-23 13:50:28,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-07-23 13:50:28,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-07-23 13:50:28,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-07-23 13:50:28,527 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2018-07-23 13:50:28,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:28,527 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-07-23 13:50:28,527 INFO L472 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-23 13:50:28,527 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-07-23 13:50:28,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-23 13:50:28,530 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:28,530 INFO L357 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1] [2018-07-23 13:50:28,530 INFO L414 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:28,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1147497555, now seen corresponding path program 86 times [2018-07-23 13:50:28,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:28,915 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:28,916 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:28,916 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-23 13:50:28,916 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:28,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:28,917 INFO L185 omatonBuilderFactory]: Interpolants [35968#(<= ULTIMATE.start_main_~i~5 50), 35969#(<= ULTIMATE.start_main_~i~5 51), 35970#(<= ULTIMATE.start_main_~i~5 52), 35971#(<= ULTIMATE.start_main_~i~5 53), 35972#(<= ULTIMATE.start_main_~i~5 54), 35973#(<= ULTIMATE.start_main_~i~5 55), 35974#(<= ULTIMATE.start_main_~i~5 56), 35975#(<= ULTIMATE.start_main_~i~5 57), 35976#(<= ULTIMATE.start_main_~i~5 58), 35977#(<= ULTIMATE.start_main_~i~5 59), 35978#(<= ULTIMATE.start_main_~i~5 60), 35979#(<= ULTIMATE.start_main_~i~5 61), 35980#(<= ULTIMATE.start_main_~i~5 62), 35981#(<= ULTIMATE.start_main_~i~5 63), 35982#(<= ULTIMATE.start_main_~i~5 64), 35983#(<= ULTIMATE.start_main_~i~5 65), 35984#(<= ULTIMATE.start_main_~i~5 66), 35985#(<= ULTIMATE.start_main_~i~5 67), 35986#(<= ULTIMATE.start_main_~i~5 68), 35987#(<= ULTIMATE.start_main_~i~5 69), 35988#(<= ULTIMATE.start_main_~i~5 70), 35989#(<= ULTIMATE.start_main_~i~5 71), 35990#(<= ULTIMATE.start_main_~i~5 72), 35991#(<= ULTIMATE.start_main_~i~5 73), 35992#(<= ULTIMATE.start_main_~i~5 74), 35993#(<= ULTIMATE.start_main_~i~5 75), 35994#(<= ULTIMATE.start_main_~i~5 76), 35995#(<= ULTIMATE.start_main_~i~5 77), 35996#(<= ULTIMATE.start_main_~i~5 78), 35997#(<= ULTIMATE.start_main_~i~5 79), 35998#(<= ULTIMATE.start_main_~i~5 80), 35999#(<= ULTIMATE.start_main_~i~5 81), 36000#(<= ULTIMATE.start_main_~i~5 82), 36001#(<= ULTIMATE.start_main_~i~5 83), 36002#(<= ULTIMATE.start_main_~i~5 84), 36003#(<= ULTIMATE.start_main_~i~5 85), 36004#(<= ULTIMATE.start_main_~i~5 86), 35916#true, 35917#false, 35918#(<= ULTIMATE.start_main_~i~5 0), 35919#(<= ULTIMATE.start_main_~i~5 1), 35920#(<= ULTIMATE.start_main_~i~5 2), 35921#(<= ULTIMATE.start_main_~i~5 3), 35922#(<= ULTIMATE.start_main_~i~5 4), 35923#(<= ULTIMATE.start_main_~i~5 5), 35924#(<= ULTIMATE.start_main_~i~5 6), 35925#(<= ULTIMATE.start_main_~i~5 7), 35926#(<= ULTIMATE.start_main_~i~5 8), 35927#(<= ULTIMATE.start_main_~i~5 9), 35928#(<= ULTIMATE.start_main_~i~5 10), 35929#(<= ULTIMATE.start_main_~i~5 11), 35930#(<= ULTIMATE.start_main_~i~5 12), 35931#(<= ULTIMATE.start_main_~i~5 13), 35932#(<= ULTIMATE.start_main_~i~5 14), 35933#(<= ULTIMATE.start_main_~i~5 15), 35934#(<= ULTIMATE.start_main_~i~5 16), 35935#(<= ULTIMATE.start_main_~i~5 17), 35936#(<= ULTIMATE.start_main_~i~5 18), 35937#(<= ULTIMATE.start_main_~i~5 19), 35938#(<= ULTIMATE.start_main_~i~5 20), 35939#(<= ULTIMATE.start_main_~i~5 21), 35940#(<= ULTIMATE.start_main_~i~5 22), 35941#(<= ULTIMATE.start_main_~i~5 23), 35942#(<= ULTIMATE.start_main_~i~5 24), 35943#(<= ULTIMATE.start_main_~i~5 25), 35944#(<= ULTIMATE.start_main_~i~5 26), 35945#(<= ULTIMATE.start_main_~i~5 27), 35946#(<= ULTIMATE.start_main_~i~5 28), 35947#(<= ULTIMATE.start_main_~i~5 29), 35948#(<= ULTIMATE.start_main_~i~5 30), 35949#(<= ULTIMATE.start_main_~i~5 31), 35950#(<= ULTIMATE.start_main_~i~5 32), 35951#(<= ULTIMATE.start_main_~i~5 33), 35952#(<= ULTIMATE.start_main_~i~5 34), 35953#(<= ULTIMATE.start_main_~i~5 35), 35954#(<= ULTIMATE.start_main_~i~5 36), 35955#(<= ULTIMATE.start_main_~i~5 37), 35956#(<= ULTIMATE.start_main_~i~5 38), 35957#(<= ULTIMATE.start_main_~i~5 39), 35958#(<= ULTIMATE.start_main_~i~5 40), 35959#(<= ULTIMATE.start_main_~i~5 41), 35960#(<= ULTIMATE.start_main_~i~5 42), 35961#(<= ULTIMATE.start_main_~i~5 43), 35962#(<= ULTIMATE.start_main_~i~5 44), 35963#(<= ULTIMATE.start_main_~i~5 45), 35964#(<= ULTIMATE.start_main_~i~5 46), 35965#(<= ULTIMATE.start_main_~i~5 47), 35966#(<= ULTIMATE.start_main_~i~5 48), 35967#(<= ULTIMATE.start_main_~i~5 49)] [2018-07-23 13:50:28,918 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:28,918 INFO L450 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-23 13:50:28,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-23 13:50:28,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 13:50:28,921 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 89 states. [2018-07-23 13:50:29,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:29,007 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-07-23 13:50:29,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-23 13:50:29,007 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2018-07-23 13:50:29,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:29,008 INFO L225 Difference]: With dead ends: 181 [2018-07-23 13:50:29,009 INFO L226 Difference]: Without dead ends: 179 [2018-07-23 13:50:29,009 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 13:50:29,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-23 13:50:29,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-07-23 13:50:29,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-07-23 13:50:29,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-07-23 13:50:29,014 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2018-07-23 13:50:29,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:29,015 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-07-23 13:50:29,015 INFO L472 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-23 13:50:29,015 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-07-23 13:50:29,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-23 13:50:29,022 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:29,022 INFO L357 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1] [2018-07-23 13:50:29,022 INFO L414 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:29,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1061377705, now seen corresponding path program 87 times [2018-07-23 13:50:29,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:29,413 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,413 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:29,413 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-23 13:50:29,414 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:29,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,414 INFO L185 omatonBuilderFactory]: Interpolants [36736#(<= ULTIMATE.start_main_~i~5 9), 36737#(<= ULTIMATE.start_main_~i~5 10), 36738#(<= ULTIMATE.start_main_~i~5 11), 36739#(<= ULTIMATE.start_main_~i~5 12), 36740#(<= ULTIMATE.start_main_~i~5 13), 36741#(<= ULTIMATE.start_main_~i~5 14), 36742#(<= ULTIMATE.start_main_~i~5 15), 36743#(<= ULTIMATE.start_main_~i~5 16), 36744#(<= ULTIMATE.start_main_~i~5 17), 36745#(<= ULTIMATE.start_main_~i~5 18), 36746#(<= ULTIMATE.start_main_~i~5 19), 36747#(<= ULTIMATE.start_main_~i~5 20), 36748#(<= ULTIMATE.start_main_~i~5 21), 36749#(<= ULTIMATE.start_main_~i~5 22), 36750#(<= ULTIMATE.start_main_~i~5 23), 36751#(<= ULTIMATE.start_main_~i~5 24), 36752#(<= ULTIMATE.start_main_~i~5 25), 36753#(<= ULTIMATE.start_main_~i~5 26), 36754#(<= ULTIMATE.start_main_~i~5 27), 36755#(<= ULTIMATE.start_main_~i~5 28), 36756#(<= ULTIMATE.start_main_~i~5 29), 36757#(<= ULTIMATE.start_main_~i~5 30), 36758#(<= ULTIMATE.start_main_~i~5 31), 36759#(<= ULTIMATE.start_main_~i~5 32), 36760#(<= ULTIMATE.start_main_~i~5 33), 36761#(<= ULTIMATE.start_main_~i~5 34), 36762#(<= ULTIMATE.start_main_~i~5 35), 36763#(<= ULTIMATE.start_main_~i~5 36), 36764#(<= ULTIMATE.start_main_~i~5 37), 36765#(<= ULTIMATE.start_main_~i~5 38), 36766#(<= ULTIMATE.start_main_~i~5 39), 36767#(<= ULTIMATE.start_main_~i~5 40), 36768#(<= ULTIMATE.start_main_~i~5 41), 36769#(<= ULTIMATE.start_main_~i~5 42), 36770#(<= ULTIMATE.start_main_~i~5 43), 36771#(<= ULTIMATE.start_main_~i~5 44), 36772#(<= ULTIMATE.start_main_~i~5 45), 36773#(<= ULTIMATE.start_main_~i~5 46), 36774#(<= ULTIMATE.start_main_~i~5 47), 36775#(<= ULTIMATE.start_main_~i~5 48), 36776#(<= ULTIMATE.start_main_~i~5 49), 36777#(<= ULTIMATE.start_main_~i~5 50), 36778#(<= ULTIMATE.start_main_~i~5 51), 36779#(<= ULTIMATE.start_main_~i~5 52), 36780#(<= ULTIMATE.start_main_~i~5 53), 36781#(<= ULTIMATE.start_main_~i~5 54), 36782#(<= ULTIMATE.start_main_~i~5 55), 36783#(<= ULTIMATE.start_main_~i~5 56), 36784#(<= ULTIMATE.start_main_~i~5 57), 36785#(<= ULTIMATE.start_main_~i~5 58), 36786#(<= ULTIMATE.start_main_~i~5 59), 36787#(<= ULTIMATE.start_main_~i~5 60), 36788#(<= ULTIMATE.start_main_~i~5 61), 36789#(<= ULTIMATE.start_main_~i~5 62), 36790#(<= ULTIMATE.start_main_~i~5 63), 36791#(<= ULTIMATE.start_main_~i~5 64), 36792#(<= ULTIMATE.start_main_~i~5 65), 36793#(<= ULTIMATE.start_main_~i~5 66), 36794#(<= ULTIMATE.start_main_~i~5 67), 36795#(<= ULTIMATE.start_main_~i~5 68), 36796#(<= ULTIMATE.start_main_~i~5 69), 36797#(<= ULTIMATE.start_main_~i~5 70), 36798#(<= ULTIMATE.start_main_~i~5 71), 36799#(<= ULTIMATE.start_main_~i~5 72), 36800#(<= ULTIMATE.start_main_~i~5 73), 36801#(<= ULTIMATE.start_main_~i~5 74), 36802#(<= ULTIMATE.start_main_~i~5 75), 36803#(<= ULTIMATE.start_main_~i~5 76), 36804#(<= ULTIMATE.start_main_~i~5 77), 36805#(<= ULTIMATE.start_main_~i~5 78), 36806#(<= ULTIMATE.start_main_~i~5 79), 36807#(<= ULTIMATE.start_main_~i~5 80), 36808#(<= ULTIMATE.start_main_~i~5 81), 36809#(<= ULTIMATE.start_main_~i~5 82), 36810#(<= ULTIMATE.start_main_~i~5 83), 36811#(<= ULTIMATE.start_main_~i~5 84), 36812#(<= ULTIMATE.start_main_~i~5 85), 36813#(<= ULTIMATE.start_main_~i~5 86), 36814#(<= ULTIMATE.start_main_~i~5 87), 36725#true, 36726#false, 36727#(<= ULTIMATE.start_main_~i~5 0), 36728#(<= ULTIMATE.start_main_~i~5 1), 36729#(<= ULTIMATE.start_main_~i~5 2), 36730#(<= ULTIMATE.start_main_~i~5 3), 36731#(<= ULTIMATE.start_main_~i~5 4), 36732#(<= ULTIMATE.start_main_~i~5 5), 36733#(<= ULTIMATE.start_main_~i~5 6), 36734#(<= ULTIMATE.start_main_~i~5 7), 36735#(<= ULTIMATE.start_main_~i~5 8)] [2018-07-23 13:50:29,415 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,415 INFO L450 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-23 13:50:29,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-23 13:50:29,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 13:50:29,417 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 90 states. [2018-07-23 13:50:29,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:29,576 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-07-23 13:50:29,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-23 13:50:29,577 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2018-07-23 13:50:29,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:29,578 INFO L225 Difference]: With dead ends: 183 [2018-07-23 13:50:29,578 INFO L226 Difference]: Without dead ends: 181 [2018-07-23 13:50:29,579 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 13:50:29,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-07-23 13:50:29,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-07-23 13:50:29,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-07-23 13:50:29,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-07-23 13:50:29,585 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2018-07-23 13:50:29,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:29,585 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-07-23 13:50:29,585 INFO L472 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-23 13:50:29,585 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-07-23 13:50:29,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-23 13:50:29,587 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:29,587 INFO L357 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1] [2018-07-23 13:50:29,588 INFO L414 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:29,588 INFO L82 PathProgramCache]: Analyzing trace with hash 2076658341, now seen corresponding path program 88 times [2018-07-23 13:50:29,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:29,993 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,993 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:29,993 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-23 13:50:29,994 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,994 INFO L185 omatonBuilderFactory]: Interpolants [37632#(<= ULTIMATE.start_main_~i~5 87), 37633#(<= ULTIMATE.start_main_~i~5 88), 37543#true, 37544#false, 37545#(<= ULTIMATE.start_main_~i~5 0), 37546#(<= ULTIMATE.start_main_~i~5 1), 37547#(<= ULTIMATE.start_main_~i~5 2), 37548#(<= ULTIMATE.start_main_~i~5 3), 37549#(<= ULTIMATE.start_main_~i~5 4), 37550#(<= ULTIMATE.start_main_~i~5 5), 37551#(<= ULTIMATE.start_main_~i~5 6), 37552#(<= ULTIMATE.start_main_~i~5 7), 37553#(<= ULTIMATE.start_main_~i~5 8), 37554#(<= ULTIMATE.start_main_~i~5 9), 37555#(<= ULTIMATE.start_main_~i~5 10), 37556#(<= ULTIMATE.start_main_~i~5 11), 37557#(<= ULTIMATE.start_main_~i~5 12), 37558#(<= ULTIMATE.start_main_~i~5 13), 37559#(<= ULTIMATE.start_main_~i~5 14), 37560#(<= ULTIMATE.start_main_~i~5 15), 37561#(<= ULTIMATE.start_main_~i~5 16), 37562#(<= ULTIMATE.start_main_~i~5 17), 37563#(<= ULTIMATE.start_main_~i~5 18), 37564#(<= ULTIMATE.start_main_~i~5 19), 37565#(<= ULTIMATE.start_main_~i~5 20), 37566#(<= ULTIMATE.start_main_~i~5 21), 37567#(<= ULTIMATE.start_main_~i~5 22), 37568#(<= ULTIMATE.start_main_~i~5 23), 37569#(<= ULTIMATE.start_main_~i~5 24), 37570#(<= ULTIMATE.start_main_~i~5 25), 37571#(<= ULTIMATE.start_main_~i~5 26), 37572#(<= ULTIMATE.start_main_~i~5 27), 37573#(<= ULTIMATE.start_main_~i~5 28), 37574#(<= ULTIMATE.start_main_~i~5 29), 37575#(<= ULTIMATE.start_main_~i~5 30), 37576#(<= ULTIMATE.start_main_~i~5 31), 37577#(<= ULTIMATE.start_main_~i~5 32), 37578#(<= ULTIMATE.start_main_~i~5 33), 37579#(<= ULTIMATE.start_main_~i~5 34), 37580#(<= ULTIMATE.start_main_~i~5 35), 37581#(<= ULTIMATE.start_main_~i~5 36), 37582#(<= ULTIMATE.start_main_~i~5 37), 37583#(<= ULTIMATE.start_main_~i~5 38), 37584#(<= ULTIMATE.start_main_~i~5 39), 37585#(<= ULTIMATE.start_main_~i~5 40), 37586#(<= ULTIMATE.start_main_~i~5 41), 37587#(<= ULTIMATE.start_main_~i~5 42), 37588#(<= ULTIMATE.start_main_~i~5 43), 37589#(<= ULTIMATE.start_main_~i~5 44), 37590#(<= ULTIMATE.start_main_~i~5 45), 37591#(<= ULTIMATE.start_main_~i~5 46), 37592#(<= ULTIMATE.start_main_~i~5 47), 37593#(<= ULTIMATE.start_main_~i~5 48), 37594#(<= ULTIMATE.start_main_~i~5 49), 37595#(<= ULTIMATE.start_main_~i~5 50), 37596#(<= ULTIMATE.start_main_~i~5 51), 37597#(<= ULTIMATE.start_main_~i~5 52), 37598#(<= ULTIMATE.start_main_~i~5 53), 37599#(<= ULTIMATE.start_main_~i~5 54), 37600#(<= ULTIMATE.start_main_~i~5 55), 37601#(<= ULTIMATE.start_main_~i~5 56), 37602#(<= ULTIMATE.start_main_~i~5 57), 37603#(<= ULTIMATE.start_main_~i~5 58), 37604#(<= ULTIMATE.start_main_~i~5 59), 37605#(<= ULTIMATE.start_main_~i~5 60), 37606#(<= ULTIMATE.start_main_~i~5 61), 37607#(<= ULTIMATE.start_main_~i~5 62), 37608#(<= ULTIMATE.start_main_~i~5 63), 37609#(<= ULTIMATE.start_main_~i~5 64), 37610#(<= ULTIMATE.start_main_~i~5 65), 37611#(<= ULTIMATE.start_main_~i~5 66), 37612#(<= ULTIMATE.start_main_~i~5 67), 37613#(<= ULTIMATE.start_main_~i~5 68), 37614#(<= ULTIMATE.start_main_~i~5 69), 37615#(<= ULTIMATE.start_main_~i~5 70), 37616#(<= ULTIMATE.start_main_~i~5 71), 37617#(<= ULTIMATE.start_main_~i~5 72), 37618#(<= ULTIMATE.start_main_~i~5 73), 37619#(<= ULTIMATE.start_main_~i~5 74), 37620#(<= ULTIMATE.start_main_~i~5 75), 37621#(<= ULTIMATE.start_main_~i~5 76), 37622#(<= ULTIMATE.start_main_~i~5 77), 37623#(<= ULTIMATE.start_main_~i~5 78), 37624#(<= ULTIMATE.start_main_~i~5 79), 37625#(<= ULTIMATE.start_main_~i~5 80), 37626#(<= ULTIMATE.start_main_~i~5 81), 37627#(<= ULTIMATE.start_main_~i~5 82), 37628#(<= ULTIMATE.start_main_~i~5 83), 37629#(<= ULTIMATE.start_main_~i~5 84), 37630#(<= ULTIMATE.start_main_~i~5 85), 37631#(<= ULTIMATE.start_main_~i~5 86)] [2018-07-23 13:50:29,995 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,995 INFO L450 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-23 13:50:29,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-23 13:50:29,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 13:50:30,000 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 91 states. [2018-07-23 13:50:30,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:30,188 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-07-23 13:50:30,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-23 13:50:30,188 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2018-07-23 13:50:30,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:30,190 INFO L225 Difference]: With dead ends: 185 [2018-07-23 13:50:30,190 INFO L226 Difference]: Without dead ends: 183 [2018-07-23 13:50:30,191 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 13:50:30,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-23 13:50:30,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-07-23 13:50:30,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-23 13:50:30,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-07-23 13:50:30,198 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2018-07-23 13:50:30,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:30,198 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-07-23 13:50:30,198 INFO L472 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-23 13:50:30,198 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-07-23 13:50:30,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-07-23 13:50:30,202 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:30,203 INFO L357 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1] [2018-07-23 13:50:30,203 INFO L414 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:30,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1491193951, now seen corresponding path program 89 times [2018-07-23 13:50:30,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:30,620 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:30,620 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:30,620 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-23 13:50:30,621 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:30,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:30,621 INFO L185 omatonBuilderFactory]: Interpolants [38400#(<= ULTIMATE.start_main_~i~5 28), 38401#(<= ULTIMATE.start_main_~i~5 29), 38402#(<= ULTIMATE.start_main_~i~5 30), 38403#(<= ULTIMATE.start_main_~i~5 31), 38404#(<= ULTIMATE.start_main_~i~5 32), 38405#(<= ULTIMATE.start_main_~i~5 33), 38406#(<= ULTIMATE.start_main_~i~5 34), 38407#(<= ULTIMATE.start_main_~i~5 35), 38408#(<= ULTIMATE.start_main_~i~5 36), 38409#(<= ULTIMATE.start_main_~i~5 37), 38410#(<= ULTIMATE.start_main_~i~5 38), 38411#(<= ULTIMATE.start_main_~i~5 39), 38412#(<= ULTIMATE.start_main_~i~5 40), 38413#(<= ULTIMATE.start_main_~i~5 41), 38414#(<= ULTIMATE.start_main_~i~5 42), 38415#(<= ULTIMATE.start_main_~i~5 43), 38416#(<= ULTIMATE.start_main_~i~5 44), 38417#(<= ULTIMATE.start_main_~i~5 45), 38418#(<= ULTIMATE.start_main_~i~5 46), 38419#(<= ULTIMATE.start_main_~i~5 47), 38420#(<= ULTIMATE.start_main_~i~5 48), 38421#(<= ULTIMATE.start_main_~i~5 49), 38422#(<= ULTIMATE.start_main_~i~5 50), 38423#(<= ULTIMATE.start_main_~i~5 51), 38424#(<= ULTIMATE.start_main_~i~5 52), 38425#(<= ULTIMATE.start_main_~i~5 53), 38426#(<= ULTIMATE.start_main_~i~5 54), 38427#(<= ULTIMATE.start_main_~i~5 55), 38428#(<= ULTIMATE.start_main_~i~5 56), 38429#(<= ULTIMATE.start_main_~i~5 57), 38430#(<= ULTIMATE.start_main_~i~5 58), 38431#(<= ULTIMATE.start_main_~i~5 59), 38432#(<= ULTIMATE.start_main_~i~5 60), 38433#(<= ULTIMATE.start_main_~i~5 61), 38434#(<= ULTIMATE.start_main_~i~5 62), 38435#(<= ULTIMATE.start_main_~i~5 63), 38436#(<= ULTIMATE.start_main_~i~5 64), 38437#(<= ULTIMATE.start_main_~i~5 65), 38438#(<= ULTIMATE.start_main_~i~5 66), 38439#(<= ULTIMATE.start_main_~i~5 67), 38440#(<= ULTIMATE.start_main_~i~5 68), 38441#(<= ULTIMATE.start_main_~i~5 69), 38442#(<= ULTIMATE.start_main_~i~5 70), 38443#(<= ULTIMATE.start_main_~i~5 71), 38444#(<= ULTIMATE.start_main_~i~5 72), 38445#(<= ULTIMATE.start_main_~i~5 73), 38446#(<= ULTIMATE.start_main_~i~5 74), 38447#(<= ULTIMATE.start_main_~i~5 75), 38448#(<= ULTIMATE.start_main_~i~5 76), 38449#(<= ULTIMATE.start_main_~i~5 77), 38450#(<= ULTIMATE.start_main_~i~5 78), 38451#(<= ULTIMATE.start_main_~i~5 79), 38452#(<= ULTIMATE.start_main_~i~5 80), 38453#(<= ULTIMATE.start_main_~i~5 81), 38454#(<= ULTIMATE.start_main_~i~5 82), 38455#(<= ULTIMATE.start_main_~i~5 83), 38456#(<= ULTIMATE.start_main_~i~5 84), 38457#(<= ULTIMATE.start_main_~i~5 85), 38458#(<= ULTIMATE.start_main_~i~5 86), 38459#(<= ULTIMATE.start_main_~i~5 87), 38460#(<= ULTIMATE.start_main_~i~5 88), 38461#(<= ULTIMATE.start_main_~i~5 89), 38370#true, 38371#false, 38372#(<= ULTIMATE.start_main_~i~5 0), 38373#(<= ULTIMATE.start_main_~i~5 1), 38374#(<= ULTIMATE.start_main_~i~5 2), 38375#(<= ULTIMATE.start_main_~i~5 3), 38376#(<= ULTIMATE.start_main_~i~5 4), 38377#(<= ULTIMATE.start_main_~i~5 5), 38378#(<= ULTIMATE.start_main_~i~5 6), 38379#(<= ULTIMATE.start_main_~i~5 7), 38380#(<= ULTIMATE.start_main_~i~5 8), 38381#(<= ULTIMATE.start_main_~i~5 9), 38382#(<= ULTIMATE.start_main_~i~5 10), 38383#(<= ULTIMATE.start_main_~i~5 11), 38384#(<= ULTIMATE.start_main_~i~5 12), 38385#(<= ULTIMATE.start_main_~i~5 13), 38386#(<= ULTIMATE.start_main_~i~5 14), 38387#(<= ULTIMATE.start_main_~i~5 15), 38388#(<= ULTIMATE.start_main_~i~5 16), 38389#(<= ULTIMATE.start_main_~i~5 17), 38390#(<= ULTIMATE.start_main_~i~5 18), 38391#(<= ULTIMATE.start_main_~i~5 19), 38392#(<= ULTIMATE.start_main_~i~5 20), 38393#(<= ULTIMATE.start_main_~i~5 21), 38394#(<= ULTIMATE.start_main_~i~5 22), 38395#(<= ULTIMATE.start_main_~i~5 23), 38396#(<= ULTIMATE.start_main_~i~5 24), 38397#(<= ULTIMATE.start_main_~i~5 25), 38398#(<= ULTIMATE.start_main_~i~5 26), 38399#(<= ULTIMATE.start_main_~i~5 27)] [2018-07-23 13:50:30,622 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:30,622 INFO L450 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-23 13:50:30,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-23 13:50:30,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 13:50:30,624 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 92 states. [2018-07-23 13:50:30,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:30,754 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-07-23 13:50:30,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-23 13:50:30,754 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2018-07-23 13:50:30,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:30,756 INFO L225 Difference]: With dead ends: 187 [2018-07-23 13:50:30,756 INFO L226 Difference]: Without dead ends: 185 [2018-07-23 13:50:30,757 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 13:50:30,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-07-23 13:50:30,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-07-23 13:50:30,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-23 13:50:30,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-07-23 13:50:30,762 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2018-07-23 13:50:30,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:30,762 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-07-23 13:50:30,762 INFO L472 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-23 13:50:30,762 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-07-23 13:50:30,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-07-23 13:50:30,764 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:30,765 INFO L357 BasicCegarLoop]: trace histogram [91, 90, 1, 1, 1] [2018-07-23 13:50:30,765 INFO L414 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:30,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1481622941, now seen corresponding path program 90 times [2018-07-23 13:50:30,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:31,198 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:31,198 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:31,198 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-23 13:50:31,199 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:31,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:31,199 INFO L185 omatonBuilderFactory]: Interpolants [39296#(<= ULTIMATE.start_main_~i~5 88), 39297#(<= ULTIMATE.start_main_~i~5 89), 39298#(<= ULTIMATE.start_main_~i~5 90), 39206#true, 39207#false, 39208#(<= ULTIMATE.start_main_~i~5 0), 39209#(<= ULTIMATE.start_main_~i~5 1), 39210#(<= ULTIMATE.start_main_~i~5 2), 39211#(<= ULTIMATE.start_main_~i~5 3), 39212#(<= ULTIMATE.start_main_~i~5 4), 39213#(<= ULTIMATE.start_main_~i~5 5), 39214#(<= ULTIMATE.start_main_~i~5 6), 39215#(<= ULTIMATE.start_main_~i~5 7), 39216#(<= ULTIMATE.start_main_~i~5 8), 39217#(<= ULTIMATE.start_main_~i~5 9), 39218#(<= ULTIMATE.start_main_~i~5 10), 39219#(<= ULTIMATE.start_main_~i~5 11), 39220#(<= ULTIMATE.start_main_~i~5 12), 39221#(<= ULTIMATE.start_main_~i~5 13), 39222#(<= ULTIMATE.start_main_~i~5 14), 39223#(<= ULTIMATE.start_main_~i~5 15), 39224#(<= ULTIMATE.start_main_~i~5 16), 39225#(<= ULTIMATE.start_main_~i~5 17), 39226#(<= ULTIMATE.start_main_~i~5 18), 39227#(<= ULTIMATE.start_main_~i~5 19), 39228#(<= ULTIMATE.start_main_~i~5 20), 39229#(<= ULTIMATE.start_main_~i~5 21), 39230#(<= ULTIMATE.start_main_~i~5 22), 39231#(<= ULTIMATE.start_main_~i~5 23), 39232#(<= ULTIMATE.start_main_~i~5 24), 39233#(<= ULTIMATE.start_main_~i~5 25), 39234#(<= ULTIMATE.start_main_~i~5 26), 39235#(<= ULTIMATE.start_main_~i~5 27), 39236#(<= ULTIMATE.start_main_~i~5 28), 39237#(<= ULTIMATE.start_main_~i~5 29), 39238#(<= ULTIMATE.start_main_~i~5 30), 39239#(<= ULTIMATE.start_main_~i~5 31), 39240#(<= ULTIMATE.start_main_~i~5 32), 39241#(<= ULTIMATE.start_main_~i~5 33), 39242#(<= ULTIMATE.start_main_~i~5 34), 39243#(<= ULTIMATE.start_main_~i~5 35), 39244#(<= ULTIMATE.start_main_~i~5 36), 39245#(<= ULTIMATE.start_main_~i~5 37), 39246#(<= ULTIMATE.start_main_~i~5 38), 39247#(<= ULTIMATE.start_main_~i~5 39), 39248#(<= ULTIMATE.start_main_~i~5 40), 39249#(<= ULTIMATE.start_main_~i~5 41), 39250#(<= ULTIMATE.start_main_~i~5 42), 39251#(<= ULTIMATE.start_main_~i~5 43), 39252#(<= ULTIMATE.start_main_~i~5 44), 39253#(<= ULTIMATE.start_main_~i~5 45), 39254#(<= ULTIMATE.start_main_~i~5 46), 39255#(<= ULTIMATE.start_main_~i~5 47), 39256#(<= ULTIMATE.start_main_~i~5 48), 39257#(<= ULTIMATE.start_main_~i~5 49), 39258#(<= ULTIMATE.start_main_~i~5 50), 39259#(<= ULTIMATE.start_main_~i~5 51), 39260#(<= ULTIMATE.start_main_~i~5 52), 39261#(<= ULTIMATE.start_main_~i~5 53), 39262#(<= ULTIMATE.start_main_~i~5 54), 39263#(<= ULTIMATE.start_main_~i~5 55), 39264#(<= ULTIMATE.start_main_~i~5 56), 39265#(<= ULTIMATE.start_main_~i~5 57), 39266#(<= ULTIMATE.start_main_~i~5 58), 39267#(<= ULTIMATE.start_main_~i~5 59), 39268#(<= ULTIMATE.start_main_~i~5 60), 39269#(<= ULTIMATE.start_main_~i~5 61), 39270#(<= ULTIMATE.start_main_~i~5 62), 39271#(<= ULTIMATE.start_main_~i~5 63), 39272#(<= ULTIMATE.start_main_~i~5 64), 39273#(<= ULTIMATE.start_main_~i~5 65), 39274#(<= ULTIMATE.start_main_~i~5 66), 39275#(<= ULTIMATE.start_main_~i~5 67), 39276#(<= ULTIMATE.start_main_~i~5 68), 39277#(<= ULTIMATE.start_main_~i~5 69), 39278#(<= ULTIMATE.start_main_~i~5 70), 39279#(<= ULTIMATE.start_main_~i~5 71), 39280#(<= ULTIMATE.start_main_~i~5 72), 39281#(<= ULTIMATE.start_main_~i~5 73), 39282#(<= ULTIMATE.start_main_~i~5 74), 39283#(<= ULTIMATE.start_main_~i~5 75), 39284#(<= ULTIMATE.start_main_~i~5 76), 39285#(<= ULTIMATE.start_main_~i~5 77), 39286#(<= ULTIMATE.start_main_~i~5 78), 39287#(<= ULTIMATE.start_main_~i~5 79), 39288#(<= ULTIMATE.start_main_~i~5 80), 39289#(<= ULTIMATE.start_main_~i~5 81), 39290#(<= ULTIMATE.start_main_~i~5 82), 39291#(<= ULTIMATE.start_main_~i~5 83), 39292#(<= ULTIMATE.start_main_~i~5 84), 39293#(<= ULTIMATE.start_main_~i~5 85), 39294#(<= ULTIMATE.start_main_~i~5 86), 39295#(<= ULTIMATE.start_main_~i~5 87)] [2018-07-23 13:50:31,200 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:31,200 INFO L450 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-23 13:50:31,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-23 13:50:31,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 13:50:31,201 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 93 states. [2018-07-23 13:50:31,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:31,318 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-07-23 13:50:31,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-23 13:50:31,318 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2018-07-23 13:50:31,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:31,319 INFO L225 Difference]: With dead ends: 189 [2018-07-23 13:50:31,319 INFO L226 Difference]: Without dead ends: 187 [2018-07-23 13:50:31,320 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 13:50:31,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-07-23 13:50:31,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-07-23 13:50:31,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-07-23 13:50:31,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-07-23 13:50:31,324 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2018-07-23 13:50:31,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:31,325 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-07-23 13:50:31,325 INFO L472 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-23 13:50:31,325 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-07-23 13:50:31,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-07-23 13:50:31,326 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:31,326 INFO L357 BasicCegarLoop]: trace histogram [92, 91, 1, 1, 1] [2018-07-23 13:50:31,326 INFO L414 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:31,326 INFO L82 PathProgramCache]: Analyzing trace with hash -2089562983, now seen corresponding path program 91 times [2018-07-23 13:50:31,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:31,735 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:31,736 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:31,736 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-23 13:50:31,736 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:31,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:31,737 INFO L185 omatonBuilderFactory]: Interpolants [40064#(<= ULTIMATE.start_main_~i~5 11), 40065#(<= ULTIMATE.start_main_~i~5 12), 40066#(<= ULTIMATE.start_main_~i~5 13), 40067#(<= ULTIMATE.start_main_~i~5 14), 40068#(<= ULTIMATE.start_main_~i~5 15), 40069#(<= ULTIMATE.start_main_~i~5 16), 40070#(<= ULTIMATE.start_main_~i~5 17), 40071#(<= ULTIMATE.start_main_~i~5 18), 40072#(<= ULTIMATE.start_main_~i~5 19), 40073#(<= ULTIMATE.start_main_~i~5 20), 40074#(<= ULTIMATE.start_main_~i~5 21), 40075#(<= ULTIMATE.start_main_~i~5 22), 40076#(<= ULTIMATE.start_main_~i~5 23), 40077#(<= ULTIMATE.start_main_~i~5 24), 40078#(<= ULTIMATE.start_main_~i~5 25), 40079#(<= ULTIMATE.start_main_~i~5 26), 40080#(<= ULTIMATE.start_main_~i~5 27), 40081#(<= ULTIMATE.start_main_~i~5 28), 40082#(<= ULTIMATE.start_main_~i~5 29), 40083#(<= ULTIMATE.start_main_~i~5 30), 40084#(<= ULTIMATE.start_main_~i~5 31), 40085#(<= ULTIMATE.start_main_~i~5 32), 40086#(<= ULTIMATE.start_main_~i~5 33), 40087#(<= ULTIMATE.start_main_~i~5 34), 40088#(<= ULTIMATE.start_main_~i~5 35), 40089#(<= ULTIMATE.start_main_~i~5 36), 40090#(<= ULTIMATE.start_main_~i~5 37), 40091#(<= ULTIMATE.start_main_~i~5 38), 40092#(<= ULTIMATE.start_main_~i~5 39), 40093#(<= ULTIMATE.start_main_~i~5 40), 40094#(<= ULTIMATE.start_main_~i~5 41), 40095#(<= ULTIMATE.start_main_~i~5 42), 40096#(<= ULTIMATE.start_main_~i~5 43), 40097#(<= ULTIMATE.start_main_~i~5 44), 40098#(<= ULTIMATE.start_main_~i~5 45), 40099#(<= ULTIMATE.start_main_~i~5 46), 40100#(<= ULTIMATE.start_main_~i~5 47), 40101#(<= ULTIMATE.start_main_~i~5 48), 40102#(<= ULTIMATE.start_main_~i~5 49), 40103#(<= ULTIMATE.start_main_~i~5 50), 40104#(<= ULTIMATE.start_main_~i~5 51), 40105#(<= ULTIMATE.start_main_~i~5 52), 40106#(<= ULTIMATE.start_main_~i~5 53), 40107#(<= ULTIMATE.start_main_~i~5 54), 40108#(<= ULTIMATE.start_main_~i~5 55), 40109#(<= ULTIMATE.start_main_~i~5 56), 40110#(<= ULTIMATE.start_main_~i~5 57), 40111#(<= ULTIMATE.start_main_~i~5 58), 40112#(<= ULTIMATE.start_main_~i~5 59), 40113#(<= ULTIMATE.start_main_~i~5 60), 40114#(<= ULTIMATE.start_main_~i~5 61), 40115#(<= ULTIMATE.start_main_~i~5 62), 40116#(<= ULTIMATE.start_main_~i~5 63), 40117#(<= ULTIMATE.start_main_~i~5 64), 40118#(<= ULTIMATE.start_main_~i~5 65), 40119#(<= ULTIMATE.start_main_~i~5 66), 40120#(<= ULTIMATE.start_main_~i~5 67), 40121#(<= ULTIMATE.start_main_~i~5 68), 40122#(<= ULTIMATE.start_main_~i~5 69), 40123#(<= ULTIMATE.start_main_~i~5 70), 40124#(<= ULTIMATE.start_main_~i~5 71), 40125#(<= ULTIMATE.start_main_~i~5 72), 40126#(<= ULTIMATE.start_main_~i~5 73), 40127#(<= ULTIMATE.start_main_~i~5 74), 40128#(<= ULTIMATE.start_main_~i~5 75), 40129#(<= ULTIMATE.start_main_~i~5 76), 40130#(<= ULTIMATE.start_main_~i~5 77), 40131#(<= ULTIMATE.start_main_~i~5 78), 40132#(<= ULTIMATE.start_main_~i~5 79), 40133#(<= ULTIMATE.start_main_~i~5 80), 40134#(<= ULTIMATE.start_main_~i~5 81), 40135#(<= ULTIMATE.start_main_~i~5 82), 40136#(<= ULTIMATE.start_main_~i~5 83), 40137#(<= ULTIMATE.start_main_~i~5 84), 40138#(<= ULTIMATE.start_main_~i~5 85), 40139#(<= ULTIMATE.start_main_~i~5 86), 40140#(<= ULTIMATE.start_main_~i~5 87), 40141#(<= ULTIMATE.start_main_~i~5 88), 40142#(<= ULTIMATE.start_main_~i~5 89), 40143#(<= ULTIMATE.start_main_~i~5 90), 40144#(<= ULTIMATE.start_main_~i~5 91), 40051#true, 40052#false, 40053#(<= ULTIMATE.start_main_~i~5 0), 40054#(<= ULTIMATE.start_main_~i~5 1), 40055#(<= ULTIMATE.start_main_~i~5 2), 40056#(<= ULTIMATE.start_main_~i~5 3), 40057#(<= ULTIMATE.start_main_~i~5 4), 40058#(<= ULTIMATE.start_main_~i~5 5), 40059#(<= ULTIMATE.start_main_~i~5 6), 40060#(<= ULTIMATE.start_main_~i~5 7), 40061#(<= ULTIMATE.start_main_~i~5 8), 40062#(<= ULTIMATE.start_main_~i~5 9), 40063#(<= ULTIMATE.start_main_~i~5 10)] [2018-07-23 13:50:31,738 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:31,738 INFO L450 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-23 13:50:31,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-23 13:50:31,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 13:50:31,740 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 94 states. [2018-07-23 13:50:31,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:31,963 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-07-23 13:50:31,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-23 13:50:31,963 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2018-07-23 13:50:31,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:31,965 INFO L225 Difference]: With dead ends: 191 [2018-07-23 13:50:31,965 INFO L226 Difference]: Without dead ends: 189 [2018-07-23 13:50:31,966 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 13:50:31,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-07-23 13:50:31,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-07-23 13:50:31,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-07-23 13:50:31,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-07-23 13:50:31,971 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2018-07-23 13:50:31,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:31,971 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-07-23 13:50:31,971 INFO L472 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-23 13:50:31,971 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-07-23 13:50:31,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-07-23 13:50:31,972 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:31,973 INFO L357 BasicCegarLoop]: trace histogram [93, 92, 1, 1, 1] [2018-07-23 13:50:31,973 INFO L414 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:31,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1974600853, now seen corresponding path program 92 times [2018-07-23 13:50:31,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:32,299 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:32,300 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:32,300 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-23 13:50:32,300 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:32,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:32,301 INFO L185 omatonBuilderFactory]: Interpolants [40960#(<= ULTIMATE.start_main_~i~5 53), 40961#(<= ULTIMATE.start_main_~i~5 54), 40962#(<= ULTIMATE.start_main_~i~5 55), 40963#(<= ULTIMATE.start_main_~i~5 56), 40964#(<= ULTIMATE.start_main_~i~5 57), 40965#(<= ULTIMATE.start_main_~i~5 58), 40966#(<= ULTIMATE.start_main_~i~5 59), 40967#(<= ULTIMATE.start_main_~i~5 60), 40968#(<= ULTIMATE.start_main_~i~5 61), 40969#(<= ULTIMATE.start_main_~i~5 62), 40970#(<= ULTIMATE.start_main_~i~5 63), 40971#(<= ULTIMATE.start_main_~i~5 64), 40972#(<= ULTIMATE.start_main_~i~5 65), 40973#(<= ULTIMATE.start_main_~i~5 66), 40974#(<= ULTIMATE.start_main_~i~5 67), 40975#(<= ULTIMATE.start_main_~i~5 68), 40976#(<= ULTIMATE.start_main_~i~5 69), 40977#(<= ULTIMATE.start_main_~i~5 70), 40978#(<= ULTIMATE.start_main_~i~5 71), 40979#(<= ULTIMATE.start_main_~i~5 72), 40980#(<= ULTIMATE.start_main_~i~5 73), 40981#(<= ULTIMATE.start_main_~i~5 74), 40982#(<= ULTIMATE.start_main_~i~5 75), 40983#(<= ULTIMATE.start_main_~i~5 76), 40984#(<= ULTIMATE.start_main_~i~5 77), 40985#(<= ULTIMATE.start_main_~i~5 78), 40986#(<= ULTIMATE.start_main_~i~5 79), 40987#(<= ULTIMATE.start_main_~i~5 80), 40988#(<= ULTIMATE.start_main_~i~5 81), 40989#(<= ULTIMATE.start_main_~i~5 82), 40990#(<= ULTIMATE.start_main_~i~5 83), 40991#(<= ULTIMATE.start_main_~i~5 84), 40992#(<= ULTIMATE.start_main_~i~5 85), 40993#(<= ULTIMATE.start_main_~i~5 86), 40994#(<= ULTIMATE.start_main_~i~5 87), 40995#(<= ULTIMATE.start_main_~i~5 88), 40996#(<= ULTIMATE.start_main_~i~5 89), 40997#(<= ULTIMATE.start_main_~i~5 90), 40998#(<= ULTIMATE.start_main_~i~5 91), 40999#(<= ULTIMATE.start_main_~i~5 92), 40905#true, 40906#false, 40907#(<= ULTIMATE.start_main_~i~5 0), 40908#(<= ULTIMATE.start_main_~i~5 1), 40909#(<= ULTIMATE.start_main_~i~5 2), 40910#(<= ULTIMATE.start_main_~i~5 3), 40911#(<= ULTIMATE.start_main_~i~5 4), 40912#(<= ULTIMATE.start_main_~i~5 5), 40913#(<= ULTIMATE.start_main_~i~5 6), 40914#(<= ULTIMATE.start_main_~i~5 7), 40915#(<= ULTIMATE.start_main_~i~5 8), 40916#(<= ULTIMATE.start_main_~i~5 9), 40917#(<= ULTIMATE.start_main_~i~5 10), 40918#(<= ULTIMATE.start_main_~i~5 11), 40919#(<= ULTIMATE.start_main_~i~5 12), 40920#(<= ULTIMATE.start_main_~i~5 13), 40921#(<= ULTIMATE.start_main_~i~5 14), 40922#(<= ULTIMATE.start_main_~i~5 15), 40923#(<= ULTIMATE.start_main_~i~5 16), 40924#(<= ULTIMATE.start_main_~i~5 17), 40925#(<= ULTIMATE.start_main_~i~5 18), 40926#(<= ULTIMATE.start_main_~i~5 19), 40927#(<= ULTIMATE.start_main_~i~5 20), 40928#(<= ULTIMATE.start_main_~i~5 21), 40929#(<= ULTIMATE.start_main_~i~5 22), 40930#(<= ULTIMATE.start_main_~i~5 23), 40931#(<= ULTIMATE.start_main_~i~5 24), 40932#(<= ULTIMATE.start_main_~i~5 25), 40933#(<= ULTIMATE.start_main_~i~5 26), 40934#(<= ULTIMATE.start_main_~i~5 27), 40935#(<= ULTIMATE.start_main_~i~5 28), 40936#(<= ULTIMATE.start_main_~i~5 29), 40937#(<= ULTIMATE.start_main_~i~5 30), 40938#(<= ULTIMATE.start_main_~i~5 31), 40939#(<= ULTIMATE.start_main_~i~5 32), 40940#(<= ULTIMATE.start_main_~i~5 33), 40941#(<= ULTIMATE.start_main_~i~5 34), 40942#(<= ULTIMATE.start_main_~i~5 35), 40943#(<= ULTIMATE.start_main_~i~5 36), 40944#(<= ULTIMATE.start_main_~i~5 37), 40945#(<= ULTIMATE.start_main_~i~5 38), 40946#(<= ULTIMATE.start_main_~i~5 39), 40947#(<= ULTIMATE.start_main_~i~5 40), 40948#(<= ULTIMATE.start_main_~i~5 41), 40949#(<= ULTIMATE.start_main_~i~5 42), 40950#(<= ULTIMATE.start_main_~i~5 43), 40951#(<= ULTIMATE.start_main_~i~5 44), 40952#(<= ULTIMATE.start_main_~i~5 45), 40953#(<= ULTIMATE.start_main_~i~5 46), 40954#(<= ULTIMATE.start_main_~i~5 47), 40955#(<= ULTIMATE.start_main_~i~5 48), 40956#(<= ULTIMATE.start_main_~i~5 49), 40957#(<= ULTIMATE.start_main_~i~5 50), 40958#(<= ULTIMATE.start_main_~i~5 51), 40959#(<= ULTIMATE.start_main_~i~5 52)] [2018-07-23 13:50:32,301 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:32,302 INFO L450 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-23 13:50:32,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-23 13:50:32,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 13:50:32,303 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 95 states. [2018-07-23 13:50:32,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:32,392 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-07-23 13:50:32,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-23 13:50:32,393 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2018-07-23 13:50:32,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:32,394 INFO L225 Difference]: With dead ends: 193 [2018-07-23 13:50:32,394 INFO L226 Difference]: Without dead ends: 191 [2018-07-23 13:50:32,395 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 13:50:32,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-07-23 13:50:32,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-07-23 13:50:32,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-07-23 13:50:32,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-07-23 13:50:32,400 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2018-07-23 13:50:32,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:32,400 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-07-23 13:50:32,401 INFO L472 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-23 13:50:32,401 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-07-23 13:50:32,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-07-23 13:50:32,402 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:32,402 INFO L357 BasicCegarLoop]: trace histogram [94, 93, 1, 1, 1] [2018-07-23 13:50:32,402 INFO L414 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:32,402 INFO L82 PathProgramCache]: Analyzing trace with hash -784192111, now seen corresponding path program 93 times [2018-07-23 13:50:32,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:32,743 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:32,743 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:32,743 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-23 13:50:32,743 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:32,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:32,744 INFO L185 omatonBuilderFactory]: Interpolants [41856#(<= ULTIMATE.start_main_~i~5 86), 41857#(<= ULTIMATE.start_main_~i~5 87), 41858#(<= ULTIMATE.start_main_~i~5 88), 41859#(<= ULTIMATE.start_main_~i~5 89), 41860#(<= ULTIMATE.start_main_~i~5 90), 41861#(<= ULTIMATE.start_main_~i~5 91), 41862#(<= ULTIMATE.start_main_~i~5 92), 41863#(<= ULTIMATE.start_main_~i~5 93), 41768#true, 41769#false, 41770#(<= ULTIMATE.start_main_~i~5 0), 41771#(<= ULTIMATE.start_main_~i~5 1), 41772#(<= ULTIMATE.start_main_~i~5 2), 41773#(<= ULTIMATE.start_main_~i~5 3), 41774#(<= ULTIMATE.start_main_~i~5 4), 41775#(<= ULTIMATE.start_main_~i~5 5), 41776#(<= ULTIMATE.start_main_~i~5 6), 41777#(<= ULTIMATE.start_main_~i~5 7), 41778#(<= ULTIMATE.start_main_~i~5 8), 41779#(<= ULTIMATE.start_main_~i~5 9), 41780#(<= ULTIMATE.start_main_~i~5 10), 41781#(<= ULTIMATE.start_main_~i~5 11), 41782#(<= ULTIMATE.start_main_~i~5 12), 41783#(<= ULTIMATE.start_main_~i~5 13), 41784#(<= ULTIMATE.start_main_~i~5 14), 41785#(<= ULTIMATE.start_main_~i~5 15), 41786#(<= ULTIMATE.start_main_~i~5 16), 41787#(<= ULTIMATE.start_main_~i~5 17), 41788#(<= ULTIMATE.start_main_~i~5 18), 41789#(<= ULTIMATE.start_main_~i~5 19), 41790#(<= ULTIMATE.start_main_~i~5 20), 41791#(<= ULTIMATE.start_main_~i~5 21), 41792#(<= ULTIMATE.start_main_~i~5 22), 41793#(<= ULTIMATE.start_main_~i~5 23), 41794#(<= ULTIMATE.start_main_~i~5 24), 41795#(<= ULTIMATE.start_main_~i~5 25), 41796#(<= ULTIMATE.start_main_~i~5 26), 41797#(<= ULTIMATE.start_main_~i~5 27), 41798#(<= ULTIMATE.start_main_~i~5 28), 41799#(<= ULTIMATE.start_main_~i~5 29), 41800#(<= ULTIMATE.start_main_~i~5 30), 41801#(<= ULTIMATE.start_main_~i~5 31), 41802#(<= ULTIMATE.start_main_~i~5 32), 41803#(<= ULTIMATE.start_main_~i~5 33), 41804#(<= ULTIMATE.start_main_~i~5 34), 41805#(<= ULTIMATE.start_main_~i~5 35), 41806#(<= ULTIMATE.start_main_~i~5 36), 41807#(<= ULTIMATE.start_main_~i~5 37), 41808#(<= ULTIMATE.start_main_~i~5 38), 41809#(<= ULTIMATE.start_main_~i~5 39), 41810#(<= ULTIMATE.start_main_~i~5 40), 41811#(<= ULTIMATE.start_main_~i~5 41), 41812#(<= ULTIMATE.start_main_~i~5 42), 41813#(<= ULTIMATE.start_main_~i~5 43), 41814#(<= ULTIMATE.start_main_~i~5 44), 41815#(<= ULTIMATE.start_main_~i~5 45), 41816#(<= ULTIMATE.start_main_~i~5 46), 41817#(<= ULTIMATE.start_main_~i~5 47), 41818#(<= ULTIMATE.start_main_~i~5 48), 41819#(<= ULTIMATE.start_main_~i~5 49), 41820#(<= ULTIMATE.start_main_~i~5 50), 41821#(<= ULTIMATE.start_main_~i~5 51), 41822#(<= ULTIMATE.start_main_~i~5 52), 41823#(<= ULTIMATE.start_main_~i~5 53), 41824#(<= ULTIMATE.start_main_~i~5 54), 41825#(<= ULTIMATE.start_main_~i~5 55), 41826#(<= ULTIMATE.start_main_~i~5 56), 41827#(<= ULTIMATE.start_main_~i~5 57), 41828#(<= ULTIMATE.start_main_~i~5 58), 41829#(<= ULTIMATE.start_main_~i~5 59), 41830#(<= ULTIMATE.start_main_~i~5 60), 41831#(<= ULTIMATE.start_main_~i~5 61), 41832#(<= ULTIMATE.start_main_~i~5 62), 41833#(<= ULTIMATE.start_main_~i~5 63), 41834#(<= ULTIMATE.start_main_~i~5 64), 41835#(<= ULTIMATE.start_main_~i~5 65), 41836#(<= ULTIMATE.start_main_~i~5 66), 41837#(<= ULTIMATE.start_main_~i~5 67), 41838#(<= ULTIMATE.start_main_~i~5 68), 41839#(<= ULTIMATE.start_main_~i~5 69), 41840#(<= ULTIMATE.start_main_~i~5 70), 41841#(<= ULTIMATE.start_main_~i~5 71), 41842#(<= ULTIMATE.start_main_~i~5 72), 41843#(<= ULTIMATE.start_main_~i~5 73), 41844#(<= ULTIMATE.start_main_~i~5 74), 41845#(<= ULTIMATE.start_main_~i~5 75), 41846#(<= ULTIMATE.start_main_~i~5 76), 41847#(<= ULTIMATE.start_main_~i~5 77), 41848#(<= ULTIMATE.start_main_~i~5 78), 41849#(<= ULTIMATE.start_main_~i~5 79), 41850#(<= ULTIMATE.start_main_~i~5 80), 41851#(<= ULTIMATE.start_main_~i~5 81), 41852#(<= ULTIMATE.start_main_~i~5 82), 41853#(<= ULTIMATE.start_main_~i~5 83), 41854#(<= ULTIMATE.start_main_~i~5 84), 41855#(<= ULTIMATE.start_main_~i~5 85)] [2018-07-23 13:50:32,744 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:32,744 INFO L450 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-23 13:50:32,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-23 13:50:32,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 13:50:32,745 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 96 states. [2018-07-23 13:50:32,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:32,847 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-07-23 13:50:32,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-23 13:50:32,847 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2018-07-23 13:50:32,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:32,849 INFO L225 Difference]: With dead ends: 195 [2018-07-23 13:50:32,850 INFO L226 Difference]: Without dead ends: 193 [2018-07-23 13:50:32,852 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 13:50:32,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-07-23 13:50:32,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-07-23 13:50:32,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-07-23 13:50:32,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-07-23 13:50:32,859 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 190 [2018-07-23 13:50:32,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:32,859 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-07-23 13:50:32,860 INFO L472 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-23 13:50:32,860 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-07-23 13:50:32,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-07-23 13:50:32,861 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:32,861 INFO L357 BasicCegarLoop]: trace histogram [95, 94, 1, 1, 1] [2018-07-23 13:50:32,861 INFO L414 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:32,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1989408883, now seen corresponding path program 94 times [2018-07-23 13:50:32,861 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:33,296 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:33,297 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:33,297 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-23 13:50:33,297 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:33,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:33,297 INFO L185 omatonBuilderFactory]: Interpolants [42640#true, 42641#false, 42642#(<= ULTIMATE.start_main_~i~5 0), 42643#(<= ULTIMATE.start_main_~i~5 1), 42644#(<= ULTIMATE.start_main_~i~5 2), 42645#(<= ULTIMATE.start_main_~i~5 3), 42646#(<= ULTIMATE.start_main_~i~5 4), 42647#(<= ULTIMATE.start_main_~i~5 5), 42648#(<= ULTIMATE.start_main_~i~5 6), 42649#(<= ULTIMATE.start_main_~i~5 7), 42650#(<= ULTIMATE.start_main_~i~5 8), 42651#(<= ULTIMATE.start_main_~i~5 9), 42652#(<= ULTIMATE.start_main_~i~5 10), 42653#(<= ULTIMATE.start_main_~i~5 11), 42654#(<= ULTIMATE.start_main_~i~5 12), 42655#(<= ULTIMATE.start_main_~i~5 13), 42656#(<= ULTIMATE.start_main_~i~5 14), 42657#(<= ULTIMATE.start_main_~i~5 15), 42658#(<= ULTIMATE.start_main_~i~5 16), 42659#(<= ULTIMATE.start_main_~i~5 17), 42660#(<= ULTIMATE.start_main_~i~5 18), 42661#(<= ULTIMATE.start_main_~i~5 19), 42662#(<= ULTIMATE.start_main_~i~5 20), 42663#(<= ULTIMATE.start_main_~i~5 21), 42664#(<= ULTIMATE.start_main_~i~5 22), 42665#(<= ULTIMATE.start_main_~i~5 23), 42666#(<= ULTIMATE.start_main_~i~5 24), 42667#(<= ULTIMATE.start_main_~i~5 25), 42668#(<= ULTIMATE.start_main_~i~5 26), 42669#(<= ULTIMATE.start_main_~i~5 27), 42670#(<= ULTIMATE.start_main_~i~5 28), 42671#(<= ULTIMATE.start_main_~i~5 29), 42672#(<= ULTIMATE.start_main_~i~5 30), 42673#(<= ULTIMATE.start_main_~i~5 31), 42674#(<= ULTIMATE.start_main_~i~5 32), 42675#(<= ULTIMATE.start_main_~i~5 33), 42676#(<= ULTIMATE.start_main_~i~5 34), 42677#(<= ULTIMATE.start_main_~i~5 35), 42678#(<= ULTIMATE.start_main_~i~5 36), 42679#(<= ULTIMATE.start_main_~i~5 37), 42680#(<= ULTIMATE.start_main_~i~5 38), 42681#(<= ULTIMATE.start_main_~i~5 39), 42682#(<= ULTIMATE.start_main_~i~5 40), 42683#(<= ULTIMATE.start_main_~i~5 41), 42684#(<= ULTIMATE.start_main_~i~5 42), 42685#(<= ULTIMATE.start_main_~i~5 43), 42686#(<= ULTIMATE.start_main_~i~5 44), 42687#(<= ULTIMATE.start_main_~i~5 45), 42688#(<= ULTIMATE.start_main_~i~5 46), 42689#(<= ULTIMATE.start_main_~i~5 47), 42690#(<= ULTIMATE.start_main_~i~5 48), 42691#(<= ULTIMATE.start_main_~i~5 49), 42692#(<= ULTIMATE.start_main_~i~5 50), 42693#(<= ULTIMATE.start_main_~i~5 51), 42694#(<= ULTIMATE.start_main_~i~5 52), 42695#(<= ULTIMATE.start_main_~i~5 53), 42696#(<= ULTIMATE.start_main_~i~5 54), 42697#(<= ULTIMATE.start_main_~i~5 55), 42698#(<= ULTIMATE.start_main_~i~5 56), 42699#(<= ULTIMATE.start_main_~i~5 57), 42700#(<= ULTIMATE.start_main_~i~5 58), 42701#(<= ULTIMATE.start_main_~i~5 59), 42702#(<= ULTIMATE.start_main_~i~5 60), 42703#(<= ULTIMATE.start_main_~i~5 61), 42704#(<= ULTIMATE.start_main_~i~5 62), 42705#(<= ULTIMATE.start_main_~i~5 63), 42706#(<= ULTIMATE.start_main_~i~5 64), 42707#(<= ULTIMATE.start_main_~i~5 65), 42708#(<= ULTIMATE.start_main_~i~5 66), 42709#(<= ULTIMATE.start_main_~i~5 67), 42710#(<= ULTIMATE.start_main_~i~5 68), 42711#(<= ULTIMATE.start_main_~i~5 69), 42712#(<= ULTIMATE.start_main_~i~5 70), 42713#(<= ULTIMATE.start_main_~i~5 71), 42714#(<= ULTIMATE.start_main_~i~5 72), 42715#(<= ULTIMATE.start_main_~i~5 73), 42716#(<= ULTIMATE.start_main_~i~5 74), 42717#(<= ULTIMATE.start_main_~i~5 75), 42718#(<= ULTIMATE.start_main_~i~5 76), 42719#(<= ULTIMATE.start_main_~i~5 77), 42720#(<= ULTIMATE.start_main_~i~5 78), 42721#(<= ULTIMATE.start_main_~i~5 79), 42722#(<= ULTIMATE.start_main_~i~5 80), 42723#(<= ULTIMATE.start_main_~i~5 81), 42724#(<= ULTIMATE.start_main_~i~5 82), 42725#(<= ULTIMATE.start_main_~i~5 83), 42726#(<= ULTIMATE.start_main_~i~5 84), 42727#(<= ULTIMATE.start_main_~i~5 85), 42728#(<= ULTIMATE.start_main_~i~5 86), 42729#(<= ULTIMATE.start_main_~i~5 87), 42730#(<= ULTIMATE.start_main_~i~5 88), 42731#(<= ULTIMATE.start_main_~i~5 89), 42732#(<= ULTIMATE.start_main_~i~5 90), 42733#(<= ULTIMATE.start_main_~i~5 91), 42734#(<= ULTIMATE.start_main_~i~5 92), 42735#(<= ULTIMATE.start_main_~i~5 93), 42736#(<= ULTIMATE.start_main_~i~5 94)] [2018-07-23 13:50:33,298 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:33,298 INFO L450 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-23 13:50:33,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-23 13:50:33,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 13:50:33,300 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 97 states. [2018-07-23 13:50:33,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:33,453 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-07-23 13:50:33,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-23 13:50:33,453 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2018-07-23 13:50:33,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:33,455 INFO L225 Difference]: With dead ends: 197 [2018-07-23 13:50:33,455 INFO L226 Difference]: Without dead ends: 195 [2018-07-23 13:50:33,456 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 13:50:33,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-07-23 13:50:33,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-07-23 13:50:33,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-07-23 13:50:33,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-07-23 13:50:33,460 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 192 [2018-07-23 13:50:33,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:33,461 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-07-23 13:50:33,461 INFO L472 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-23 13:50:33,461 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-07-23 13:50:33,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-07-23 13:50:33,462 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:33,462 INFO L357 BasicCegarLoop]: trace histogram [96, 95, 1, 1, 1] [2018-07-23 13:50:33,462 INFO L414 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:33,462 INFO L82 PathProgramCache]: Analyzing trace with hash -561556855, now seen corresponding path program 95 times [2018-07-23 13:50:33,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:33,862 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:33,863 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:33,863 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-23 13:50:33,863 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:33,864 INFO L185 omatonBuilderFactory]: Interpolants [43521#true, 43522#false, 43523#(<= ULTIMATE.start_main_~i~5 0), 43524#(<= ULTIMATE.start_main_~i~5 1), 43525#(<= ULTIMATE.start_main_~i~5 2), 43526#(<= ULTIMATE.start_main_~i~5 3), 43527#(<= ULTIMATE.start_main_~i~5 4), 43528#(<= ULTIMATE.start_main_~i~5 5), 43529#(<= ULTIMATE.start_main_~i~5 6), 43530#(<= ULTIMATE.start_main_~i~5 7), 43531#(<= ULTIMATE.start_main_~i~5 8), 43532#(<= ULTIMATE.start_main_~i~5 9), 43533#(<= ULTIMATE.start_main_~i~5 10), 43534#(<= ULTIMATE.start_main_~i~5 11), 43535#(<= ULTIMATE.start_main_~i~5 12), 43536#(<= ULTIMATE.start_main_~i~5 13), 43537#(<= ULTIMATE.start_main_~i~5 14), 43538#(<= ULTIMATE.start_main_~i~5 15), 43539#(<= ULTIMATE.start_main_~i~5 16), 43540#(<= ULTIMATE.start_main_~i~5 17), 43541#(<= ULTIMATE.start_main_~i~5 18), 43542#(<= ULTIMATE.start_main_~i~5 19), 43543#(<= ULTIMATE.start_main_~i~5 20), 43544#(<= ULTIMATE.start_main_~i~5 21), 43545#(<= ULTIMATE.start_main_~i~5 22), 43546#(<= ULTIMATE.start_main_~i~5 23), 43547#(<= ULTIMATE.start_main_~i~5 24), 43548#(<= ULTIMATE.start_main_~i~5 25), 43549#(<= ULTIMATE.start_main_~i~5 26), 43550#(<= ULTIMATE.start_main_~i~5 27), 43551#(<= ULTIMATE.start_main_~i~5 28), 43552#(<= ULTIMATE.start_main_~i~5 29), 43553#(<= ULTIMATE.start_main_~i~5 30), 43554#(<= ULTIMATE.start_main_~i~5 31), 43555#(<= ULTIMATE.start_main_~i~5 32), 43556#(<= ULTIMATE.start_main_~i~5 33), 43557#(<= ULTIMATE.start_main_~i~5 34), 43558#(<= ULTIMATE.start_main_~i~5 35), 43559#(<= ULTIMATE.start_main_~i~5 36), 43560#(<= ULTIMATE.start_main_~i~5 37), 43561#(<= ULTIMATE.start_main_~i~5 38), 43562#(<= ULTIMATE.start_main_~i~5 39), 43563#(<= ULTIMATE.start_main_~i~5 40), 43564#(<= ULTIMATE.start_main_~i~5 41), 43565#(<= ULTIMATE.start_main_~i~5 42), 43566#(<= ULTIMATE.start_main_~i~5 43), 43567#(<= ULTIMATE.start_main_~i~5 44), 43568#(<= ULTIMATE.start_main_~i~5 45), 43569#(<= ULTIMATE.start_main_~i~5 46), 43570#(<= ULTIMATE.start_main_~i~5 47), 43571#(<= ULTIMATE.start_main_~i~5 48), 43572#(<= ULTIMATE.start_main_~i~5 49), 43573#(<= ULTIMATE.start_main_~i~5 50), 43574#(<= ULTIMATE.start_main_~i~5 51), 43575#(<= ULTIMATE.start_main_~i~5 52), 43576#(<= ULTIMATE.start_main_~i~5 53), 43577#(<= ULTIMATE.start_main_~i~5 54), 43578#(<= ULTIMATE.start_main_~i~5 55), 43579#(<= ULTIMATE.start_main_~i~5 56), 43580#(<= ULTIMATE.start_main_~i~5 57), 43581#(<= ULTIMATE.start_main_~i~5 58), 43582#(<= ULTIMATE.start_main_~i~5 59), 43583#(<= ULTIMATE.start_main_~i~5 60), 43584#(<= ULTIMATE.start_main_~i~5 61), 43585#(<= ULTIMATE.start_main_~i~5 62), 43586#(<= ULTIMATE.start_main_~i~5 63), 43587#(<= ULTIMATE.start_main_~i~5 64), 43588#(<= ULTIMATE.start_main_~i~5 65), 43589#(<= ULTIMATE.start_main_~i~5 66), 43590#(<= ULTIMATE.start_main_~i~5 67), 43591#(<= ULTIMATE.start_main_~i~5 68), 43592#(<= ULTIMATE.start_main_~i~5 69), 43593#(<= ULTIMATE.start_main_~i~5 70), 43594#(<= ULTIMATE.start_main_~i~5 71), 43595#(<= ULTIMATE.start_main_~i~5 72), 43596#(<= ULTIMATE.start_main_~i~5 73), 43597#(<= ULTIMATE.start_main_~i~5 74), 43598#(<= ULTIMATE.start_main_~i~5 75), 43599#(<= ULTIMATE.start_main_~i~5 76), 43600#(<= ULTIMATE.start_main_~i~5 77), 43601#(<= ULTIMATE.start_main_~i~5 78), 43602#(<= ULTIMATE.start_main_~i~5 79), 43603#(<= ULTIMATE.start_main_~i~5 80), 43604#(<= ULTIMATE.start_main_~i~5 81), 43605#(<= ULTIMATE.start_main_~i~5 82), 43606#(<= ULTIMATE.start_main_~i~5 83), 43607#(<= ULTIMATE.start_main_~i~5 84), 43608#(<= ULTIMATE.start_main_~i~5 85), 43609#(<= ULTIMATE.start_main_~i~5 86), 43610#(<= ULTIMATE.start_main_~i~5 87), 43611#(<= ULTIMATE.start_main_~i~5 88), 43612#(<= ULTIMATE.start_main_~i~5 89), 43613#(<= ULTIMATE.start_main_~i~5 90), 43614#(<= ULTIMATE.start_main_~i~5 91), 43615#(<= ULTIMATE.start_main_~i~5 92), 43616#(<= ULTIMATE.start_main_~i~5 93), 43617#(<= ULTIMATE.start_main_~i~5 94), 43618#(<= ULTIMATE.start_main_~i~5 95)] [2018-07-23 13:50:33,864 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:33,864 INFO L450 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-23 13:50:33,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-23 13:50:33,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-23 13:50:33,866 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 98 states. [2018-07-23 13:50:34,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:34,033 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-07-23 13:50:34,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-23 13:50:34,034 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2018-07-23 13:50:34,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:34,035 INFO L225 Difference]: With dead ends: 199 [2018-07-23 13:50:34,035 INFO L226 Difference]: Without dead ends: 197 [2018-07-23 13:50:34,036 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-23 13:50:34,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-07-23 13:50:34,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-07-23 13:50:34,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-07-23 13:50:34,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-07-23 13:50:34,043 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 194 [2018-07-23 13:50:34,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:34,043 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-07-23 13:50:34,043 INFO L472 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-23 13:50:34,043 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-07-23 13:50:34,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-07-23 13:50:34,045 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:34,045 INFO L357 BasicCegarLoop]: trace histogram [97, 96, 1, 1, 1] [2018-07-23 13:50:34,045 INFO L414 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:34,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1509674629, now seen corresponding path program 96 times [2018-07-23 13:50:34,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:34,487 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:34,487 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:34,487 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-23 13:50:34,488 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:34,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:34,488 INFO L185 omatonBuilderFactory]: Interpolants [44411#true, 44412#false, 44413#(<= ULTIMATE.start_main_~i~5 0), 44414#(<= ULTIMATE.start_main_~i~5 1), 44415#(<= ULTIMATE.start_main_~i~5 2), 44416#(<= ULTIMATE.start_main_~i~5 3), 44417#(<= ULTIMATE.start_main_~i~5 4), 44418#(<= ULTIMATE.start_main_~i~5 5), 44419#(<= ULTIMATE.start_main_~i~5 6), 44420#(<= ULTIMATE.start_main_~i~5 7), 44421#(<= ULTIMATE.start_main_~i~5 8), 44422#(<= ULTIMATE.start_main_~i~5 9), 44423#(<= ULTIMATE.start_main_~i~5 10), 44424#(<= ULTIMATE.start_main_~i~5 11), 44425#(<= ULTIMATE.start_main_~i~5 12), 44426#(<= ULTIMATE.start_main_~i~5 13), 44427#(<= ULTIMATE.start_main_~i~5 14), 44428#(<= ULTIMATE.start_main_~i~5 15), 44429#(<= ULTIMATE.start_main_~i~5 16), 44430#(<= ULTIMATE.start_main_~i~5 17), 44431#(<= ULTIMATE.start_main_~i~5 18), 44432#(<= ULTIMATE.start_main_~i~5 19), 44433#(<= ULTIMATE.start_main_~i~5 20), 44434#(<= ULTIMATE.start_main_~i~5 21), 44435#(<= ULTIMATE.start_main_~i~5 22), 44436#(<= ULTIMATE.start_main_~i~5 23), 44437#(<= ULTIMATE.start_main_~i~5 24), 44438#(<= ULTIMATE.start_main_~i~5 25), 44439#(<= ULTIMATE.start_main_~i~5 26), 44440#(<= ULTIMATE.start_main_~i~5 27), 44441#(<= ULTIMATE.start_main_~i~5 28), 44442#(<= ULTIMATE.start_main_~i~5 29), 44443#(<= ULTIMATE.start_main_~i~5 30), 44444#(<= ULTIMATE.start_main_~i~5 31), 44445#(<= ULTIMATE.start_main_~i~5 32), 44446#(<= ULTIMATE.start_main_~i~5 33), 44447#(<= ULTIMATE.start_main_~i~5 34), 44448#(<= ULTIMATE.start_main_~i~5 35), 44449#(<= ULTIMATE.start_main_~i~5 36), 44450#(<= ULTIMATE.start_main_~i~5 37), 44451#(<= ULTIMATE.start_main_~i~5 38), 44452#(<= ULTIMATE.start_main_~i~5 39), 44453#(<= ULTIMATE.start_main_~i~5 40), 44454#(<= ULTIMATE.start_main_~i~5 41), 44455#(<= ULTIMATE.start_main_~i~5 42), 44456#(<= ULTIMATE.start_main_~i~5 43), 44457#(<= ULTIMATE.start_main_~i~5 44), 44458#(<= ULTIMATE.start_main_~i~5 45), 44459#(<= ULTIMATE.start_main_~i~5 46), 44460#(<= ULTIMATE.start_main_~i~5 47), 44461#(<= ULTIMATE.start_main_~i~5 48), 44462#(<= ULTIMATE.start_main_~i~5 49), 44463#(<= ULTIMATE.start_main_~i~5 50), 44464#(<= ULTIMATE.start_main_~i~5 51), 44465#(<= ULTIMATE.start_main_~i~5 52), 44466#(<= ULTIMATE.start_main_~i~5 53), 44467#(<= ULTIMATE.start_main_~i~5 54), 44468#(<= ULTIMATE.start_main_~i~5 55), 44469#(<= ULTIMATE.start_main_~i~5 56), 44470#(<= ULTIMATE.start_main_~i~5 57), 44471#(<= ULTIMATE.start_main_~i~5 58), 44472#(<= ULTIMATE.start_main_~i~5 59), 44473#(<= ULTIMATE.start_main_~i~5 60), 44474#(<= ULTIMATE.start_main_~i~5 61), 44475#(<= ULTIMATE.start_main_~i~5 62), 44476#(<= ULTIMATE.start_main_~i~5 63), 44477#(<= ULTIMATE.start_main_~i~5 64), 44478#(<= ULTIMATE.start_main_~i~5 65), 44479#(<= ULTIMATE.start_main_~i~5 66), 44480#(<= ULTIMATE.start_main_~i~5 67), 44481#(<= ULTIMATE.start_main_~i~5 68), 44482#(<= ULTIMATE.start_main_~i~5 69), 44483#(<= ULTIMATE.start_main_~i~5 70), 44484#(<= ULTIMATE.start_main_~i~5 71), 44485#(<= ULTIMATE.start_main_~i~5 72), 44486#(<= ULTIMATE.start_main_~i~5 73), 44487#(<= ULTIMATE.start_main_~i~5 74), 44488#(<= ULTIMATE.start_main_~i~5 75), 44489#(<= ULTIMATE.start_main_~i~5 76), 44490#(<= ULTIMATE.start_main_~i~5 77), 44491#(<= ULTIMATE.start_main_~i~5 78), 44492#(<= ULTIMATE.start_main_~i~5 79), 44493#(<= ULTIMATE.start_main_~i~5 80), 44494#(<= ULTIMATE.start_main_~i~5 81), 44495#(<= ULTIMATE.start_main_~i~5 82), 44496#(<= ULTIMATE.start_main_~i~5 83), 44497#(<= ULTIMATE.start_main_~i~5 84), 44498#(<= ULTIMATE.start_main_~i~5 85), 44499#(<= ULTIMATE.start_main_~i~5 86), 44500#(<= ULTIMATE.start_main_~i~5 87), 44501#(<= ULTIMATE.start_main_~i~5 88), 44502#(<= ULTIMATE.start_main_~i~5 89), 44503#(<= ULTIMATE.start_main_~i~5 90), 44504#(<= ULTIMATE.start_main_~i~5 91), 44505#(<= ULTIMATE.start_main_~i~5 92), 44506#(<= ULTIMATE.start_main_~i~5 93), 44507#(<= ULTIMATE.start_main_~i~5 94), 44508#(<= ULTIMATE.start_main_~i~5 95), 44509#(<= ULTIMATE.start_main_~i~5 96)] [2018-07-23 13:50:34,489 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:34,489 INFO L450 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-23 13:50:34,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-23 13:50:34,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 13:50:34,490 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 99 states. [2018-07-23 13:50:34,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:34,642 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-07-23 13:50:34,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-23 13:50:34,642 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2018-07-23 13:50:34,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:34,644 INFO L225 Difference]: With dead ends: 201 [2018-07-23 13:50:34,644 INFO L226 Difference]: Without dead ends: 199 [2018-07-23 13:50:34,645 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 13:50:34,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-07-23 13:50:34,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-07-23 13:50:34,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-07-23 13:50:34,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-07-23 13:50:34,650 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 196 [2018-07-23 13:50:34,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:34,650 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-07-23 13:50:34,650 INFO L472 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-23 13:50:34,650 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-07-23 13:50:34,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-07-23 13:50:34,651 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:34,651 INFO L357 BasicCegarLoop]: trace histogram [98, 97, 1, 1, 1] [2018-07-23 13:50:34,651 INFO L414 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:34,652 INFO L82 PathProgramCache]: Analyzing trace with hash -901694591, now seen corresponding path program 97 times [2018-07-23 13:50:34,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:34,952 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:34,952 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-23 13:50:34,952 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:34,953 INFO L185 omatonBuilderFactory]: Interpolants [45312#(<= ULTIMATE.start_main_~i~5 0), 45313#(<= ULTIMATE.start_main_~i~5 1), 45314#(<= ULTIMATE.start_main_~i~5 2), 45315#(<= ULTIMATE.start_main_~i~5 3), 45316#(<= ULTIMATE.start_main_~i~5 4), 45317#(<= ULTIMATE.start_main_~i~5 5), 45318#(<= ULTIMATE.start_main_~i~5 6), 45319#(<= ULTIMATE.start_main_~i~5 7), 45320#(<= ULTIMATE.start_main_~i~5 8), 45321#(<= ULTIMATE.start_main_~i~5 9), 45322#(<= ULTIMATE.start_main_~i~5 10), 45323#(<= ULTIMATE.start_main_~i~5 11), 45324#(<= ULTIMATE.start_main_~i~5 12), 45325#(<= ULTIMATE.start_main_~i~5 13), 45326#(<= ULTIMATE.start_main_~i~5 14), 45327#(<= ULTIMATE.start_main_~i~5 15), 45328#(<= ULTIMATE.start_main_~i~5 16), 45329#(<= ULTIMATE.start_main_~i~5 17), 45330#(<= ULTIMATE.start_main_~i~5 18), 45331#(<= ULTIMATE.start_main_~i~5 19), 45332#(<= ULTIMATE.start_main_~i~5 20), 45333#(<= ULTIMATE.start_main_~i~5 21), 45334#(<= ULTIMATE.start_main_~i~5 22), 45335#(<= ULTIMATE.start_main_~i~5 23), 45336#(<= ULTIMATE.start_main_~i~5 24), 45337#(<= ULTIMATE.start_main_~i~5 25), 45338#(<= ULTIMATE.start_main_~i~5 26), 45339#(<= ULTIMATE.start_main_~i~5 27), 45340#(<= ULTIMATE.start_main_~i~5 28), 45341#(<= ULTIMATE.start_main_~i~5 29), 45342#(<= ULTIMATE.start_main_~i~5 30), 45343#(<= ULTIMATE.start_main_~i~5 31), 45344#(<= ULTIMATE.start_main_~i~5 32), 45345#(<= ULTIMATE.start_main_~i~5 33), 45346#(<= ULTIMATE.start_main_~i~5 34), 45347#(<= ULTIMATE.start_main_~i~5 35), 45348#(<= ULTIMATE.start_main_~i~5 36), 45349#(<= ULTIMATE.start_main_~i~5 37), 45350#(<= ULTIMATE.start_main_~i~5 38), 45351#(<= ULTIMATE.start_main_~i~5 39), 45352#(<= ULTIMATE.start_main_~i~5 40), 45353#(<= ULTIMATE.start_main_~i~5 41), 45354#(<= ULTIMATE.start_main_~i~5 42), 45355#(<= ULTIMATE.start_main_~i~5 43), 45356#(<= ULTIMATE.start_main_~i~5 44), 45357#(<= ULTIMATE.start_main_~i~5 45), 45358#(<= ULTIMATE.start_main_~i~5 46), 45359#(<= ULTIMATE.start_main_~i~5 47), 45360#(<= ULTIMATE.start_main_~i~5 48), 45361#(<= ULTIMATE.start_main_~i~5 49), 45362#(<= ULTIMATE.start_main_~i~5 50), 45363#(<= ULTIMATE.start_main_~i~5 51), 45364#(<= ULTIMATE.start_main_~i~5 52), 45365#(<= ULTIMATE.start_main_~i~5 53), 45366#(<= ULTIMATE.start_main_~i~5 54), 45367#(<= ULTIMATE.start_main_~i~5 55), 45368#(<= ULTIMATE.start_main_~i~5 56), 45369#(<= ULTIMATE.start_main_~i~5 57), 45370#(<= ULTIMATE.start_main_~i~5 58), 45371#(<= ULTIMATE.start_main_~i~5 59), 45372#(<= ULTIMATE.start_main_~i~5 60), 45373#(<= ULTIMATE.start_main_~i~5 61), 45374#(<= ULTIMATE.start_main_~i~5 62), 45375#(<= ULTIMATE.start_main_~i~5 63), 45376#(<= ULTIMATE.start_main_~i~5 64), 45377#(<= ULTIMATE.start_main_~i~5 65), 45378#(<= ULTIMATE.start_main_~i~5 66), 45379#(<= ULTIMATE.start_main_~i~5 67), 45380#(<= ULTIMATE.start_main_~i~5 68), 45381#(<= ULTIMATE.start_main_~i~5 69), 45382#(<= ULTIMATE.start_main_~i~5 70), 45383#(<= ULTIMATE.start_main_~i~5 71), 45384#(<= ULTIMATE.start_main_~i~5 72), 45385#(<= ULTIMATE.start_main_~i~5 73), 45386#(<= ULTIMATE.start_main_~i~5 74), 45387#(<= ULTIMATE.start_main_~i~5 75), 45388#(<= ULTIMATE.start_main_~i~5 76), 45389#(<= ULTIMATE.start_main_~i~5 77), 45390#(<= ULTIMATE.start_main_~i~5 78), 45391#(<= ULTIMATE.start_main_~i~5 79), 45392#(<= ULTIMATE.start_main_~i~5 80), 45393#(<= ULTIMATE.start_main_~i~5 81), 45394#(<= ULTIMATE.start_main_~i~5 82), 45395#(<= ULTIMATE.start_main_~i~5 83), 45396#(<= ULTIMATE.start_main_~i~5 84), 45397#(<= ULTIMATE.start_main_~i~5 85), 45398#(<= ULTIMATE.start_main_~i~5 86), 45399#(<= ULTIMATE.start_main_~i~5 87), 45400#(<= ULTIMATE.start_main_~i~5 88), 45401#(<= ULTIMATE.start_main_~i~5 89), 45402#(<= ULTIMATE.start_main_~i~5 90), 45403#(<= ULTIMATE.start_main_~i~5 91), 45404#(<= ULTIMATE.start_main_~i~5 92), 45405#(<= ULTIMATE.start_main_~i~5 93), 45406#(<= ULTIMATE.start_main_~i~5 94), 45407#(<= ULTIMATE.start_main_~i~5 95), 45408#(<= ULTIMATE.start_main_~i~5 96), 45409#(<= ULTIMATE.start_main_~i~5 97), 45310#true, 45311#false] [2018-07-23 13:50:34,953 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:34,953 INFO L450 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-23 13:50:34,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-23 13:50:34,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 13:50:34,955 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 100 states. [2018-07-23 13:50:35,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:35,121 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-07-23 13:50:35,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-23 13:50:35,121 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2018-07-23 13:50:35,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:35,123 INFO L225 Difference]: With dead ends: 203 [2018-07-23 13:50:35,123 INFO L226 Difference]: Without dead ends: 201 [2018-07-23 13:50:35,123 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 13:50:35,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-07-23 13:50:35,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-07-23 13:50:35,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-07-23 13:50:35,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-07-23 13:50:35,128 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 198 [2018-07-23 13:50:35,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:35,128 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-07-23 13:50:35,128 INFO L472 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-23 13:50:35,129 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-07-23 13:50:35,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-07-23 13:50:35,130 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:35,130 INFO L357 BasicCegarLoop]: trace histogram [99, 98, 1, 1, 1] [2018-07-23 13:50:35,130 INFO L414 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:35,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1054824829, now seen corresponding path program 98 times [2018-07-23 13:50:35,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:35,497 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:35,497 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-23 13:50:35,497 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:35,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:35,497 INFO L185 omatonBuilderFactory]: Interpolants [46218#true, 46219#false, 46220#(<= ULTIMATE.start_main_~i~5 0), 46221#(<= ULTIMATE.start_main_~i~5 1), 46222#(<= ULTIMATE.start_main_~i~5 2), 46223#(<= ULTIMATE.start_main_~i~5 3), 46224#(<= ULTIMATE.start_main_~i~5 4), 46225#(<= ULTIMATE.start_main_~i~5 5), 46226#(<= ULTIMATE.start_main_~i~5 6), 46227#(<= ULTIMATE.start_main_~i~5 7), 46228#(<= ULTIMATE.start_main_~i~5 8), 46229#(<= ULTIMATE.start_main_~i~5 9), 46230#(<= ULTIMATE.start_main_~i~5 10), 46231#(<= ULTIMATE.start_main_~i~5 11), 46232#(<= ULTIMATE.start_main_~i~5 12), 46233#(<= ULTIMATE.start_main_~i~5 13), 46234#(<= ULTIMATE.start_main_~i~5 14), 46235#(<= ULTIMATE.start_main_~i~5 15), 46236#(<= ULTIMATE.start_main_~i~5 16), 46237#(<= ULTIMATE.start_main_~i~5 17), 46238#(<= ULTIMATE.start_main_~i~5 18), 46239#(<= ULTIMATE.start_main_~i~5 19), 46240#(<= ULTIMATE.start_main_~i~5 20), 46241#(<= ULTIMATE.start_main_~i~5 21), 46242#(<= ULTIMATE.start_main_~i~5 22), 46243#(<= ULTIMATE.start_main_~i~5 23), 46244#(<= ULTIMATE.start_main_~i~5 24), 46245#(<= ULTIMATE.start_main_~i~5 25), 46246#(<= ULTIMATE.start_main_~i~5 26), 46247#(<= ULTIMATE.start_main_~i~5 27), 46248#(<= ULTIMATE.start_main_~i~5 28), 46249#(<= ULTIMATE.start_main_~i~5 29), 46250#(<= ULTIMATE.start_main_~i~5 30), 46251#(<= ULTIMATE.start_main_~i~5 31), 46252#(<= ULTIMATE.start_main_~i~5 32), 46253#(<= ULTIMATE.start_main_~i~5 33), 46254#(<= ULTIMATE.start_main_~i~5 34), 46255#(<= ULTIMATE.start_main_~i~5 35), 46256#(<= ULTIMATE.start_main_~i~5 36), 46257#(<= ULTIMATE.start_main_~i~5 37), 46258#(<= ULTIMATE.start_main_~i~5 38), 46259#(<= ULTIMATE.start_main_~i~5 39), 46260#(<= ULTIMATE.start_main_~i~5 40), 46261#(<= ULTIMATE.start_main_~i~5 41), 46262#(<= ULTIMATE.start_main_~i~5 42), 46263#(<= ULTIMATE.start_main_~i~5 43), 46264#(<= ULTIMATE.start_main_~i~5 44), 46265#(<= ULTIMATE.start_main_~i~5 45), 46266#(<= ULTIMATE.start_main_~i~5 46), 46267#(<= ULTIMATE.start_main_~i~5 47), 46268#(<= ULTIMATE.start_main_~i~5 48), 46269#(<= ULTIMATE.start_main_~i~5 49), 46270#(<= ULTIMATE.start_main_~i~5 50), 46271#(<= ULTIMATE.start_main_~i~5 51), 46272#(<= ULTIMATE.start_main_~i~5 52), 46273#(<= ULTIMATE.start_main_~i~5 53), 46274#(<= ULTIMATE.start_main_~i~5 54), 46275#(<= ULTIMATE.start_main_~i~5 55), 46276#(<= ULTIMATE.start_main_~i~5 56), 46277#(<= ULTIMATE.start_main_~i~5 57), 46278#(<= ULTIMATE.start_main_~i~5 58), 46279#(<= ULTIMATE.start_main_~i~5 59), 46280#(<= ULTIMATE.start_main_~i~5 60), 46281#(<= ULTIMATE.start_main_~i~5 61), 46282#(<= ULTIMATE.start_main_~i~5 62), 46283#(<= ULTIMATE.start_main_~i~5 63), 46284#(<= ULTIMATE.start_main_~i~5 64), 46285#(<= ULTIMATE.start_main_~i~5 65), 46286#(<= ULTIMATE.start_main_~i~5 66), 46287#(<= ULTIMATE.start_main_~i~5 67), 46288#(<= ULTIMATE.start_main_~i~5 68), 46289#(<= ULTIMATE.start_main_~i~5 69), 46290#(<= ULTIMATE.start_main_~i~5 70), 46291#(<= ULTIMATE.start_main_~i~5 71), 46292#(<= ULTIMATE.start_main_~i~5 72), 46293#(<= ULTIMATE.start_main_~i~5 73), 46294#(<= ULTIMATE.start_main_~i~5 74), 46295#(<= ULTIMATE.start_main_~i~5 75), 46296#(<= ULTIMATE.start_main_~i~5 76), 46297#(<= ULTIMATE.start_main_~i~5 77), 46298#(<= ULTIMATE.start_main_~i~5 78), 46299#(<= ULTIMATE.start_main_~i~5 79), 46300#(<= ULTIMATE.start_main_~i~5 80), 46301#(<= ULTIMATE.start_main_~i~5 81), 46302#(<= ULTIMATE.start_main_~i~5 82), 46303#(<= ULTIMATE.start_main_~i~5 83), 46304#(<= ULTIMATE.start_main_~i~5 84), 46305#(<= ULTIMATE.start_main_~i~5 85), 46306#(<= ULTIMATE.start_main_~i~5 86), 46307#(<= ULTIMATE.start_main_~i~5 87), 46308#(<= ULTIMATE.start_main_~i~5 88), 46309#(<= ULTIMATE.start_main_~i~5 89), 46310#(<= ULTIMATE.start_main_~i~5 90), 46311#(<= ULTIMATE.start_main_~i~5 91), 46312#(<= ULTIMATE.start_main_~i~5 92), 46313#(<= ULTIMATE.start_main_~i~5 93), 46314#(<= ULTIMATE.start_main_~i~5 94), 46315#(<= ULTIMATE.start_main_~i~5 95), 46316#(<= ULTIMATE.start_main_~i~5 96), 46317#(<= ULTIMATE.start_main_~i~5 97), 46318#(<= ULTIMATE.start_main_~i~5 98)] [2018-07-23 13:50:35,498 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:35,498 INFO L450 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-23 13:50:35,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-23 13:50:35,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 13:50:35,499 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 101 states. [2018-07-23 13:50:35,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:35,650 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-07-23 13:50:35,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-23 13:50:35,650 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2018-07-23 13:50:35,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:35,651 INFO L225 Difference]: With dead ends: 205 [2018-07-23 13:50:35,651 INFO L226 Difference]: Without dead ends: 203 [2018-07-23 13:50:35,652 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 13:50:35,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-07-23 13:50:35,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-07-23 13:50:35,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-23 13:50:35,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-07-23 13:50:35,662 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 200 [2018-07-23 13:50:35,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:35,662 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-07-23 13:50:35,662 INFO L472 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-23 13:50:35,662 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-07-23 13:50:35,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-07-23 13:50:35,663 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:35,663 INFO L357 BasicCegarLoop]: trace histogram [100, 99, 1, 1, 1] [2018-07-23 13:50:35,663 INFO L414 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:35,664 INFO L82 PathProgramCache]: Analyzing trace with hash 74311801, now seen corresponding path program 99 times [2018-07-23 13:50:35,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:36,022 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:36,023 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:36,023 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-23 13:50:36,023 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:36,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:36,024 INFO L185 omatonBuilderFactory]: Interpolants [47135#true, 47136#false, 47137#(<= ULTIMATE.start_main_~i~5 0), 47138#(<= ULTIMATE.start_main_~i~5 1), 47139#(<= ULTIMATE.start_main_~i~5 2), 47140#(<= ULTIMATE.start_main_~i~5 3), 47141#(<= ULTIMATE.start_main_~i~5 4), 47142#(<= ULTIMATE.start_main_~i~5 5), 47143#(<= ULTIMATE.start_main_~i~5 6), 47144#(<= ULTIMATE.start_main_~i~5 7), 47145#(<= ULTIMATE.start_main_~i~5 8), 47146#(<= ULTIMATE.start_main_~i~5 9), 47147#(<= ULTIMATE.start_main_~i~5 10), 47148#(<= ULTIMATE.start_main_~i~5 11), 47149#(<= ULTIMATE.start_main_~i~5 12), 47150#(<= ULTIMATE.start_main_~i~5 13), 47151#(<= ULTIMATE.start_main_~i~5 14), 47152#(<= ULTIMATE.start_main_~i~5 15), 47153#(<= ULTIMATE.start_main_~i~5 16), 47154#(<= ULTIMATE.start_main_~i~5 17), 47155#(<= ULTIMATE.start_main_~i~5 18), 47156#(<= ULTIMATE.start_main_~i~5 19), 47157#(<= ULTIMATE.start_main_~i~5 20), 47158#(<= ULTIMATE.start_main_~i~5 21), 47159#(<= ULTIMATE.start_main_~i~5 22), 47160#(<= ULTIMATE.start_main_~i~5 23), 47161#(<= ULTIMATE.start_main_~i~5 24), 47162#(<= ULTIMATE.start_main_~i~5 25), 47163#(<= ULTIMATE.start_main_~i~5 26), 47164#(<= ULTIMATE.start_main_~i~5 27), 47165#(<= ULTIMATE.start_main_~i~5 28), 47166#(<= ULTIMATE.start_main_~i~5 29), 47167#(<= ULTIMATE.start_main_~i~5 30), 47168#(<= ULTIMATE.start_main_~i~5 31), 47169#(<= ULTIMATE.start_main_~i~5 32), 47170#(<= ULTIMATE.start_main_~i~5 33), 47171#(<= ULTIMATE.start_main_~i~5 34), 47172#(<= ULTIMATE.start_main_~i~5 35), 47173#(<= ULTIMATE.start_main_~i~5 36), 47174#(<= ULTIMATE.start_main_~i~5 37), 47175#(<= ULTIMATE.start_main_~i~5 38), 47176#(<= ULTIMATE.start_main_~i~5 39), 47177#(<= ULTIMATE.start_main_~i~5 40), 47178#(<= ULTIMATE.start_main_~i~5 41), 47179#(<= ULTIMATE.start_main_~i~5 42), 47180#(<= ULTIMATE.start_main_~i~5 43), 47181#(<= ULTIMATE.start_main_~i~5 44), 47182#(<= ULTIMATE.start_main_~i~5 45), 47183#(<= ULTIMATE.start_main_~i~5 46), 47184#(<= ULTIMATE.start_main_~i~5 47), 47185#(<= ULTIMATE.start_main_~i~5 48), 47186#(<= ULTIMATE.start_main_~i~5 49), 47187#(<= ULTIMATE.start_main_~i~5 50), 47188#(<= ULTIMATE.start_main_~i~5 51), 47189#(<= ULTIMATE.start_main_~i~5 52), 47190#(<= ULTIMATE.start_main_~i~5 53), 47191#(<= ULTIMATE.start_main_~i~5 54), 47192#(<= ULTIMATE.start_main_~i~5 55), 47193#(<= ULTIMATE.start_main_~i~5 56), 47194#(<= ULTIMATE.start_main_~i~5 57), 47195#(<= ULTIMATE.start_main_~i~5 58), 47196#(<= ULTIMATE.start_main_~i~5 59), 47197#(<= ULTIMATE.start_main_~i~5 60), 47198#(<= ULTIMATE.start_main_~i~5 61), 47199#(<= ULTIMATE.start_main_~i~5 62), 47200#(<= ULTIMATE.start_main_~i~5 63), 47201#(<= ULTIMATE.start_main_~i~5 64), 47202#(<= ULTIMATE.start_main_~i~5 65), 47203#(<= ULTIMATE.start_main_~i~5 66), 47204#(<= ULTIMATE.start_main_~i~5 67), 47205#(<= ULTIMATE.start_main_~i~5 68), 47206#(<= ULTIMATE.start_main_~i~5 69), 47207#(<= ULTIMATE.start_main_~i~5 70), 47208#(<= ULTIMATE.start_main_~i~5 71), 47209#(<= ULTIMATE.start_main_~i~5 72), 47210#(<= ULTIMATE.start_main_~i~5 73), 47211#(<= ULTIMATE.start_main_~i~5 74), 47212#(<= ULTIMATE.start_main_~i~5 75), 47213#(<= ULTIMATE.start_main_~i~5 76), 47214#(<= ULTIMATE.start_main_~i~5 77), 47215#(<= ULTIMATE.start_main_~i~5 78), 47216#(<= ULTIMATE.start_main_~i~5 79), 47217#(<= ULTIMATE.start_main_~i~5 80), 47218#(<= ULTIMATE.start_main_~i~5 81), 47219#(<= ULTIMATE.start_main_~i~5 82), 47220#(<= ULTIMATE.start_main_~i~5 83), 47221#(<= ULTIMATE.start_main_~i~5 84), 47222#(<= ULTIMATE.start_main_~i~5 85), 47223#(<= ULTIMATE.start_main_~i~5 86), 47224#(<= ULTIMATE.start_main_~i~5 87), 47225#(<= ULTIMATE.start_main_~i~5 88), 47226#(<= ULTIMATE.start_main_~i~5 89), 47227#(<= ULTIMATE.start_main_~i~5 90), 47228#(<= ULTIMATE.start_main_~i~5 91), 47229#(<= ULTIMATE.start_main_~i~5 92), 47230#(<= ULTIMATE.start_main_~i~5 93), 47231#(<= ULTIMATE.start_main_~i~5 94), 47232#(<= ULTIMATE.start_main_~i~5 95), 47233#(<= ULTIMATE.start_main_~i~5 96), 47234#(<= ULTIMATE.start_main_~i~5 97), 47235#(<= ULTIMATE.start_main_~i~5 98), 47236#(<= ULTIMATE.start_main_~i~5 99)] [2018-07-23 13:50:36,024 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:36,025 INFO L450 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-23 13:50:36,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-23 13:50:36,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 13:50:36,026 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 102 states. [2018-07-23 13:50:36,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:36,175 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-07-23 13:50:36,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-23 13:50:36,175 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2018-07-23 13:50:36,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:36,177 INFO L225 Difference]: With dead ends: 207 [2018-07-23 13:50:36,177 INFO L226 Difference]: Without dead ends: 205 [2018-07-23 13:50:36,178 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 13:50:36,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-07-23 13:50:36,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-07-23 13:50:36,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-07-23 13:50:36,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-07-23 13:50:36,184 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 202 [2018-07-23 13:50:36,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:36,184 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-07-23 13:50:36,184 INFO L472 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-23 13:50:36,185 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-07-23 13:50:36,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-07-23 13:50:36,186 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:36,186 INFO L357 BasicCegarLoop]: trace histogram [101, 100, 1, 1, 1] [2018-07-23 13:50:36,186 INFO L414 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:36,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1600870283, now seen corresponding path program 100 times [2018-07-23 13:50:36,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:36,820 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 10100 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:36,821 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:50:36,821 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2018-07-23 13:50:36,821 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:36,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:36,822 INFO L185 omatonBuilderFactory]: Interpolants [48128#(<= 65 ULTIMATE.start_main_~j~5), 48129#(<= 66 ULTIMATE.start_main_~j~5), 48130#(<= 67 ULTIMATE.start_main_~j~5), 48131#(<= 68 ULTIMATE.start_main_~j~5), 48132#(<= 69 ULTIMATE.start_main_~j~5), 48133#(<= 70 ULTIMATE.start_main_~j~5), 48134#(<= 71 ULTIMATE.start_main_~j~5), 48135#(<= 72 ULTIMATE.start_main_~j~5), 48136#(<= 73 ULTIMATE.start_main_~j~5), 48137#(<= 74 ULTIMATE.start_main_~j~5), 48138#(<= 75 ULTIMATE.start_main_~j~5), 48139#(<= 76 ULTIMATE.start_main_~j~5), 48140#(<= 77 ULTIMATE.start_main_~j~5), 48141#(<= 78 ULTIMATE.start_main_~j~5), 48142#(<= 79 ULTIMATE.start_main_~j~5), 48143#(<= 80 ULTIMATE.start_main_~j~5), 48144#(<= 81 ULTIMATE.start_main_~j~5), 48145#(<= 82 ULTIMATE.start_main_~j~5), 48146#(<= 83 ULTIMATE.start_main_~j~5), 48147#(<= 84 ULTIMATE.start_main_~j~5), 48148#(<= 85 ULTIMATE.start_main_~j~5), 48149#(<= 86 ULTIMATE.start_main_~j~5), 48150#(<= 87 ULTIMATE.start_main_~j~5), 48151#(<= 88 ULTIMATE.start_main_~j~5), 48152#(<= 89 ULTIMATE.start_main_~j~5), 48153#(<= 90 ULTIMATE.start_main_~j~5), 48154#(<= 91 ULTIMATE.start_main_~j~5), 48155#(<= 92 ULTIMATE.start_main_~j~5), 48156#(<= 93 ULTIMATE.start_main_~j~5), 48157#(<= 94 ULTIMATE.start_main_~j~5), 48158#(<= 95 ULTIMATE.start_main_~j~5), 48159#(<= 96 ULTIMATE.start_main_~j~5), 48160#(<= 97 ULTIMATE.start_main_~j~5), 48161#(<= 98 ULTIMATE.start_main_~j~5), 48162#(<= 99 ULTIMATE.start_main_~j~5), 48163#(<= 100 ULTIMATE.start_main_~j~5), 48061#true, 48062#false, 48063#(<= 0 ULTIMATE.start_main_~j~5), 48064#(<= 1 ULTIMATE.start_main_~j~5), 48065#(<= 2 ULTIMATE.start_main_~j~5), 48066#(<= 3 ULTIMATE.start_main_~j~5), 48067#(<= 4 ULTIMATE.start_main_~j~5), 48068#(<= 5 ULTIMATE.start_main_~j~5), 48069#(<= 6 ULTIMATE.start_main_~j~5), 48070#(<= 7 ULTIMATE.start_main_~j~5), 48071#(<= 8 ULTIMATE.start_main_~j~5), 48072#(<= 9 ULTIMATE.start_main_~j~5), 48073#(<= 10 ULTIMATE.start_main_~j~5), 48074#(<= 11 ULTIMATE.start_main_~j~5), 48075#(<= 12 ULTIMATE.start_main_~j~5), 48076#(<= 13 ULTIMATE.start_main_~j~5), 48077#(<= 14 ULTIMATE.start_main_~j~5), 48078#(<= 15 ULTIMATE.start_main_~j~5), 48079#(<= 16 ULTIMATE.start_main_~j~5), 48080#(<= 17 ULTIMATE.start_main_~j~5), 48081#(<= 18 ULTIMATE.start_main_~j~5), 48082#(<= 19 ULTIMATE.start_main_~j~5), 48083#(<= 20 ULTIMATE.start_main_~j~5), 48084#(<= 21 ULTIMATE.start_main_~j~5), 48085#(<= 22 ULTIMATE.start_main_~j~5), 48086#(<= 23 ULTIMATE.start_main_~j~5), 48087#(<= 24 ULTIMATE.start_main_~j~5), 48088#(<= 25 ULTIMATE.start_main_~j~5), 48089#(<= 26 ULTIMATE.start_main_~j~5), 48090#(<= 27 ULTIMATE.start_main_~j~5), 48091#(<= 28 ULTIMATE.start_main_~j~5), 48092#(<= 29 ULTIMATE.start_main_~j~5), 48093#(<= 30 ULTIMATE.start_main_~j~5), 48094#(<= 31 ULTIMATE.start_main_~j~5), 48095#(<= 32 ULTIMATE.start_main_~j~5), 48096#(<= 33 ULTIMATE.start_main_~j~5), 48097#(<= 34 ULTIMATE.start_main_~j~5), 48098#(<= 35 ULTIMATE.start_main_~j~5), 48099#(<= 36 ULTIMATE.start_main_~j~5), 48100#(<= 37 ULTIMATE.start_main_~j~5), 48101#(<= 38 ULTIMATE.start_main_~j~5), 48102#(<= 39 ULTIMATE.start_main_~j~5), 48103#(<= 40 ULTIMATE.start_main_~j~5), 48104#(<= 41 ULTIMATE.start_main_~j~5), 48105#(<= 42 ULTIMATE.start_main_~j~5), 48106#(<= 43 ULTIMATE.start_main_~j~5), 48107#(<= 44 ULTIMATE.start_main_~j~5), 48108#(<= 45 ULTIMATE.start_main_~j~5), 48109#(<= 46 ULTIMATE.start_main_~j~5), 48110#(<= 47 ULTIMATE.start_main_~j~5), 48111#(<= 48 ULTIMATE.start_main_~j~5), 48112#(<= 49 ULTIMATE.start_main_~j~5), 48113#(<= 50 ULTIMATE.start_main_~j~5), 48114#(<= 51 ULTIMATE.start_main_~j~5), 48115#(<= 52 ULTIMATE.start_main_~j~5), 48116#(<= 53 ULTIMATE.start_main_~j~5), 48117#(<= 54 ULTIMATE.start_main_~j~5), 48118#(<= 55 ULTIMATE.start_main_~j~5), 48119#(<= 56 ULTIMATE.start_main_~j~5), 48120#(<= 57 ULTIMATE.start_main_~j~5), 48121#(<= 58 ULTIMATE.start_main_~j~5), 48122#(<= 59 ULTIMATE.start_main_~j~5), 48123#(<= 60 ULTIMATE.start_main_~j~5), 48124#(<= 61 ULTIMATE.start_main_~j~5), 48125#(<= 62 ULTIMATE.start_main_~j~5), 48126#(<= 63 ULTIMATE.start_main_~j~5), 48127#(<= 64 ULTIMATE.start_main_~j~5)] [2018-07-23 13:50:36,823 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 10100 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:36,823 INFO L450 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-23 13:50:36,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-23 13:50:36,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 13:50:36,824 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 103 states. [2018-07-23 13:50:36,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:36,945 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-07-23 13:50:36,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-23 13:50:36,945 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2018-07-23 13:50:36,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:36,946 INFO L225 Difference]: With dead ends: 205 [2018-07-23 13:50:36,946 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 13:50:36,950 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 13:50:36,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 13:50:36,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 13:50:36,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 13:50:36,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 13:50:36,951 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 204 [2018-07-23 13:50:36,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:36,951 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 13:50:36,951 INFO L472 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-23 13:50:36,951 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 13:50:36,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 13:50:36,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 13:50:37,102 WARN L169 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 405 [2018-07-23 13:50:37,662 WARN L169 SmtUtils]: Spent 477.00 ms on a formula simplification that was a NOOP. DAG size: 405 [2018-07-23 13:50:38,051 WARN L169 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 405 [2018-07-23 13:50:38,058 INFO L417 ceAbstractionStarter]: At program point L41(lines 25 41) the Hoare annotation is: (or (and (<= ULTIMATE.start_main_~i~5 58) (<= 58 ULTIMATE.start_main_~j~5)) (and (<= 10 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 10)) (and (<= ULTIMATE.start_main_~i~5 30) (<= 30 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 35) (<= 35 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 77) (<= 77 ULTIMATE.start_main_~j~5)) (and (<= 15 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 15)) (and (<= ULTIMATE.start_main_~i~5 24) (<= 24 ULTIMATE.start_main_~j~5)) (and (<= 79 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 79)) (and (<= 54 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 54)) (and (<= ULTIMATE.start_main_~i~5 61) (<= 61 ULTIMATE.start_main_~j~5)) (and (<= 67 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 67)) (and (<= 80 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 80)) (and (<= ULTIMATE.start_main_~i~5 42) (<= 42 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 46) (<= 46 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 2) (<= 2 ULTIMATE.start_main_~j~5)) (and (<= 94 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 94)) (and (<= ULTIMATE.start_main_~i~5 26) (<= 26 ULTIMATE.start_main_~j~5)) (and (<= 98 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 98)) (and (<= ULTIMATE.start_main_~i~5 43) (<= 43 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 57) (<= 57 ULTIMATE.start_main_~j~5)) (and (<= 45 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 45)) (and (<= 75 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 75)) (and (<= ULTIMATE.start_main_~i~5 88) (<= 88 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 95) (<= 95 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 69) (<= 69 ULTIMATE.start_main_~j~5)) (and (<= 27 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 27)) (and (<= ULTIMATE.start_main_~i~5 60) (<= 60 ULTIMATE.start_main_~j~5)) (and (<= 83 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 83)) (and (<= 29 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 29)) (and (<= 4 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 4)) (and (<= ULTIMATE.start_main_~i~5 87) (<= 87 ULTIMATE.start_main_~j~5)) (and (<= 17 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 17)) (and (<= 12 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 12)) (and (<= ULTIMATE.start_main_~i~5 37) (<= 37 ULTIMATE.start_main_~j~5)) (and (<= 93 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 93)) (and (<= 14 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 14)) (and (<= ULTIMATE.start_main_~i~5 84) (<= 84 ULTIMATE.start_main_~j~5)) (and (<= 49 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 49)) (and (<= 39 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 39)) (and (<= 23 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 23)) (and (<= 44 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 44)) (and (<= 85 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 85)) (and (<= 6 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 6)) (and (<= ULTIMATE.start_main_~i~5 70) (<= 70 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 28) (<= 28 ULTIMATE.start_main_~j~5)) (and (<= 16 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 16)) (and (<= ULTIMATE.start_main_~i~5 38) (<= 38 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 91) (<= 91 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 47) (<= 47 ULTIMATE.start_main_~j~5)) (and (<= 72 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 72)) (and (<= 96 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 96)) (and (<= 89 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 89)) (and (<= 21 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 21)) (and (<= ULTIMATE.start_main_~i~5 66) (<= 66 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 40) (<= 40 ULTIMATE.start_main_~j~5)) (and (<= 7 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 7)) (and (<= 62 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 62)) (and (<= ULTIMATE.start_main_~i~5 73) (<= 73 ULTIMATE.start_main_~j~5)) (and (<= 64 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 64)) (and (<= 33 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 33)) (and (<= 63 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 63)) (and (<= 92 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 92)) (and (<= 31 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 31)) (and (<= ULTIMATE.start_main_~i~5 68) (<= 68 ULTIMATE.start_main_~j~5)) (and (<= 41 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 41)) (and (<= 13 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 13)) (and (<= 25 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 25)) (and (<= ULTIMATE.start_main_~i~5 78) (<= 78 ULTIMATE.start_main_~j~5)) (and (<= 0 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 0)) (and (<= ULTIMATE.start_main_~i~5 56) (<= 56 ULTIMATE.start_main_~j~5)) (and (<= 55 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 55)) (and (<= 51 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 51)) (and (<= 22 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 22)) (and (<= 3 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 3)) (and (<= ULTIMATE.start_main_~i~5 97) (<= 97 ULTIMATE.start_main_~j~5)) (and (<= 52 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 52)) (and (<= 48 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 48)) (and (<= ULTIMATE.start_main_~i~5 86) (<= 86 ULTIMATE.start_main_~j~5)) (and (<= 11 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 11)) (and (<= ULTIMATE.start_main_~i~5 76) (<= 76 ULTIMATE.start_main_~j~5)) (and (<= 50 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 50)) (and (<= 82 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 82)) (and (<= ULTIMATE.start_main_~i~5 71) (<= 71 ULTIMATE.start_main_~j~5)) (and (<= 32 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 32)) (and (<= 74 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 74)) (and (<= ULTIMATE.start_main_~i~5 19) (<= 19 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 59) (<= 59 ULTIMATE.start_main_~j~5)) (and (<= 20 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 20)) (<= 100 ULTIMATE.start_main_~j~5) (and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 1)) (and (<= 99 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 99)) (and (<= ULTIMATE.start_main_~i~5 5) (<= 5 ULTIMATE.start_main_~j~5)) (and (<= 90 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 90)) (and (<= 65 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 65)) (and (<= ULTIMATE.start_main_~i~5 9) (<= 9 ULTIMATE.start_main_~j~5)) (and (<= 36 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 36)) (and (<= ULTIMATE.start_main_~i~5 8) (<= 8 ULTIMATE.start_main_~j~5)) (and (<= 34 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 34)) (and (<= 53 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 53)) (and (<= ULTIMATE.start_main_~i~5 18) (<= 18 ULTIMATE.start_main_~j~5)) (and (<= 81 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 81))) [2018-07-23 13:50:38,058 INFO L417 ceAbstractionStarter]: At program point L51(lines 51 52) the Hoare annotation is: false [2018-07-23 13:50:38,058 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startErr0AssertViolationASSERT(line 53) the Hoare annotation is: false [2018-07-23 13:50:38,062 INFO L417 ceAbstractionStarter]: At program point L29(lines 29 42) the Hoare annotation is: (or (and (<= ULTIMATE.start_main_~i~5 58) (<= 58 ULTIMATE.start_main_~j~5)) (and (<= 10 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 10)) (and (<= ULTIMATE.start_main_~i~5 30) (<= 30 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 35) (<= 35 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 77) (<= 77 ULTIMATE.start_main_~j~5)) (and (<= 15 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 15)) (and (<= ULTIMATE.start_main_~i~5 24) (<= 24 ULTIMATE.start_main_~j~5)) (and (<= 79 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 79)) (and (<= 54 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 54)) (and (<= ULTIMATE.start_main_~i~5 61) (<= 61 ULTIMATE.start_main_~j~5)) (and (<= 67 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 67)) (and (<= 80 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 80)) (and (<= ULTIMATE.start_main_~i~5 42) (<= 42 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 46) (<= 46 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 2) (<= 2 ULTIMATE.start_main_~j~5)) (and (<= 94 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 94)) (and (<= ULTIMATE.start_main_~i~5 26) (<= 26 ULTIMATE.start_main_~j~5)) (and (<= 98 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 98)) (and (<= ULTIMATE.start_main_~i~5 43) (<= 43 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 57) (<= 57 ULTIMATE.start_main_~j~5)) (and (<= 45 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 45)) (and (<= 75 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 75)) (and (<= ULTIMATE.start_main_~i~5 88) (<= 88 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 95) (<= 95 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 69) (<= 69 ULTIMATE.start_main_~j~5)) (and (<= 27 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 27)) (and (<= ULTIMATE.start_main_~i~5 60) (<= 60 ULTIMATE.start_main_~j~5)) (and (<= 83 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 83)) (and (<= 29 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 29)) (and (<= 4 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 4)) (and (<= ULTIMATE.start_main_~i~5 87) (<= 87 ULTIMATE.start_main_~j~5)) (and (<= 17 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 17)) (and (<= 12 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 12)) (and (<= ULTIMATE.start_main_~i~5 37) (<= 37 ULTIMATE.start_main_~j~5)) (and (<= 93 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 93)) (and (<= 14 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 14)) (and (<= ULTIMATE.start_main_~i~5 84) (<= 84 ULTIMATE.start_main_~j~5)) (and (<= 49 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 49)) (and (<= 39 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 39)) (and (<= 23 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 23)) (and (<= 44 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 44)) (and (<= 85 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 85)) (and (<= 6 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 6)) (and (<= ULTIMATE.start_main_~i~5 70) (<= 70 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 28) (<= 28 ULTIMATE.start_main_~j~5)) (and (<= 16 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 16)) (and (<= ULTIMATE.start_main_~i~5 38) (<= 38 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 91) (<= 91 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 47) (<= 47 ULTIMATE.start_main_~j~5)) (and (<= 72 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 72)) (and (<= 96 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 96)) (and (<= 89 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 89)) (and (<= 21 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 21)) (and (<= ULTIMATE.start_main_~i~5 66) (<= 66 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 40) (<= 40 ULTIMATE.start_main_~j~5)) (and (<= 7 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 7)) (and (<= 62 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 62)) (and (<= ULTIMATE.start_main_~i~5 73) (<= 73 ULTIMATE.start_main_~j~5)) (and (<= 64 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 64)) (and (<= 33 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 33)) (and (<= 63 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 63)) (and (<= 92 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 92)) (and (<= 31 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 31)) (and (<= ULTIMATE.start_main_~i~5 68) (<= 68 ULTIMATE.start_main_~j~5)) (and (<= 41 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 41)) (and (<= 13 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 13)) (and (<= 25 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 25)) (and (<= ULTIMATE.start_main_~i~5 78) (<= 78 ULTIMATE.start_main_~j~5)) (and (<= 0 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 0)) (and (<= ULTIMATE.start_main_~i~5 56) (<= 56 ULTIMATE.start_main_~j~5)) (and (<= 55 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 55)) (and (<= 51 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 51)) (and (<= 22 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 22)) (and (<= 3 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 3)) (and (<= ULTIMATE.start_main_~i~5 97) (<= 97 ULTIMATE.start_main_~j~5)) (and (<= 52 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 52)) (and (<= 48 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 48)) (and (<= ULTIMATE.start_main_~i~5 86) (<= 86 ULTIMATE.start_main_~j~5)) (and (<= 11 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 11)) (and (<= ULTIMATE.start_main_~i~5 76) (<= 76 ULTIMATE.start_main_~j~5)) (and (<= 50 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 50)) (and (<= 82 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 82)) (and (<= ULTIMATE.start_main_~i~5 71) (<= 71 ULTIMATE.start_main_~j~5)) (and (<= 32 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 32)) (and (<= 74 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 74)) (and (<= ULTIMATE.start_main_~i~5 19) (<= 19 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 59) (<= 59 ULTIMATE.start_main_~j~5)) (and (<= 20 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 20)) (<= 100 ULTIMATE.start_main_~j~5) (and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 1)) (and (<= 99 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 99)) (and (<= ULTIMATE.start_main_~i~5 5) (<= 5 ULTIMATE.start_main_~j~5)) (and (<= 90 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 90)) (and (<= 65 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 65)) (and (<= ULTIMATE.start_main_~i~5 9) (<= 9 ULTIMATE.start_main_~j~5)) (and (<= 36 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 36)) (and (<= ULTIMATE.start_main_~i~5 8) (<= 8 ULTIMATE.start_main_~j~5)) (and (<= 34 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 34)) (and (<= 53 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 53)) (and (<= ULTIMATE.start_main_~i~5 18) (<= 18 ULTIMATE.start_main_~j~5)) (and (<= 81 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 81))) [2018-07-23 13:50:38,062 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 54) the Hoare annotation is: true [2018-07-23 13:50:38,062 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 54) no Hoare annotation was computed. [2018-07-23 13:50:38,062 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 1 54) the Hoare annotation is: false [2018-07-23 13:50:38,107 INFO L202 PluginConnector]: Adding new model string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:50:38 BoogieIcfgContainer [2018-07-23 13:50:38,107 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:50:38,108 INFO L168 Benchmark]: Toolchain (without parser) took 35278.56 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.3 GB). Free memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-07-23 13:50:38,112 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 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-07-23 13:50:38,112 INFO L168 Benchmark]: Boogie Preprocessor took 51.21 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-07-23 13:50:38,112 INFO L168 Benchmark]: RCFGBuilder took 219.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-23 13:50:38,113 INFO L168 Benchmark]: TraceAbstraction took 35003.17 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-07-23 13:50:38,118 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.24 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 51.21 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 219.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35003.17 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 53]: 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: 29]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((main_~i~5 <= 58 && 58 <= main_~j~5) || (10 <= main_~j~5 && main_~i~5 <= 10)) || (main_~i~5 <= 30 && 30 <= main_~j~5)) || (main_~i~5 <= 35 && 35 <= main_~j~5)) || (main_~i~5 <= 77 && 77 <= main_~j~5)) || (15 <= main_~j~5 && main_~i~5 <= 15)) || (main_~i~5 <= 24 && 24 <= main_~j~5)) || (79 <= main_~j~5 && main_~i~5 <= 79)) || (54 <= main_~j~5 && main_~i~5 <= 54)) || (main_~i~5 <= 61 && 61 <= main_~j~5)) || (67 <= main_~j~5 && main_~i~5 <= 67)) || (80 <= main_~j~5 && main_~i~5 <= 80)) || (main_~i~5 <= 42 && 42 <= main_~j~5)) || (main_~i~5 <= 46 && 46 <= main_~j~5)) || (main_~i~5 <= 2 && 2 <= main_~j~5)) || (94 <= main_~j~5 && main_~i~5 <= 94)) || (main_~i~5 <= 26 && 26 <= main_~j~5)) || (98 <= main_~j~5 && main_~i~5 <= 98)) || (main_~i~5 <= 43 && 43 <= main_~j~5)) || (main_~i~5 <= 57 && 57 <= main_~j~5)) || (45 <= main_~j~5 && main_~i~5 <= 45)) || (75 <= main_~j~5 && main_~i~5 <= 75)) || (main_~i~5 <= 88 && 88 <= main_~j~5)) || (main_~i~5 <= 95 && 95 <= main_~j~5)) || (main_~i~5 <= 69 && 69 <= main_~j~5)) || (27 <= main_~j~5 && main_~i~5 <= 27)) || (main_~i~5 <= 60 && 60 <= main_~j~5)) || (83 <= main_~j~5 && main_~i~5 <= 83)) || (29 <= main_~j~5 && main_~i~5 <= 29)) || (4 <= main_~j~5 && main_~i~5 <= 4)) || (main_~i~5 <= 87 && 87 <= main_~j~5)) || (17 <= main_~j~5 && main_~i~5 <= 17)) || (12 <= main_~j~5 && main_~i~5 <= 12)) || (main_~i~5 <= 37 && 37 <= main_~j~5)) || (93 <= main_~j~5 && main_~i~5 <= 93)) || (14 <= main_~j~5 && main_~i~5 <= 14)) || (main_~i~5 <= 84 && 84 <= main_~j~5)) || (49 <= main_~j~5 && main_~i~5 <= 49)) || (39 <= main_~j~5 && main_~i~5 <= 39)) || (23 <= main_~j~5 && main_~i~5 <= 23)) || (44 <= main_~j~5 && main_~i~5 <= 44)) || (85 <= main_~j~5 && main_~i~5 <= 85)) || (6 <= main_~j~5 && main_~i~5 <= 6)) || (main_~i~5 <= 70 && 70 <= main_~j~5)) || (main_~i~5 <= 28 && 28 <= main_~j~5)) || (16 <= main_~j~5 && main_~i~5 <= 16)) || (main_~i~5 <= 38 && 38 <= main_~j~5)) || (main_~i~5 <= 91 && 91 <= main_~j~5)) || (main_~i~5 <= 47 && 47 <= main_~j~5)) || (72 <= main_~j~5 && main_~i~5 <= 72)) || (96 <= main_~j~5 && main_~i~5 <= 96)) || (89 <= main_~j~5 && main_~i~5 <= 89)) || (21 <= main_~j~5 && main_~i~5 <= 21)) || (main_~i~5 <= 66 && 66 <= main_~j~5)) || (main_~i~5 <= 40 && 40 <= main_~j~5)) || (7 <= main_~j~5 && main_~i~5 <= 7)) || (62 <= main_~j~5 && main_~i~5 <= 62)) || (main_~i~5 <= 73 && 73 <= main_~j~5)) || (64 <= main_~j~5 && main_~i~5 <= 64)) || (33 <= main_~j~5 && main_~i~5 <= 33)) || (63 <= main_~j~5 && main_~i~5 <= 63)) || (92 <= main_~j~5 && main_~i~5 <= 92)) || (31 <= main_~j~5 && main_~i~5 <= 31)) || (main_~i~5 <= 68 && 68 <= main_~j~5)) || (41 <= main_~j~5 && main_~i~5 <= 41)) || (13 <= main_~j~5 && main_~i~5 <= 13)) || (25 <= main_~j~5 && main_~i~5 <= 25)) || (main_~i~5 <= 78 && 78 <= main_~j~5)) || (0 <= main_~j~5 && main_~i~5 <= 0)) || (main_~i~5 <= 56 && 56 <= main_~j~5)) || (55 <= main_~j~5 && main_~i~5 <= 55)) || (51 <= main_~j~5 && main_~i~5 <= 51)) || (22 <= main_~j~5 && main_~i~5 <= 22)) || (3 <= main_~j~5 && main_~i~5 <= 3)) || (main_~i~5 <= 97 && 97 <= main_~j~5)) || (52 <= main_~j~5 && main_~i~5 <= 52)) || (48 <= main_~j~5 && main_~i~5 <= 48)) || (main_~i~5 <= 86 && 86 <= main_~j~5)) || (11 <= main_~j~5 && main_~i~5 <= 11)) || (main_~i~5 <= 76 && 76 <= main_~j~5)) || (50 <= main_~j~5 && main_~i~5 <= 50)) || (82 <= main_~j~5 && main_~i~5 <= 82)) || (main_~i~5 <= 71 && 71 <= main_~j~5)) || (32 <= main_~j~5 && main_~i~5 <= 32)) || (74 <= main_~j~5 && main_~i~5 <= 74)) || (main_~i~5 <= 19 && 19 <= main_~j~5)) || (main_~i~5 <= 59 && 59 <= main_~j~5)) || (20 <= main_~j~5 && main_~i~5 <= 20)) || 100 <= main_~j~5) || (1 <= main_~j~5 && main_~i~5 <= 1)) || (99 <= main_~j~5 && main_~i~5 <= 99)) || (main_~i~5 <= 5 && 5 <= main_~j~5)) || (90 <= main_~j~5 && main_~i~5 <= 90)) || (65 <= main_~j~5 && main_~i~5 <= 65)) || (main_~i~5 <= 9 && 9 <= main_~j~5)) || (36 <= main_~j~5 && main_~i~5 <= 36)) || (main_~i~5 <= 8 && 8 <= main_~j~5)) || (34 <= main_~j~5 && main_~i~5 <= 34)) || (53 <= main_~j~5 && main_~i~5 <= 53)) || (main_~i~5 <= 18 && 18 <= main_~j~5)) || (81 <= main_~j~5 && main_~i~5 <= 81) - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((main_~i~5 <= 58 && 58 <= main_~j~5) || (10 <= main_~j~5 && main_~i~5 <= 10)) || (main_~i~5 <= 30 && 30 <= main_~j~5)) || (main_~i~5 <= 35 && 35 <= main_~j~5)) || (main_~i~5 <= 77 && 77 <= main_~j~5)) || (15 <= main_~j~5 && main_~i~5 <= 15)) || (main_~i~5 <= 24 && 24 <= main_~j~5)) || (79 <= main_~j~5 && main_~i~5 <= 79)) || (54 <= main_~j~5 && main_~i~5 <= 54)) || (main_~i~5 <= 61 && 61 <= main_~j~5)) || (67 <= main_~j~5 && main_~i~5 <= 67)) || (80 <= main_~j~5 && main_~i~5 <= 80)) || (main_~i~5 <= 42 && 42 <= main_~j~5)) || (main_~i~5 <= 46 && 46 <= main_~j~5)) || (main_~i~5 <= 2 && 2 <= main_~j~5)) || (94 <= main_~j~5 && main_~i~5 <= 94)) || (main_~i~5 <= 26 && 26 <= main_~j~5)) || (98 <= main_~j~5 && main_~i~5 <= 98)) || (main_~i~5 <= 43 && 43 <= main_~j~5)) || (main_~i~5 <= 57 && 57 <= main_~j~5)) || (45 <= main_~j~5 && main_~i~5 <= 45)) || (75 <= main_~j~5 && main_~i~5 <= 75)) || (main_~i~5 <= 88 && 88 <= main_~j~5)) || (main_~i~5 <= 95 && 95 <= main_~j~5)) || (main_~i~5 <= 69 && 69 <= main_~j~5)) || (27 <= main_~j~5 && main_~i~5 <= 27)) || (main_~i~5 <= 60 && 60 <= main_~j~5)) || (83 <= main_~j~5 && main_~i~5 <= 83)) || (29 <= main_~j~5 && main_~i~5 <= 29)) || (4 <= main_~j~5 && main_~i~5 <= 4)) || (main_~i~5 <= 87 && 87 <= main_~j~5)) || (17 <= main_~j~5 && main_~i~5 <= 17)) || (12 <= main_~j~5 && main_~i~5 <= 12)) || (main_~i~5 <= 37 && 37 <= main_~j~5)) || (93 <= main_~j~5 && main_~i~5 <= 93)) || (14 <= main_~j~5 && main_~i~5 <= 14)) || (main_~i~5 <= 84 && 84 <= main_~j~5)) || (49 <= main_~j~5 && main_~i~5 <= 49)) || (39 <= main_~j~5 && main_~i~5 <= 39)) || (23 <= main_~j~5 && main_~i~5 <= 23)) || (44 <= main_~j~5 && main_~i~5 <= 44)) || (85 <= main_~j~5 && main_~i~5 <= 85)) || (6 <= main_~j~5 && main_~i~5 <= 6)) || (main_~i~5 <= 70 && 70 <= main_~j~5)) || (main_~i~5 <= 28 && 28 <= main_~j~5)) || (16 <= main_~j~5 && main_~i~5 <= 16)) || (main_~i~5 <= 38 && 38 <= main_~j~5)) || (main_~i~5 <= 91 && 91 <= main_~j~5)) || (main_~i~5 <= 47 && 47 <= main_~j~5)) || (72 <= main_~j~5 && main_~i~5 <= 72)) || (96 <= main_~j~5 && main_~i~5 <= 96)) || (89 <= main_~j~5 && main_~i~5 <= 89)) || (21 <= main_~j~5 && main_~i~5 <= 21)) || (main_~i~5 <= 66 && 66 <= main_~j~5)) || (main_~i~5 <= 40 && 40 <= main_~j~5)) || (7 <= main_~j~5 && main_~i~5 <= 7)) || (62 <= main_~j~5 && main_~i~5 <= 62)) || (main_~i~5 <= 73 && 73 <= main_~j~5)) || (64 <= main_~j~5 && main_~i~5 <= 64)) || (33 <= main_~j~5 && main_~i~5 <= 33)) || (63 <= main_~j~5 && main_~i~5 <= 63)) || (92 <= main_~j~5 && main_~i~5 <= 92)) || (31 <= main_~j~5 && main_~i~5 <= 31)) || (main_~i~5 <= 68 && 68 <= main_~j~5)) || (41 <= main_~j~5 && main_~i~5 <= 41)) || (13 <= main_~j~5 && main_~i~5 <= 13)) || (25 <= main_~j~5 && main_~i~5 <= 25)) || (main_~i~5 <= 78 && 78 <= main_~j~5)) || (0 <= main_~j~5 && main_~i~5 <= 0)) || (main_~i~5 <= 56 && 56 <= main_~j~5)) || (55 <= main_~j~5 && main_~i~5 <= 55)) || (51 <= main_~j~5 && main_~i~5 <= 51)) || (22 <= main_~j~5 && main_~i~5 <= 22)) || (3 <= main_~j~5 && main_~i~5 <= 3)) || (main_~i~5 <= 97 && 97 <= main_~j~5)) || (52 <= main_~j~5 && main_~i~5 <= 52)) || (48 <= main_~j~5 && main_~i~5 <= 48)) || (main_~i~5 <= 86 && 86 <= main_~j~5)) || (11 <= main_~j~5 && main_~i~5 <= 11)) || (main_~i~5 <= 76 && 76 <= main_~j~5)) || (50 <= main_~j~5 && main_~i~5 <= 50)) || (82 <= main_~j~5 && main_~i~5 <= 82)) || (main_~i~5 <= 71 && 71 <= main_~j~5)) || (32 <= main_~j~5 && main_~i~5 <= 32)) || (74 <= main_~j~5 && main_~i~5 <= 74)) || (main_~i~5 <= 19 && 19 <= main_~j~5)) || (main_~i~5 <= 59 && 59 <= main_~j~5)) || (20 <= main_~j~5 && main_~i~5 <= 20)) || 100 <= main_~j~5) || (1 <= main_~j~5 && main_~i~5 <= 1)) || (99 <= main_~j~5 && main_~i~5 <= 99)) || (main_~i~5 <= 5 && 5 <= main_~j~5)) || (90 <= main_~j~5 && main_~i~5 <= 90)) || (65 <= main_~j~5 && main_~i~5 <= 65)) || (main_~i~5 <= 9 && 9 <= main_~j~5)) || (36 <= main_~j~5 && main_~i~5 <= 36)) || (main_~i~5 <= 8 && 8 <= main_~j~5)) || (34 <= main_~j~5 && main_~i~5 <= 34)) || (53 <= main_~j~5 && main_~i~5 <= 53)) || (main_~i~5 <= 18 && 18 <= main_~j~5)) || (81 <= main_~j~5 && main_~i~5 <= 81) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 34.8s OverallTime, 101 OverallIterations, 101 TraceHistogramMax, 7.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 502 SDtfs, 0 SDslu, 9028 SDs, 0 SdLazy, 9229 SolverSat, 145 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5252 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6s Time, 0.1s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 10100/343400 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 101 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 206 NumberOfFragments, 1412 HoareAnnotationTreeSize, 6 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 19.8s InterpolantComputationTime, 10504 NumberOfCodeBlocks, 10504 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 10403 ConstructedInterpolants, 0 QuantifiedInterpolants, 4223921 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 101 InterpolantComputations, 2 PerfectInterpolantSequences, 10100/343400 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/string_concat-noarr.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-50-38-133.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/string_concat-noarr.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-50-38-133.csv Received shutdown request...