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/nested.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:47:13,154 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:47:13,156 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:47:13,172 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:47:13,172 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:47:13,173 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:47:13,175 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:47:13,176 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:47:13,178 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:47:13,179 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:47:13,180 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:47:13,180 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:47:13,181 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:47:13,182 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:47:13,183 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:47:13,184 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:47:13,185 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:47:13,187 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:47:13,189 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:47:13,190 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:47:13,192 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:47:13,193 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:47:13,195 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:47:13,196 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:47:13,196 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:47:13,197 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:47:13,198 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:47:13,199 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:47:13,200 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:47:13,201 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:47:13,201 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:47:13,202 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:47:13,202 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:47:13,202 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:47:13,203 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:47:13,204 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:47:13,205 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:47:13,228 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:47:13,229 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:47:13,230 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:47:13,230 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:47:13,231 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:47:13,231 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:47:13,231 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:47:13,231 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:47:13,275 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:47:13,290 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:47:13,294 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:47:13,296 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:47:13,296 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:47:13,297 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/nested.i_4.bpl [2018-07-23 13:47:13,298 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/nested.i_4.bpl' [2018-07-23 13:47:13,353 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:47:13,355 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:47:13,356 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:47:13,356 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:47:13,356 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:47:13,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:47:13" (1/1) ... [2018-07-23 13:47:13,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:47:13" (1/1) ... [2018-07-23 13:47:13,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:47:13" (1/1) ... [2018-07-23 13:47:13,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:47:13" (1/1) ... [2018-07-23 13:47:13,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:47:13" (1/1) ... [2018-07-23 13:47:13,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:47:13" (1/1) ... [2018-07-23 13:47:13,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:47:13" (1/1) ... [2018-07-23 13:47:13,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:47:13,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:47:13,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:47:13,405 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:47:13,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:47:13" (1/1) ... [2018-07-23 13:47:13,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 13:47:13,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 13:47:13,672 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 13:47:13,673 INFO L202 PluginConnector]: Adding new model nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:47:13 BoogieIcfgContainer [2018-07-23 13:47:13,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:47:13,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:47:13,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:47:13,680 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:47:13,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:47:13" (1/2) ... [2018-07-23 13:47:13,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b4daad and model type nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:47:13, skipping insertion in model container [2018-07-23 13:47:13,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:47:13" (2/2) ... [2018-07-23 13:47:13,684 INFO L112 eAbstractionObserver]: Analyzing ICFG nested.i_4.bpl [2018-07-23 13:47:13,695 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:47:13,704 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:47:13,758 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:47:13,759 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:47:13,759 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:47:13,760 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:47:13,760 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:47:13,760 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:47:13,760 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:47:13,761 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:47:13,761 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:47:13,778 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-07-23 13:47:13,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:47:13,792 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:13,793 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:47:13,794 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:13,800 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-07-23 13:47:13,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:13,886 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:47:13,889 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:47:13,890 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 13:47:13,892 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:13,892 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:47:13,893 INFO L185 omatonBuilderFactory]: Interpolants [10#true, 11#false, 12#(<= (+ ULTIMATE.start_main_~i~5 10) ULTIMATE.start_main_~n~5)] [2018-07-23 13:47:13,893 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:47:13,894 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:47:13,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:47:13,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:47:13,910 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-07-23 13:47:13,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:13,942 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2018-07-23 13:47:13,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:47:13,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-07-23 13:47:13,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:13,955 INFO L225 Difference]: With dead ends: 17 [2018-07-23 13:47:13,956 INFO L226 Difference]: Without dead ends: 11 [2018-07-23 13:47:13,960 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:47:13,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-23 13:47:13,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-07-23 13:47:13,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 13:47:13,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-07-23 13:47:13,999 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 4 [2018-07-23 13:47:14,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:14,000 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-07-23 13:47:14,000 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:47:14,000 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-07-23 13:47:14,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:47:14,001 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:14,001 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:47:14,002 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:14,002 INFO L82 PathProgramCache]: Analyzing trace with hash 209100445, now seen corresponding path program 1 times [2018-07-23 13:47:14,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:14,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:14,033 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:47:14,034 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:47:14,034 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:14,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:47:14,035 INFO L185 omatonBuilderFactory]: Interpolants [65#true, 66#false, 67#(<= 10 ULTIMATE.start_main_~m~5), 68#(<= (+ ULTIMATE.start_main_~j~5 10) ULTIMATE.start_main_~m~5)] [2018-07-23 13:47:14,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:14,037 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:47:14,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:47:14,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:47:14,038 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 4 states. [2018-07-23 13:47:14,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:14,068 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-07-23 13:47:14,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:47:14,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-07-23 13:47:14,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:14,069 INFO L225 Difference]: With dead ends: 17 [2018-07-23 13:47:14,069 INFO L226 Difference]: Without dead ends: 11 [2018-07-23 13:47:14,071 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:47:14,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-23 13:47:14,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-23 13:47:14,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 13:47:14,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-07-23 13:47:14,075 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-07-23 13:47:14,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:14,076 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-07-23 13:47:14,076 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:47:14,076 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-07-23 13:47:14,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:47:14,077 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:14,077 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:47:14,077 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:14,077 INFO L82 PathProgramCache]: Analyzing trace with hash -850198025, now seen corresponding path program 1 times [2018-07-23 13:47:14,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:14,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:14,119 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:14,119 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:47:14,120 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:14,120 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:47:14,120 INFO L185 omatonBuilderFactory]: Interpolants [128#false, 129#(<= 10 ULTIMATE.start_main_~m~5), 130#(<= (+ ULTIMATE.start_main_~j~5 10) ULTIMATE.start_main_~m~5), 131#(<= (+ ULTIMATE.start_main_~j~5 9) ULTIMATE.start_main_~m~5), 127#true] [2018-07-23 13:47:14,121 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:14,121 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:47:14,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:47:14,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:47:14,122 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 5 states. [2018-07-23 13:47:14,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:14,167 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-07-23 13:47:14,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:47:14,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-07-23 13:47:14,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:14,169 INFO L225 Difference]: With dead ends: 21 [2018-07-23 13:47:14,169 INFO L226 Difference]: Without dead ends: 13 [2018-07-23 13:47:14,170 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:47:14,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-23 13:47:14,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-23 13:47:14,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 13:47:14,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-07-23 13:47:14,175 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-07-23 13:47:14,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:14,175 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-07-23 13:47:14,175 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:47:14,176 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-07-23 13:47:14,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:47:14,176 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:14,176 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2018-07-23 13:47:14,177 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:14,177 INFO L82 PathProgramCache]: Analyzing trace with hash -928778543, now seen corresponding path program 2 times [2018-07-23 13:47:14,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:14,221 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:14,222 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:14,222 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:47:14,222 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:14,223 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:47:14,223 INFO L185 omatonBuilderFactory]: Interpolants [208#(<= (+ ULTIMATE.start_main_~j~5 9) ULTIMATE.start_main_~m~5), 209#(<= (+ ULTIMATE.start_main_~j~5 8) ULTIMATE.start_main_~m~5), 204#true, 205#false, 206#(<= 10 ULTIMATE.start_main_~m~5), 207#(<= (+ ULTIMATE.start_main_~j~5 10) ULTIMATE.start_main_~m~5)] [2018-07-23 13:47:14,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:14,224 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:47:14,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:47:14,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:47:14,225 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 6 states. [2018-07-23 13:47:14,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:14,281 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-07-23 13:47:14,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:47:14,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-07-23 13:47:14,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:14,287 INFO L225 Difference]: With dead ends: 25 [2018-07-23 13:47:14,288 INFO L226 Difference]: Without dead ends: 15 [2018-07-23 13:47:14,289 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:47:14,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-23 13:47:14,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-23 13:47:14,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-23 13:47:14,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-07-23 13:47:14,298 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-07-23 13:47:14,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:14,298 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-07-23 13:47:14,299 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:47:14,299 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-07-23 13:47:14,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:47:14,299 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:14,300 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1] [2018-07-23 13:47:14,300 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:14,300 INFO L82 PathProgramCache]: Analyzing trace with hash 864754987, now seen corresponding path program 3 times [2018-07-23 13:47:14,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:14,404 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:14,405 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:14,405 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:47:14,405 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:14,408 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:47:14,409 INFO L185 omatonBuilderFactory]: Interpolants [296#true, 297#false, 298#(<= 10 ULTIMATE.start_main_~m~5), 299#(<= (+ ULTIMATE.start_main_~j~5 10) ULTIMATE.start_main_~m~5), 300#(<= (+ ULTIMATE.start_main_~j~5 9) ULTIMATE.start_main_~m~5), 301#(<= (+ ULTIMATE.start_main_~j~5 8) ULTIMATE.start_main_~m~5), 302#(<= (+ ULTIMATE.start_main_~j~5 7) ULTIMATE.start_main_~m~5)] [2018-07-23 13:47:14,409 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:14,409 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:47:14,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:47:14,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:47:14,410 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2018-07-23 13:47:14,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:14,508 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-07-23 13:47:14,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:47:14,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-07-23 13:47:14,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:14,509 INFO L225 Difference]: With dead ends: 29 [2018-07-23 13:47:14,509 INFO L226 Difference]: Without dead ends: 17 [2018-07-23 13:47:14,512 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:47:14,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-23 13:47:14,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-23 13:47:14,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-23 13:47:14,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-07-23 13:47:14,522 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-07-23 13:47:14,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:14,522 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-07-23 13:47:14,522 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:47:14,524 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-07-23 13:47:14,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:47:14,524 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:14,525 INFO L357 BasicCegarLoop]: trace histogram [5, 4, 2, 1, 1, 1, 1, 1] [2018-07-23 13:47:14,525 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:14,525 INFO L82 PathProgramCache]: Analyzing trace with hash -2126375675, now seen corresponding path program 4 times [2018-07-23 13:47:14,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:14,597 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:14,602 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:14,603 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:47:14,603 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:14,603 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:47:14,604 INFO L185 omatonBuilderFactory]: Interpolants [403#true, 404#false, 405#(<= 10 ULTIMATE.start_main_~m~5), 406#(<= (+ ULTIMATE.start_main_~j~5 10) ULTIMATE.start_main_~m~5), 407#(<= (+ ULTIMATE.start_main_~j~5 9) ULTIMATE.start_main_~m~5), 408#(<= (+ ULTIMATE.start_main_~j~5 8) ULTIMATE.start_main_~m~5), 409#(<= (+ ULTIMATE.start_main_~j~5 7) ULTIMATE.start_main_~m~5), 410#(<= (+ ULTIMATE.start_main_~j~5 6) ULTIMATE.start_main_~m~5)] [2018-07-23 13:47:14,604 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:14,604 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:47:14,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:47:14,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:47:14,606 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 8 states. [2018-07-23 13:47:14,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:14,677 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-07-23 13:47:14,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 13:47:14,677 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-23 13:47:14,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:14,678 INFO L225 Difference]: With dead ends: 33 [2018-07-23 13:47:14,678 INFO L226 Difference]: Without dead ends: 19 [2018-07-23 13:47:14,679 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:47:14,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-23 13:47:14,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-23 13:47:14,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-23 13:47:14,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-07-23 13:47:14,692 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-07-23 13:47:14,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:14,693 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-07-23 13:47:14,693 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:47:14,693 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-07-23 13:47:14,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:47:14,694 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:14,694 INFO L357 BasicCegarLoop]: trace histogram [6, 5, 2, 1, 1, 1, 1, 1] [2018-07-23 13:47:14,694 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:14,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1025146463, now seen corresponding path program 5 times [2018-07-23 13:47:14,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:14,746 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:14,747 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:14,747 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:47:14,747 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:14,747 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:47:14,748 INFO L185 omatonBuilderFactory]: Interpolants [528#(<= (+ ULTIMATE.start_main_~j~5 10) ULTIMATE.start_main_~m~5), 529#(<= (+ ULTIMATE.start_main_~j~5 9) ULTIMATE.start_main_~m~5), 530#(<= (+ ULTIMATE.start_main_~j~5 8) ULTIMATE.start_main_~m~5), 531#(<= (+ ULTIMATE.start_main_~j~5 7) ULTIMATE.start_main_~m~5), 532#(<= (+ ULTIMATE.start_main_~j~5 6) ULTIMATE.start_main_~m~5), 533#(<= (+ ULTIMATE.start_main_~j~5 5) ULTIMATE.start_main_~m~5), 525#true, 526#false, 527#(<= 10 ULTIMATE.start_main_~m~5)] [2018-07-23 13:47:14,748 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:14,749 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:47:14,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:47:14,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:47:14,750 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 9 states. [2018-07-23 13:47:14,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:14,841 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-07-23 13:47:14,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:47:14,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-07-23 13:47:14,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:14,843 INFO L225 Difference]: With dead ends: 37 [2018-07-23 13:47:14,843 INFO L226 Difference]: Without dead ends: 21 [2018-07-23 13:47:14,844 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:47:14,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-23 13:47:14,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-23 13:47:14,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-23 13:47:14,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-07-23 13:47:14,850 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-07-23 13:47:14,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:14,850 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-07-23 13:47:14,850 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:47:14,850 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-07-23 13:47:14,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:47:14,851 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:14,852 INFO L357 BasicCegarLoop]: trace histogram [7, 6, 2, 1, 1, 1, 1, 1] [2018-07-23 13:47:14,852 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:14,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1685977401, now seen corresponding path program 6 times [2018-07-23 13:47:14,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:14,901 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:14,902 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:14,902 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:47:14,902 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:14,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:47:14,903 INFO L185 omatonBuilderFactory]: Interpolants [662#true, 663#false, 664#(<= 10 ULTIMATE.start_main_~m~5), 665#(<= (+ ULTIMATE.start_main_~j~5 10) ULTIMATE.start_main_~m~5), 666#(<= (+ ULTIMATE.start_main_~j~5 9) ULTIMATE.start_main_~m~5), 667#(<= (+ ULTIMATE.start_main_~j~5 8) ULTIMATE.start_main_~m~5), 668#(<= (+ ULTIMATE.start_main_~j~5 7) ULTIMATE.start_main_~m~5), 669#(<= (+ ULTIMATE.start_main_~j~5 6) ULTIMATE.start_main_~m~5), 670#(<= (+ ULTIMATE.start_main_~j~5 5) ULTIMATE.start_main_~m~5), 671#(<= (+ ULTIMATE.start_main_~j~5 4) ULTIMATE.start_main_~m~5)] [2018-07-23 13:47:14,904 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:14,904 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:47:14,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:47:14,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:47:14,905 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 10 states. [2018-07-23 13:47:14,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:14,961 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-07-23 13:47:14,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:47:14,961 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-07-23 13:47:14,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:14,962 INFO L225 Difference]: With dead ends: 41 [2018-07-23 13:47:14,962 INFO L226 Difference]: Without dead ends: 23 [2018-07-23 13:47:14,963 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:47:14,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-23 13:47:14,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-23 13:47:14,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-23 13:47:14,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-07-23 13:47:14,969 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-07-23 13:47:14,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:14,970 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-07-23 13:47:14,970 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:47:14,970 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-07-23 13:47:14,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:47:14,971 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:14,971 INFO L357 BasicCegarLoop]: trace histogram [8, 7, 2, 1, 1, 1, 1, 1] [2018-07-23 13:47:14,972 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:14,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1089349011, now seen corresponding path program 7 times [2018-07-23 13:47:14,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:15,013 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:15,013 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:15,014 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:47:15,014 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:15,014 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:47:15,015 INFO L185 omatonBuilderFactory]: Interpolants [816#(<= 10 ULTIMATE.start_main_~m~5), 817#(<= (+ ULTIMATE.start_main_~j~5 10) ULTIMATE.start_main_~m~5), 818#(<= (+ ULTIMATE.start_main_~j~5 9) ULTIMATE.start_main_~m~5), 819#(<= (+ ULTIMATE.start_main_~j~5 8) ULTIMATE.start_main_~m~5), 820#(<= (+ ULTIMATE.start_main_~j~5 7) ULTIMATE.start_main_~m~5), 821#(<= (+ ULTIMATE.start_main_~j~5 6) ULTIMATE.start_main_~m~5), 822#(<= (+ ULTIMATE.start_main_~j~5 5) ULTIMATE.start_main_~m~5), 823#(<= (+ ULTIMATE.start_main_~j~5 4) ULTIMATE.start_main_~m~5), 824#(<= (+ ULTIMATE.start_main_~j~5 3) ULTIMATE.start_main_~m~5), 814#true, 815#false] [2018-07-23 13:47:15,015 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:15,015 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:47:15,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:47:15,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:47:15,017 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 11 states. [2018-07-23 13:47:15,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:15,072 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-07-23 13:47:15,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:47:15,072 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-07-23 13:47:15,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:15,073 INFO L225 Difference]: With dead ends: 45 [2018-07-23 13:47:15,073 INFO L226 Difference]: Without dead ends: 25 [2018-07-23 13:47:15,074 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:47:15,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-23 13:47:15,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-23 13:47:15,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-23 13:47:15,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-07-23 13:47:15,080 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-07-23 13:47:15,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:15,081 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-07-23 13:47:15,081 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:47:15,081 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-07-23 13:47:15,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-23 13:47:15,082 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:15,082 INFO L357 BasicCegarLoop]: trace histogram [9, 8, 2, 1, 1, 1, 1, 1] [2018-07-23 13:47:15,082 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:15,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1039883411, now seen corresponding path program 8 times [2018-07-23 13:47:15,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:15,129 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 2 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:15,129 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:15,130 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:47:15,130 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:15,130 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:47:15,132 INFO L185 omatonBuilderFactory]: Interpolants [992#(<= (+ ULTIMATE.start_main_~j~5 2) ULTIMATE.start_main_~m~5), 981#true, 982#false, 983#(<= 10 ULTIMATE.start_main_~m~5), 984#(<= (+ ULTIMATE.start_main_~j~5 10) ULTIMATE.start_main_~m~5), 985#(<= (+ ULTIMATE.start_main_~j~5 9) ULTIMATE.start_main_~m~5), 986#(<= (+ ULTIMATE.start_main_~j~5 8) ULTIMATE.start_main_~m~5), 987#(<= (+ ULTIMATE.start_main_~j~5 7) ULTIMATE.start_main_~m~5), 988#(<= (+ ULTIMATE.start_main_~j~5 6) ULTIMATE.start_main_~m~5), 989#(<= (+ ULTIMATE.start_main_~j~5 5) ULTIMATE.start_main_~m~5), 990#(<= (+ ULTIMATE.start_main_~j~5 4) ULTIMATE.start_main_~m~5), 991#(<= (+ ULTIMATE.start_main_~j~5 3) ULTIMATE.start_main_~m~5)] [2018-07-23 13:47:15,132 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 2 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:15,133 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:47:15,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:47:15,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:47:15,134 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 12 states. [2018-07-23 13:47:15,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:15,202 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-07-23 13:47:15,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:47:15,203 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-07-23 13:47:15,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:15,204 INFO L225 Difference]: With dead ends: 49 [2018-07-23 13:47:15,204 INFO L226 Difference]: Without dead ends: 27 [2018-07-23 13:47:15,205 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:47:15,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-23 13:47:15,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-23 13:47:15,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-23 13:47:15,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-07-23 13:47:15,212 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-07-23 13:47:15,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:15,213 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-07-23 13:47:15,213 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:47:15,213 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-07-23 13:47:15,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-23 13:47:15,214 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:15,214 INFO L357 BasicCegarLoop]: trace histogram [10, 9, 2, 1, 1, 1, 1, 1] [2018-07-23 13:47:15,215 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:15,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1467159239, now seen corresponding path program 9 times [2018-07-23 13:47:15,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:15,274 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 2 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:15,274 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:15,275 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:47:15,275 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:15,275 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:47:15,276 INFO L185 omatonBuilderFactory]: Interpolants [1163#true, 1164#false, 1165#(<= 10 ULTIMATE.start_main_~m~5), 1166#(<= (+ ULTIMATE.start_main_~j~5 10) ULTIMATE.start_main_~m~5), 1167#(<= (+ ULTIMATE.start_main_~j~5 9) ULTIMATE.start_main_~m~5), 1168#(<= (+ ULTIMATE.start_main_~j~5 8) ULTIMATE.start_main_~m~5), 1169#(<= (+ ULTIMATE.start_main_~j~5 7) ULTIMATE.start_main_~m~5), 1170#(<= (+ ULTIMATE.start_main_~j~5 6) ULTIMATE.start_main_~m~5), 1171#(<= (+ ULTIMATE.start_main_~j~5 5) ULTIMATE.start_main_~m~5), 1172#(<= (+ ULTIMATE.start_main_~j~5 4) ULTIMATE.start_main_~m~5), 1173#(<= (+ ULTIMATE.start_main_~j~5 3) ULTIMATE.start_main_~m~5), 1174#(<= (+ ULTIMATE.start_main_~j~5 2) ULTIMATE.start_main_~m~5), 1175#(<= (+ ULTIMATE.start_main_~j~5 1) ULTIMATE.start_main_~m~5)] [2018-07-23 13:47:15,276 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 2 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:15,277 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:47:15,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:47:15,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:47:15,278 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 13 states. [2018-07-23 13:47:15,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:15,382 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-07-23 13:47:15,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:47:15,383 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-07-23 13:47:15,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:15,389 INFO L225 Difference]: With dead ends: 53 [2018-07-23 13:47:15,389 INFO L226 Difference]: Without dead ends: 29 [2018-07-23 13:47:15,390 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:47:15,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-23 13:47:15,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-23 13:47:15,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-23 13:47:15,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-07-23 13:47:15,407 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-07-23 13:47:15,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:15,409 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-07-23 13:47:15,409 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:47:15,410 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-07-23 13:47:15,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-23 13:47:15,412 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:15,412 INFO L357 BasicCegarLoop]: trace histogram [11, 10, 2, 1, 1, 1, 1, 1] [2018-07-23 13:47:15,412 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:15,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1258492833, now seen corresponding path program 10 times [2018-07-23 13:47:15,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-23 13:47:15,448 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:15,449 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 13:47:15,449 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:15,450 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:47:15,450 INFO L185 omatonBuilderFactory]: Interpolants [1360#true, 1361#false, 1362#(<= (+ ULTIMATE.start_main_~i~5 10) ULTIMATE.start_main_~n~5), 1363#(<= (+ ULTIMATE.start_main_~i~5 9) ULTIMATE.start_main_~n~5)] [2018-07-23 13:47:15,451 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-23 13:47:15,451 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:47:15,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:47:15,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:47:15,452 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 4 states. [2018-07-23 13:47:15,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:15,482 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2018-07-23 13:47:15,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:47:15,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-07-23 13:47:15,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:15,485 INFO L225 Difference]: With dead ends: 77 [2018-07-23 13:47:15,485 INFO L226 Difference]: Without dead ends: 75 [2018-07-23 13:47:15,486 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:47:15,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-23 13:47:15,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2018-07-23 13:47:15,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-23 13:47:15,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-07-23 13:47:15,510 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 28 [2018-07-23 13:47:15,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:15,511 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-07-23 13:47:15,511 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:47:15,512 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-07-23 13:47:15,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-23 13:47:15,513 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:15,513 INFO L357 BasicCegarLoop]: trace histogram [22, 20, 3, 2, 2, 1, 1, 1] [2018-07-23 13:47:15,518 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:15,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1680906619, now seen corresponding path program 11 times [2018-07-23 13:47:15,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:15,571 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 248 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-07-23 13:47:15,571 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:15,571 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:47:15,572 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:15,572 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:47:15,573 INFO L185 omatonBuilderFactory]: Interpolants [1624#true, 1625#false, 1626#(<= (+ ULTIMATE.start_main_~i~5 10) ULTIMATE.start_main_~n~5), 1627#(<= (+ ULTIMATE.start_main_~i~5 9) ULTIMATE.start_main_~n~5), 1628#(<= (+ ULTIMATE.start_main_~i~5 8) ULTIMATE.start_main_~n~5)] [2018-07-23 13:47:15,573 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 248 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-07-23 13:47:15,574 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:47:15,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:47:15,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:47:15,575 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 5 states. [2018-07-23 13:47:15,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:15,614 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-07-23 13:47:15,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:47:15,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-07-23 13:47:15,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:15,616 INFO L225 Difference]: With dead ends: 101 [2018-07-23 13:47:15,616 INFO L226 Difference]: Without dead ends: 99 [2018-07-23 13:47:15,619 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:47:15,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-23 13:47:15,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 77. [2018-07-23 13:47:15,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-23 13:47:15,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-07-23 13:47:15,640 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 52 [2018-07-23 13:47:15,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:15,643 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-07-23 13:47:15,644 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:47:15,644 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-07-23 13:47:15,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-23 13:47:15,649 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:15,649 INFO L357 BasicCegarLoop]: trace histogram [33, 30, 4, 3, 3, 1, 1, 1] [2018-07-23 13:47:15,649 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:15,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1350520491, now seen corresponding path program 12 times [2018-07-23 13:47:15,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:15,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1068 backedges. 0 proven. 738 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-07-23 13:47:15,732 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:15,733 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:47:15,733 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:15,733 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:47:15,734 INFO L185 omatonBuilderFactory]: Interpolants [1985#true, 1986#false, 1987#(<= (+ ULTIMATE.start_main_~i~5 10) ULTIMATE.start_main_~n~5), 1988#(<= (+ ULTIMATE.start_main_~i~5 9) ULTIMATE.start_main_~n~5), 1989#(<= (+ ULTIMATE.start_main_~i~5 8) ULTIMATE.start_main_~n~5), 1990#(<= (+ ULTIMATE.start_main_~i~5 7) ULTIMATE.start_main_~n~5)] [2018-07-23 13:47:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1068 backedges. 0 proven. 738 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-07-23 13:47:15,735 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:47:15,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:47:15,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:47:15,736 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 6 states. [2018-07-23 13:47:15,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:15,770 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2018-07-23 13:47:15,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:47:15,771 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2018-07-23 13:47:15,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:15,772 INFO L225 Difference]: With dead ends: 125 [2018-07-23 13:47:15,772 INFO L226 Difference]: Without dead ends: 123 [2018-07-23 13:47:15,773 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:47:15,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-23 13:47:15,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 101. [2018-07-23 13:47:15,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-23 13:47:15,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2018-07-23 13:47:15,800 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 76 [2018-07-23 13:47:15,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:15,800 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2018-07-23 13:47:15,800 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:47:15,801 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-07-23 13:47:15,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-23 13:47:15,802 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:15,802 INFO L357 BasicCegarLoop]: trace histogram [44, 40, 5, 4, 4, 1, 1, 1] [2018-07-23 13:47:15,803 INFO L414 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:15,803 INFO L82 PathProgramCache]: Analyzing trace with hash -220374225, now seen corresponding path program 13 times [2018-07-23 13:47:15,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:15,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1912 backedges. 0 proven. 1472 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-07-23 13:47:15,901 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:15,901 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:47:15,901 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:15,902 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:47:15,902 INFO L185 omatonBuilderFactory]: Interpolants [2448#(<= (+ ULTIMATE.start_main_~i~5 7) ULTIMATE.start_main_~n~5), 2449#(<= (+ ULTIMATE.start_main_~i~5 6) ULTIMATE.start_main_~n~5), 2443#true, 2444#false, 2445#(<= (+ ULTIMATE.start_main_~i~5 10) ULTIMATE.start_main_~n~5), 2446#(<= (+ ULTIMATE.start_main_~i~5 9) ULTIMATE.start_main_~n~5), 2447#(<= (+ ULTIMATE.start_main_~i~5 8) ULTIMATE.start_main_~n~5)] [2018-07-23 13:47:15,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1912 backedges. 0 proven. 1472 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-07-23 13:47:15,904 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:47:15,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:47:15,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:47:15,905 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 7 states. [2018-07-23 13:47:15,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:15,947 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2018-07-23 13:47:15,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:47:15,948 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-07-23 13:47:15,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:15,949 INFO L225 Difference]: With dead ends: 149 [2018-07-23 13:47:15,949 INFO L226 Difference]: Without dead ends: 147 [2018-07-23 13:47:15,950 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:47:15,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-23 13:47:15,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 125. [2018-07-23 13:47:15,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-23 13:47:15,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2018-07-23 13:47:15,989 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 100 [2018-07-23 13:47:15,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:15,989 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2018-07-23 13:47:15,989 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:47:15,990 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2018-07-23 13:47:15,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-23 13:47:15,994 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:15,994 INFO L357 BasicCegarLoop]: trace histogram [55, 50, 6, 5, 5, 1, 1, 1] [2018-07-23 13:47:15,994 INFO L414 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:15,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1446024969, now seen corresponding path program 14 times [2018-07-23 13:47:15,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:16,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3000 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2018-07-23 13:47:16,128 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:16,128 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:47:16,128 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:16,129 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:47:16,129 INFO L185 omatonBuilderFactory]: Interpolants [2998#true, 2999#false, 3000#(<= (+ ULTIMATE.start_main_~i~5 10) ULTIMATE.start_main_~n~5), 3001#(<= (+ ULTIMATE.start_main_~i~5 9) ULTIMATE.start_main_~n~5), 3002#(<= (+ ULTIMATE.start_main_~i~5 8) ULTIMATE.start_main_~n~5), 3003#(<= (+ ULTIMATE.start_main_~i~5 7) ULTIMATE.start_main_~n~5), 3004#(<= (+ ULTIMATE.start_main_~i~5 6) ULTIMATE.start_main_~n~5), 3005#(<= (+ ULTIMATE.start_main_~i~5 5) ULTIMATE.start_main_~n~5)] [2018-07-23 13:47:16,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3000 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2018-07-23 13:47:16,135 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:47:16,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:47:16,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:47:16,136 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand 8 states. [2018-07-23 13:47:16,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:16,204 INFO L93 Difference]: Finished difference Result 173 states and 180 transitions. [2018-07-23 13:47:16,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 13:47:16,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 124 [2018-07-23 13:47:16,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:16,206 INFO L225 Difference]: With dead ends: 173 [2018-07-23 13:47:16,213 INFO L226 Difference]: Without dead ends: 171 [2018-07-23 13:47:16,214 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:47:16,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-07-23 13:47:16,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 149. [2018-07-23 13:47:16,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-23 13:47:16,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 155 transitions. [2018-07-23 13:47:16,264 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 155 transitions. Word has length 124 [2018-07-23 13:47:16,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:16,265 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 155 transitions. [2018-07-23 13:47:16,265 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:47:16,265 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 155 transitions. [2018-07-23 13:47:16,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-23 13:47:16,271 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:16,272 INFO L357 BasicCegarLoop]: trace histogram [66, 60, 7, 6, 6, 1, 1, 1] [2018-07-23 13:47:16,272 INFO L414 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:16,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1667523811, now seen corresponding path program 15 times [2018-07-23 13:47:16,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:16,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:16,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4332 backedges. 0 proven. 3672 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-07-23 13:47:16,449 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:16,449 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:47:16,450 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:16,450 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:47:16,451 INFO L185 omatonBuilderFactory]: Interpolants [3650#true, 3651#false, 3652#(<= (+ ULTIMATE.start_main_~i~5 10) ULTIMATE.start_main_~n~5), 3653#(<= (+ ULTIMATE.start_main_~i~5 9) ULTIMATE.start_main_~n~5), 3654#(<= (+ ULTIMATE.start_main_~i~5 8) ULTIMATE.start_main_~n~5), 3655#(<= (+ ULTIMATE.start_main_~i~5 7) ULTIMATE.start_main_~n~5), 3656#(<= (+ ULTIMATE.start_main_~i~5 6) ULTIMATE.start_main_~n~5), 3657#(<= (+ ULTIMATE.start_main_~i~5 5) ULTIMATE.start_main_~n~5), 3658#(<= (+ ULTIMATE.start_main_~i~5 4) ULTIMATE.start_main_~n~5)] [2018-07-23 13:47:16,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4332 backedges. 0 proven. 3672 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-07-23 13:47:16,454 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:47:16,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:47:16,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:47:16,455 INFO L87 Difference]: Start difference. First operand 149 states and 155 transitions. Second operand 9 states. [2018-07-23 13:47:16,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:16,531 INFO L93 Difference]: Finished difference Result 197 states and 205 transitions. [2018-07-23 13:47:16,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:47:16,532 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2018-07-23 13:47:16,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:16,533 INFO L225 Difference]: With dead ends: 197 [2018-07-23 13:47:16,533 INFO L226 Difference]: Without dead ends: 195 [2018-07-23 13:47:16,534 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:47:16,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-07-23 13:47:16,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 173. [2018-07-23 13:47:16,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-23 13:47:16,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 180 transitions. [2018-07-23 13:47:16,589 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 180 transitions. Word has length 148 [2018-07-23 13:47:16,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:16,590 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 180 transitions. [2018-07-23 13:47:16,591 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:47:16,591 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 180 transitions. [2018-07-23 13:47:16,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-07-23 13:47:16,593 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:16,593 INFO L357 BasicCegarLoop]: trace histogram [77, 70, 8, 7, 7, 1, 1, 1] [2018-07-23 13:47:16,593 INFO L414 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:16,594 INFO L82 PathProgramCache]: Analyzing trace with hash 107136189, now seen corresponding path program 16 times [2018-07-23 13:47:16,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:16,800 INFO L134 CoverageAnalysis]: Checked inductivity of 5908 backedges. 0 proven. 5138 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-07-23 13:47:16,800 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:16,800 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:47:16,801 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:16,801 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:47:16,802 INFO L185 omatonBuilderFactory]: Interpolants [4400#false, 4401#(<= (+ ULTIMATE.start_main_~i~5 10) ULTIMATE.start_main_~n~5), 4402#(<= (+ ULTIMATE.start_main_~i~5 9) ULTIMATE.start_main_~n~5), 4403#(<= (+ ULTIMATE.start_main_~i~5 8) ULTIMATE.start_main_~n~5), 4404#(<= (+ ULTIMATE.start_main_~i~5 7) ULTIMATE.start_main_~n~5), 4405#(<= (+ ULTIMATE.start_main_~i~5 6) ULTIMATE.start_main_~n~5), 4406#(<= (+ ULTIMATE.start_main_~i~5 5) ULTIMATE.start_main_~n~5), 4407#(<= (+ ULTIMATE.start_main_~i~5 4) ULTIMATE.start_main_~n~5), 4408#(<= (+ ULTIMATE.start_main_~i~5 3) ULTIMATE.start_main_~n~5), 4399#true] [2018-07-23 13:47:16,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5908 backedges. 0 proven. 5138 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-07-23 13:47:16,806 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:47:16,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:47:16,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:47:16,807 INFO L87 Difference]: Start difference. First operand 173 states and 180 transitions. Second operand 10 states. [2018-07-23 13:47:16,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:16,899 INFO L93 Difference]: Finished difference Result 221 states and 230 transitions. [2018-07-23 13:47:16,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:47:16,900 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 172 [2018-07-23 13:47:16,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:16,901 INFO L225 Difference]: With dead ends: 221 [2018-07-23 13:47:16,901 INFO L226 Difference]: Without dead ends: 219 [2018-07-23 13:47:16,902 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:47:16,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-07-23 13:47:16,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 197. [2018-07-23 13:47:16,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-07-23 13:47:16,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 205 transitions. [2018-07-23 13:47:16,970 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 205 transitions. Word has length 172 [2018-07-23 13:47:16,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:16,971 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 205 transitions. [2018-07-23 13:47:16,971 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:47:16,971 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 205 transitions. [2018-07-23 13:47:16,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-07-23 13:47:16,973 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:16,974 INFO L357 BasicCegarLoop]: trace histogram [88, 80, 9, 8, 8, 1, 1, 1] [2018-07-23 13:47:16,974 INFO L414 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:16,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1927956841, now seen corresponding path program 17 times [2018-07-23 13:47:16,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:17,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7728 backedges. 0 proven. 6848 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-07-23 13:47:17,256 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:17,256 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:47:17,256 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:17,257 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:47:17,257 INFO L185 omatonBuilderFactory]: Interpolants [5248#(<= (+ ULTIMATE.start_main_~i~5 9) ULTIMATE.start_main_~n~5), 5249#(<= (+ ULTIMATE.start_main_~i~5 8) ULTIMATE.start_main_~n~5), 5250#(<= (+ ULTIMATE.start_main_~i~5 7) ULTIMATE.start_main_~n~5), 5251#(<= (+ ULTIMATE.start_main_~i~5 6) ULTIMATE.start_main_~n~5), 5252#(<= (+ ULTIMATE.start_main_~i~5 5) ULTIMATE.start_main_~n~5), 5253#(<= (+ ULTIMATE.start_main_~i~5 4) ULTIMATE.start_main_~n~5), 5254#(<= (+ ULTIMATE.start_main_~i~5 3) ULTIMATE.start_main_~n~5), 5255#(<= (+ ULTIMATE.start_main_~i~5 2) ULTIMATE.start_main_~n~5), 5245#true, 5246#false, 5247#(<= (+ ULTIMATE.start_main_~i~5 10) ULTIMATE.start_main_~n~5)] [2018-07-23 13:47:17,262 INFO L134 CoverageAnalysis]: Checked inductivity of 7728 backedges. 0 proven. 6848 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-07-23 13:47:17,262 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:47:17,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:47:17,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:47:17,263 INFO L87 Difference]: Start difference. First operand 197 states and 205 transitions. Second operand 11 states. [2018-07-23 13:47:17,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:17,353 INFO L93 Difference]: Finished difference Result 245 states and 255 transitions. [2018-07-23 13:47:17,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:47:17,354 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 196 [2018-07-23 13:47:17,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:17,356 INFO L225 Difference]: With dead ends: 245 [2018-07-23 13:47:17,356 INFO L226 Difference]: Without dead ends: 243 [2018-07-23 13:47:17,356 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:47:17,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-07-23 13:47:17,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 221. [2018-07-23 13:47:17,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-07-23 13:47:17,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 230 transitions. [2018-07-23 13:47:17,421 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 230 transitions. Word has length 196 [2018-07-23 13:47:17,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:17,422 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 230 transitions. [2018-07-23 13:47:17,422 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:47:17,422 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 230 transitions. [2018-07-23 13:47:17,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-07-23 13:47:17,424 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:17,425 INFO L357 BasicCegarLoop]: trace histogram [99, 90, 10, 9, 9, 1, 1, 1] [2018-07-23 13:47:17,425 INFO L414 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:17,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1486407055, now seen corresponding path program 18 times [2018-07-23 13:47:17,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:17,622 INFO L134 CoverageAnalysis]: Checked inductivity of 9792 backedges. 0 proven. 8802 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-07-23 13:47:17,622 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:17,622 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:47:17,623 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:17,623 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:47:17,624 INFO L185 omatonBuilderFactory]: Interpolants [6192#(<= (+ ULTIMATE.start_main_~i~5 8) ULTIMATE.start_main_~n~5), 6193#(<= (+ ULTIMATE.start_main_~i~5 7) ULTIMATE.start_main_~n~5), 6194#(<= (+ ULTIMATE.start_main_~i~5 6) ULTIMATE.start_main_~n~5), 6195#(<= (+ ULTIMATE.start_main_~i~5 5) ULTIMATE.start_main_~n~5), 6196#(<= (+ ULTIMATE.start_main_~i~5 4) ULTIMATE.start_main_~n~5), 6197#(<= (+ ULTIMATE.start_main_~i~5 3) ULTIMATE.start_main_~n~5), 6198#(<= (+ ULTIMATE.start_main_~i~5 2) ULTIMATE.start_main_~n~5), 6199#(<= (+ ULTIMATE.start_main_~i~5 1) ULTIMATE.start_main_~n~5), 6188#true, 6189#false, 6190#(<= (+ ULTIMATE.start_main_~i~5 10) ULTIMATE.start_main_~n~5), 6191#(<= (+ ULTIMATE.start_main_~i~5 9) ULTIMATE.start_main_~n~5)] [2018-07-23 13:47:17,627 INFO L134 CoverageAnalysis]: Checked inductivity of 9792 backedges. 0 proven. 8802 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-07-23 13:47:17,627 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:47:17,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:47:17,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:47:17,628 INFO L87 Difference]: Start difference. First operand 221 states and 230 transitions. Second operand 12 states. [2018-07-23 13:47:17,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:17,715 INFO L93 Difference]: Finished difference Result 247 states and 257 transitions. [2018-07-23 13:47:17,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:47:17,716 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 220 [2018-07-23 13:47:17,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:17,717 INFO L225 Difference]: With dead ends: 247 [2018-07-23 13:47:17,717 INFO L226 Difference]: Without dead ends: 245 [2018-07-23 13:47:17,718 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:47:17,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-07-23 13:47:17,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-07-23 13:47:17,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-07-23 13:47:17,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 255 transitions. [2018-07-23 13:47:17,791 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 255 transitions. Word has length 220 [2018-07-23 13:47:17,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:17,792 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 255 transitions. [2018-07-23 13:47:17,792 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:47:17,792 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 255 transitions. [2018-07-23 13:47:17,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-07-23 13:47:17,795 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:17,795 INFO L357 BasicCegarLoop]: trace histogram [110, 100, 11, 10, 10, 1, 1, 1] [2018-07-23 13:47:17,795 INFO L414 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:17,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1732333643, now seen corresponding path program 19 times [2018-07-23 13:47:17,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:19,127 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 12082 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-07-23 13:47:19,127 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:47:19,127 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2018-07-23 13:47:19,128 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:19,129 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:47:19,132 INFO L185 omatonBuilderFactory]: Interpolants [7184#true, 7185#false, 7186#(<= 0 ULTIMATE.start_main_~k~5), 7187#(<= 1 ULTIMATE.start_main_~k~5), 7188#(<= 2 ULTIMATE.start_main_~k~5), 7189#(<= 3 ULTIMATE.start_main_~k~5), 7190#(<= 4 ULTIMATE.start_main_~k~5), 7191#(<= 5 ULTIMATE.start_main_~k~5), 7192#(<= 6 ULTIMATE.start_main_~k~5), 7193#(<= 7 ULTIMATE.start_main_~k~5), 7194#(<= 8 ULTIMATE.start_main_~k~5), 7195#(<= 9 ULTIMATE.start_main_~k~5), 7196#(<= 10 ULTIMATE.start_main_~k~5), 7197#(<= 11 ULTIMATE.start_main_~k~5), 7198#(<= 12 ULTIMATE.start_main_~k~5), 7199#(<= 13 ULTIMATE.start_main_~k~5), 7200#(<= 14 ULTIMATE.start_main_~k~5), 7201#(<= 15 ULTIMATE.start_main_~k~5), 7202#(<= 16 ULTIMATE.start_main_~k~5), 7203#(<= 17 ULTIMATE.start_main_~k~5), 7204#(<= 18 ULTIMATE.start_main_~k~5), 7205#(<= 19 ULTIMATE.start_main_~k~5), 7206#(<= 20 ULTIMATE.start_main_~k~5), 7207#(<= 21 ULTIMATE.start_main_~k~5), 7208#(<= 22 ULTIMATE.start_main_~k~5), 7209#(<= 23 ULTIMATE.start_main_~k~5), 7210#(<= 24 ULTIMATE.start_main_~k~5), 7211#(<= 25 ULTIMATE.start_main_~k~5), 7212#(<= 26 ULTIMATE.start_main_~k~5), 7213#(<= 27 ULTIMATE.start_main_~k~5), 7214#(<= 28 ULTIMATE.start_main_~k~5), 7215#(<= 29 ULTIMATE.start_main_~k~5), 7216#(<= 30 ULTIMATE.start_main_~k~5), 7217#(<= 31 ULTIMATE.start_main_~k~5), 7218#(<= 32 ULTIMATE.start_main_~k~5), 7219#(<= 33 ULTIMATE.start_main_~k~5), 7220#(<= 34 ULTIMATE.start_main_~k~5), 7221#(<= 35 ULTIMATE.start_main_~k~5), 7222#(<= 36 ULTIMATE.start_main_~k~5), 7223#(<= 37 ULTIMATE.start_main_~k~5), 7224#(<= 38 ULTIMATE.start_main_~k~5), 7225#(<= 39 ULTIMATE.start_main_~k~5), 7226#(<= 40 ULTIMATE.start_main_~k~5), 7227#(<= 41 ULTIMATE.start_main_~k~5), 7228#(<= 42 ULTIMATE.start_main_~k~5), 7229#(<= 43 ULTIMATE.start_main_~k~5), 7230#(<= 44 ULTIMATE.start_main_~k~5), 7231#(<= 45 ULTIMATE.start_main_~k~5), 7232#(<= 46 ULTIMATE.start_main_~k~5), 7233#(<= 47 ULTIMATE.start_main_~k~5), 7234#(<= 48 ULTIMATE.start_main_~k~5), 7235#(<= 49 ULTIMATE.start_main_~k~5), 7236#(<= 50 ULTIMATE.start_main_~k~5), 7237#(<= 51 ULTIMATE.start_main_~k~5), 7238#(<= 52 ULTIMATE.start_main_~k~5), 7239#(<= 53 ULTIMATE.start_main_~k~5), 7240#(<= 54 ULTIMATE.start_main_~k~5), 7241#(<= 55 ULTIMATE.start_main_~k~5), 7242#(<= 56 ULTIMATE.start_main_~k~5), 7243#(<= 57 ULTIMATE.start_main_~k~5), 7244#(<= 58 ULTIMATE.start_main_~k~5), 7245#(<= 59 ULTIMATE.start_main_~k~5), 7246#(<= 60 ULTIMATE.start_main_~k~5), 7247#(<= 61 ULTIMATE.start_main_~k~5), 7248#(<= 62 ULTIMATE.start_main_~k~5), 7249#(<= 63 ULTIMATE.start_main_~k~5), 7250#(<= 64 ULTIMATE.start_main_~k~5), 7251#(<= 65 ULTIMATE.start_main_~k~5), 7252#(<= 66 ULTIMATE.start_main_~k~5), 7253#(<= 67 ULTIMATE.start_main_~k~5), 7254#(<= 68 ULTIMATE.start_main_~k~5), 7255#(<= 69 ULTIMATE.start_main_~k~5), 7256#(<= 70 ULTIMATE.start_main_~k~5), 7257#(<= 71 ULTIMATE.start_main_~k~5), 7258#(<= 72 ULTIMATE.start_main_~k~5), 7259#(<= 73 ULTIMATE.start_main_~k~5), 7260#(<= 74 ULTIMATE.start_main_~k~5), 7261#(<= 75 ULTIMATE.start_main_~k~5), 7262#(<= 76 ULTIMATE.start_main_~k~5), 7263#(<= 77 ULTIMATE.start_main_~k~5), 7264#(<= 78 ULTIMATE.start_main_~k~5), 7265#(<= 79 ULTIMATE.start_main_~k~5), 7266#(<= 80 ULTIMATE.start_main_~k~5), 7267#(<= 81 ULTIMATE.start_main_~k~5), 7268#(<= 82 ULTIMATE.start_main_~k~5), 7269#(<= 83 ULTIMATE.start_main_~k~5), 7270#(<= 84 ULTIMATE.start_main_~k~5), 7271#(<= 85 ULTIMATE.start_main_~k~5), 7272#(<= 86 ULTIMATE.start_main_~k~5), 7273#(<= 87 ULTIMATE.start_main_~k~5), 7274#(<= 88 ULTIMATE.start_main_~k~5), 7275#(<= 89 ULTIMATE.start_main_~k~5), 7276#(<= 90 ULTIMATE.start_main_~k~5), 7277#(<= 91 ULTIMATE.start_main_~k~5), 7278#(<= 92 ULTIMATE.start_main_~k~5), 7279#(<= 93 ULTIMATE.start_main_~k~5), 7280#(<= 94 ULTIMATE.start_main_~k~5), 7281#(<= 95 ULTIMATE.start_main_~k~5), 7282#(<= 96 ULTIMATE.start_main_~k~5), 7283#(<= 97 ULTIMATE.start_main_~k~5), 7284#(<= 98 ULTIMATE.start_main_~k~5), 7285#(<= 99 ULTIMATE.start_main_~k~5), 7286#(<= 100 ULTIMATE.start_main_~k~5)] [2018-07-23 13:47:19,135 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 12082 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-07-23 13:47:19,136 INFO L450 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-23 13:47:19,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-23 13:47:19,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 13:47:19,146 INFO L87 Difference]: Start difference. First operand 245 states and 255 transitions. Second operand 103 states. [2018-07-23 13:47:22,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:22,390 INFO L93 Difference]: Finished difference Result 10235 states and 10695 transitions. [2018-07-23 13:47:22,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-23 13:47:22,390 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 244 [2018-07-23 13:47:22,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:22,391 INFO L225 Difference]: With dead ends: 10235 [2018-07-23 13:47:22,391 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 13:47:22,409 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 13:47:22,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 13:47:22,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 13:47:22,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 13:47:22,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 13:47:22,410 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 244 [2018-07-23 13:47:22,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:22,410 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 13:47:22,411 INFO L472 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-23 13:47:22,411 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 13:47:22,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 13:47:22,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 13:47:24,153 WARN L169 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 680 DAG size of output: 671 [2018-07-23 13:48:10,547 WARN L169 SmtUtils]: Spent 46.38 s on a formula simplification. DAG size of input: 5090 DAG size of output: 1364 [2018-07-23 13:48:54,348 WARN L169 SmtUtils]: Spent 43.78 s on a formula simplification. DAG size of input: 5090 DAG size of output: 1364 [2018-07-23 13:48:55,042 WARN L169 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 680 DAG size of output: 671 [2018-07-23 13:48:55,785 WARN L169 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 671 DAG size of output: 68 [2018-07-23 13:49:01,644 WARN L169 SmtUtils]: Spent 5.85 s on a formula simplification. DAG size of input: 1364 DAG size of output: 369 [2018-07-23 13:49:06,156 WARN L169 SmtUtils]: Spent 4.50 s on a formula simplification. DAG size of input: 1364 DAG size of output: 369 [2018-07-23 13:49:06,532 WARN L169 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 671 DAG size of output: 68 [2018-07-23 13:49:06,544 INFO L417 ceAbstractionStarter]: At program point L70(lines 48 70) the Hoare annotation is: (let ((.cse33 (<= (+ ULTIMATE.start_main_~j~5 7) ULTIMATE.start_main_~m~5)) (.cse38 (<= (+ ULTIMATE.start_main_~j~5 5) ULTIMATE.start_main_~m~5)) (.cse30 (<= (+ ULTIMATE.start_main_~j~5 1) ULTIMATE.start_main_~m~5)) (.cse39 (<= (+ ULTIMATE.start_main_~j~5 3) ULTIMATE.start_main_~m~5)) (.cse3 (<= (+ ULTIMATE.start_main_~j~5 10) ULTIMATE.start_main_~m~5)) (.cse10 (<= (+ ULTIMATE.start_main_~j~5 4) ULTIMATE.start_main_~m~5)) (.cse34 (<= (+ ULTIMATE.start_main_~j~5 8) ULTIMATE.start_main_~m~5)) (.cse31 (<= (+ ULTIMATE.start_main_~j~5 2) ULTIMATE.start_main_~m~5)) (.cse28 (<= (+ ULTIMATE.start_main_~j~5 9) ULTIMATE.start_main_~m~5)) (.cse4 (<= 10 ULTIMATE.start_main_~m~5)) (.cse22 (<= (+ ULTIMATE.start_main_~j~5 6) ULTIMATE.start_main_~m~5))) (let ((.cse7 (<= 90 ULTIMATE.start_main_~k~5)) (.cse27 (<= 70 ULTIMATE.start_main_~k~5)) (.cse29 (<= 60 ULTIMATE.start_main_~k~5)) (.cse36 (<= 10 ULTIMATE.start_main_~k~5)) (.cse25 (<= 20 ULTIMATE.start_main_~k~5)) (.cse1 (and .cse4 .cse22)) (.cse35 (<= 50 ULTIMATE.start_main_~k~5)) (.cse15 (and .cse28 .cse4)) (.cse11 (and .cse31 .cse4)) (.cse17 (<= (+ ULTIMATE.start_main_~i~5 8) ULTIMATE.start_main_~n~5)) (.cse24 (<= 40 ULTIMATE.start_main_~k~5)) (.cse6 (<= (+ ULTIMATE.start_main_~i~5 6) ULTIMATE.start_main_~n~5)) (.cse23 (and .cse4 .cse34)) (.cse32 (<= 80 ULTIMATE.start_main_~k~5)) (.cse0 (<= (+ ULTIMATE.start_main_~i~5 1) ULTIMATE.start_main_~n~5)) (.cse20 (and .cse4 .cse10)) (.cse2 (<= (+ ULTIMATE.start_main_~i~5 10) ULTIMATE.start_main_~n~5)) (.cse19 (<= (+ ULTIMATE.start_main_~i~5 7) ULTIMATE.start_main_~n~5)) (.cse8 (and .cse3 .cse4)) (.cse37 (<= 30 ULTIMATE.start_main_~k~5)) (.cse13 (and .cse4 .cse39)) (.cse12 (<= (+ ULTIMATE.start_main_~i~5 3) ULTIMATE.start_main_~n~5)) (.cse16 (<= (+ ULTIMATE.start_main_~i~5 5) ULTIMATE.start_main_~n~5)) (.cse18 (and .cse30 .cse4)) (.cse9 (<= (+ ULTIMATE.start_main_~i~5 9) ULTIMATE.start_main_~n~5)) (.cse26 (and .cse38 .cse4)) (.cse14 (<= (+ ULTIMATE.start_main_~i~5 2) ULTIMATE.start_main_~n~5)) (.cse5 (and .cse33 .cse4)) (.cse21 (<= (+ ULTIMATE.start_main_~i~5 4) ULTIMATE.start_main_~n~5))) (or (and .cse0 .cse1 (<= 94 ULTIMATE.start_main_~k~5)) (and .cse2 .cse3 (<= 0 ULTIMATE.start_main_~k~5) .cse4) (and .cse5 .cse6 (<= 43 ULTIMATE.start_main_~k~5)) (and .cse0 .cse7 .cse8) (and .cse9 (<= 16 ULTIMATE.start_main_~k~5) .cse4 .cse10) (and (<= 78 ULTIMATE.start_main_~k~5) .cse11 .cse12) (and .cse0 .cse13 (<= 97 ULTIMATE.start_main_~k~5)) (and (<= 88 ULTIMATE.start_main_~k~5) .cse11 .cse14) (and .cse5 (<= 83 ULTIMATE.start_main_~k~5) .cse14) (and .cse15 .cse16 (<= 51 ULTIMATE.start_main_~k~5)) (and .cse17 (<= 29 ULTIMATE.start_main_~k~5) .cse18) (and .cse17 (<= 28 ULTIMATE.start_main_~k~5) .cse11) (and (<= 71 ULTIMATE.start_main_~k~5) .cse15 .cse12) (and .cse19 .cse20 (<= 36 ULTIMATE.start_main_~k~5)) (and .cse0 .cse15 (<= 91 ULTIMATE.start_main_~k~5)) (and (<= 74 ULTIMATE.start_main_~k~5) .cse12 .cse1) (and .cse11 .cse21 (<= 68 ULTIMATE.start_main_~k~5)) (and .cse15 .cse17 (<= 21 ULTIMATE.start_main_~k~5)) (and .cse9 (<= 14 ULTIMATE.start_main_~k~5) .cse4 .cse22) (and (<= 61 ULTIMATE.start_main_~k~5) .cse15 .cse21) (and .cse15 .cse19 (<= 31 ULTIMATE.start_main_~k~5)) (and .cse19 .cse18 (<= 39 ULTIMATE.start_main_~k~5)) (and (<= 72 ULTIMATE.start_main_~k~5) .cse23 .cse12) (and .cse0 (<= 99 ULTIMATE.start_main_~k~5) .cse18) (and .cse5 (<= 53 ULTIMATE.start_main_~k~5) .cse16) (and .cse0 (<= 98 ULTIMATE.start_main_~k~5) .cse11) (and (<= 54 ULTIMATE.start_main_~k~5) .cse16 .cse1) (and .cse8 .cse24 .cse6) (and .cse13 .cse19 (<= 37 ULTIMATE.start_main_~k~5)) (and .cse8 .cse17 .cse25) (and .cse19 .cse26 (<= 35 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 92 ULTIMATE.start_main_~k~5) .cse23) (and .cse27 .cse4 .cse21) (and .cse7 .cse4 .cse14) (and .cse2 .cse28 (<= 1 ULTIMATE.start_main_~k~5) .cse4) (and .cse29 .cse21 .cse8) (and .cse1 (<= 64 ULTIMATE.start_main_~k~5) .cse21) (and .cse13 (<= 87 ULTIMATE.start_main_~k~5) .cse14) (and .cse17 (<= 24 ULTIMATE.start_main_~k~5) .cse1) (and .cse27 .cse8 .cse12) (and (<= 89 ULTIMATE.start_main_~k~5) .cse18 .cse14) (and .cse2 .cse4 .cse22 (<= 4 ULTIMATE.start_main_~k~5)) (and .cse6 (<= 47 ULTIMATE.start_main_~k~5) .cse13) (and .cse18 (<= 79 ULTIMATE.start_main_~k~5) .cse12) (and .cse30 (<= 19 ULTIMATE.start_main_~k~5) .cse9 .cse4) (and .cse0 .cse5 (<= 93 ULTIMATE.start_main_~k~5)) (and .cse19 (<= 34 ULTIMATE.start_main_~k~5) .cse1) (and .cse20 .cse21 (<= 66 ULTIMATE.start_main_~k~5)) (and (<= 56 ULTIMATE.start_main_~k~5) .cse20 .cse16) (and .cse19 .cse5 (<= 33 ULTIMATE.start_main_~k~5)) (and .cse2 .cse31 .cse4 (<= 8 ULTIMATE.start_main_~k~5)) (and (<= 65 ULTIMATE.start_main_~k~5) .cse21 .cse26) (and (<= 45 ULTIMATE.start_main_~k~5) .cse6 .cse26) (and (<= 81 ULTIMATE.start_main_~k~5) .cse15 .cse14) (and .cse18 (<= 69 ULTIMATE.start_main_~k~5) .cse21) (and .cse19 (<= 38 ULTIMATE.start_main_~k~5) .cse11) (and .cse4 .cse12 .cse32) (and .cse2 (<= 3 ULTIMATE.start_main_~k~5) .cse33 .cse4) (and (<= 46 ULTIMATE.start_main_~k~5) .cse20 .cse6) (and .cse9 .cse4 (<= 12 ULTIMATE.start_main_~k~5) .cse34) (and .cse17 .cse23 (<= 22 ULTIMATE.start_main_~k~5)) (and .cse35 .cse16 .cse8) (and (<= 32 ULTIMATE.start_main_~k~5) .cse19 .cse23) (and .cse2 (<= 6 ULTIMATE.start_main_~k~5) .cse4 .cse10) (and .cse16 .cse29 .cse4) (and .cse6 (<= 48 ULTIMATE.start_main_~k~5) .cse11) (and .cse31 (<= 18 ULTIMATE.start_main_~k~5) .cse9 .cse4) (and .cse2 .cse36 .cse4) (and .cse17 .cse13 (<= 27 ULTIMATE.start_main_~k~5)) (and .cse0 .cse26 (<= 95 ULTIMATE.start_main_~k~5)) (and .cse26 .cse17 (<= 25 ULTIMATE.start_main_~k~5)) (and .cse16 .cse23 (<= 52 ULTIMATE.start_main_~k~5)) (and .cse2 .cse30 .cse4 (<= 9 ULTIMATE.start_main_~k~5)) (and .cse28 .cse9 (<= 11 ULTIMATE.start_main_~k~5) .cse4) (and .cse6 .cse1 (<= 44 ULTIMATE.start_main_~k~5)) (and .cse36 .cse9 .cse3 .cse4) (and .cse17 (<= 26 ULTIMATE.start_main_~k~5) .cse20) (and .cse6 .cse18 (<= 49 ULTIMATE.start_main_~k~5)) (and .cse25 .cse9 .cse4) (and (<= 84 ULTIMATE.start_main_~k~5) .cse1 .cse14) (and .cse17 .cse4 .cse37) (and .cse35 .cse6 .cse4) (and (<= 41 ULTIMATE.start_main_~k~5) .cse6 .cse15) (and (<= 82 ULTIMATE.start_main_~k~5) .cse23 .cse14) (and .cse0 (<= 100 ULTIMATE.start_main_~k~5) .cse4) (and .cse11 .cse16 (<= 58 ULTIMATE.start_main_~k~5)) (and .cse2 .cse38 .cse4 (<= 5 ULTIMATE.start_main_~k~5)) (and (<= 76 ULTIMATE.start_main_~k~5) .cse20 .cse12) (and .cse17 (<= 23 ULTIMATE.start_main_~k~5) .cse5) (and .cse24 .cse19 .cse4) (and .cse21 .cse13 (<= 67 ULTIMATE.start_main_~k~5)) (and .cse16 (<= 57 ULTIMATE.start_main_~k~5) .cse13) (and .cse9 .cse4 (<= 17 ULTIMATE.start_main_~k~5) .cse39) (and .cse26 .cse16 (<= 55 ULTIMATE.start_main_~k~5)) (and .cse23 .cse21 (<= 62 ULTIMATE.start_main_~k~5)) (and (<= 42 ULTIMATE.start_main_~k~5) .cse6 .cse23) (and .cse8 .cse14 .cse32) (and (<= 73 ULTIMATE.start_main_~k~5) .cse12 .cse5) (and .cse20 .cse14 (<= 86 ULTIMATE.start_main_~k~5)) (and .cse2 (<= 7 ULTIMATE.start_main_~k~5) .cse4 .cse39) (and .cse26 .cse12 (<= 75 ULTIMATE.start_main_~k~5)) (and .cse0 .cse20 (<= 96 ULTIMATE.start_main_~k~5)) (and .cse2 (<= 2 ULTIMATE.start_main_~k~5) .cse4 .cse34) (and .cse19 .cse8 .cse37) (and (<= 77 ULTIMATE.start_main_~k~5) .cse13 .cse12) (and .cse16 (<= 59 ULTIMATE.start_main_~k~5) .cse18) (and .cse9 (<= 15 ULTIMATE.start_main_~k~5) .cse38 .cse4) (and .cse9 (<= 13 ULTIMATE.start_main_~k~5) .cse33 .cse4) (and .cse26 (<= 85 ULTIMATE.start_main_~k~5) .cse14) (and .cse5 .cse21 (<= 63 ULTIMATE.start_main_~k~5))))) [2018-07-23 13:49:06,546 INFO L417 ceAbstractionStarter]: At program point L61(lines 31 61) the Hoare annotation is: (let ((.cse0 (<= 10 ULTIMATE.start_main_~m~5))) (or (and (<= 70 ULTIMATE.start_main_~k~5) .cse0 (<= (+ ULTIMATE.start_main_~i~5 3) ULTIMATE.start_main_~n~5)) (and (<= (+ ULTIMATE.start_main_~i~5 10) ULTIMATE.start_main_~n~5) (<= 0 ULTIMATE.start_main_~k~5) .cse0) (and (<= (+ ULTIMATE.start_main_~i~5 7) ULTIMATE.start_main_~n~5) .cse0 (<= 30 ULTIMATE.start_main_~k~5)) (and (<= 100 ULTIMATE.start_main_~k~5) .cse0) (and .cse0 (<= (+ ULTIMATE.start_main_~i~5 2) ULTIMATE.start_main_~n~5) (<= 80 ULTIMATE.start_main_~k~5)) (and (<= (+ ULTIMATE.start_main_~i~5 1) ULTIMATE.start_main_~n~5) (<= 90 ULTIMATE.start_main_~k~5) .cse0) (and (<= (+ ULTIMATE.start_main_~i~5 8) ULTIMATE.start_main_~n~5) (<= 20 ULTIMATE.start_main_~k~5) .cse0) (and (<= 60 ULTIMATE.start_main_~k~5) .cse0 (<= (+ ULTIMATE.start_main_~i~5 4) ULTIMATE.start_main_~n~5)) (and (<= 50 ULTIMATE.start_main_~k~5) (<= (+ ULTIMATE.start_main_~i~5 5) ULTIMATE.start_main_~n~5) .cse0) (and (<= 40 ULTIMATE.start_main_~k~5) (<= (+ ULTIMATE.start_main_~i~5 6) ULTIMATE.start_main_~n~5) .cse0) (and (<= 10 ULTIMATE.start_main_~k~5) (<= (+ ULTIMATE.start_main_~i~5 9) ULTIMATE.start_main_~n~5) .cse0))) [2018-07-23 13:49:06,550 INFO L417 ceAbstractionStarter]: At program point L53(lines 53 62) the Hoare annotation is: (let ((.cse33 (<= (+ ULTIMATE.start_main_~j~5 7) ULTIMATE.start_main_~m~5)) (.cse38 (<= (+ ULTIMATE.start_main_~j~5 5) ULTIMATE.start_main_~m~5)) (.cse30 (<= (+ ULTIMATE.start_main_~j~5 1) ULTIMATE.start_main_~m~5)) (.cse39 (<= (+ ULTIMATE.start_main_~j~5 3) ULTIMATE.start_main_~m~5)) (.cse3 (<= (+ ULTIMATE.start_main_~j~5 10) ULTIMATE.start_main_~m~5)) (.cse10 (<= (+ ULTIMATE.start_main_~j~5 4) ULTIMATE.start_main_~m~5)) (.cse34 (<= (+ ULTIMATE.start_main_~j~5 8) ULTIMATE.start_main_~m~5)) (.cse31 (<= (+ ULTIMATE.start_main_~j~5 2) ULTIMATE.start_main_~m~5)) (.cse28 (<= (+ ULTIMATE.start_main_~j~5 9) ULTIMATE.start_main_~m~5)) (.cse4 (<= 10 ULTIMATE.start_main_~m~5)) (.cse22 (<= (+ ULTIMATE.start_main_~j~5 6) ULTIMATE.start_main_~m~5))) (let ((.cse7 (<= 90 ULTIMATE.start_main_~k~5)) (.cse27 (<= 70 ULTIMATE.start_main_~k~5)) (.cse29 (<= 60 ULTIMATE.start_main_~k~5)) (.cse36 (<= 10 ULTIMATE.start_main_~k~5)) (.cse25 (<= 20 ULTIMATE.start_main_~k~5)) (.cse1 (and .cse4 .cse22)) (.cse35 (<= 50 ULTIMATE.start_main_~k~5)) (.cse15 (and .cse28 .cse4)) (.cse11 (and .cse31 .cse4)) (.cse17 (<= (+ ULTIMATE.start_main_~i~5 8) ULTIMATE.start_main_~n~5)) (.cse24 (<= 40 ULTIMATE.start_main_~k~5)) (.cse6 (<= (+ ULTIMATE.start_main_~i~5 6) ULTIMATE.start_main_~n~5)) (.cse23 (and .cse4 .cse34)) (.cse32 (<= 80 ULTIMATE.start_main_~k~5)) (.cse0 (<= (+ ULTIMATE.start_main_~i~5 1) ULTIMATE.start_main_~n~5)) (.cse20 (and .cse4 .cse10)) (.cse2 (<= (+ ULTIMATE.start_main_~i~5 10) ULTIMATE.start_main_~n~5)) (.cse19 (<= (+ ULTIMATE.start_main_~i~5 7) ULTIMATE.start_main_~n~5)) (.cse8 (and .cse3 .cse4)) (.cse37 (<= 30 ULTIMATE.start_main_~k~5)) (.cse13 (and .cse4 .cse39)) (.cse12 (<= (+ ULTIMATE.start_main_~i~5 3) ULTIMATE.start_main_~n~5)) (.cse16 (<= (+ ULTIMATE.start_main_~i~5 5) ULTIMATE.start_main_~n~5)) (.cse18 (and .cse30 .cse4)) (.cse9 (<= (+ ULTIMATE.start_main_~i~5 9) ULTIMATE.start_main_~n~5)) (.cse26 (and .cse38 .cse4)) (.cse14 (<= (+ ULTIMATE.start_main_~i~5 2) ULTIMATE.start_main_~n~5)) (.cse5 (and .cse33 .cse4)) (.cse21 (<= (+ ULTIMATE.start_main_~i~5 4) ULTIMATE.start_main_~n~5))) (or (and .cse0 .cse1 (<= 94 ULTIMATE.start_main_~k~5)) (and .cse2 .cse3 (<= 0 ULTIMATE.start_main_~k~5) .cse4) (and .cse5 .cse6 (<= 43 ULTIMATE.start_main_~k~5)) (and .cse0 .cse7 .cse8) (and .cse9 (<= 16 ULTIMATE.start_main_~k~5) .cse4 .cse10) (and (<= 78 ULTIMATE.start_main_~k~5) .cse11 .cse12) (and .cse0 .cse13 (<= 97 ULTIMATE.start_main_~k~5)) (and (<= 88 ULTIMATE.start_main_~k~5) .cse11 .cse14) (and .cse5 (<= 83 ULTIMATE.start_main_~k~5) .cse14) (and .cse15 .cse16 (<= 51 ULTIMATE.start_main_~k~5)) (and .cse17 (<= 29 ULTIMATE.start_main_~k~5) .cse18) (and .cse17 (<= 28 ULTIMATE.start_main_~k~5) .cse11) (and (<= 71 ULTIMATE.start_main_~k~5) .cse15 .cse12) (and .cse19 .cse20 (<= 36 ULTIMATE.start_main_~k~5)) (and .cse0 .cse15 (<= 91 ULTIMATE.start_main_~k~5)) (and (<= 74 ULTIMATE.start_main_~k~5) .cse12 .cse1) (and .cse11 .cse21 (<= 68 ULTIMATE.start_main_~k~5)) (and .cse15 .cse17 (<= 21 ULTIMATE.start_main_~k~5)) (and .cse9 (<= 14 ULTIMATE.start_main_~k~5) .cse4 .cse22) (and (<= 61 ULTIMATE.start_main_~k~5) .cse15 .cse21) (and .cse15 .cse19 (<= 31 ULTIMATE.start_main_~k~5)) (and .cse19 .cse18 (<= 39 ULTIMATE.start_main_~k~5)) (and (<= 72 ULTIMATE.start_main_~k~5) .cse23 .cse12) (and .cse0 (<= 99 ULTIMATE.start_main_~k~5) .cse18) (and .cse5 (<= 53 ULTIMATE.start_main_~k~5) .cse16) (and .cse0 (<= 98 ULTIMATE.start_main_~k~5) .cse11) (and (<= 54 ULTIMATE.start_main_~k~5) .cse16 .cse1) (and .cse8 .cse24 .cse6) (and .cse13 .cse19 (<= 37 ULTIMATE.start_main_~k~5)) (and .cse8 .cse17 .cse25) (and .cse19 .cse26 (<= 35 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 92 ULTIMATE.start_main_~k~5) .cse23) (and .cse27 .cse4 .cse21) (and .cse7 .cse4 .cse14) (and .cse2 .cse28 (<= 1 ULTIMATE.start_main_~k~5) .cse4) (and .cse29 .cse21 .cse8) (and .cse1 (<= 64 ULTIMATE.start_main_~k~5) .cse21) (and .cse13 (<= 87 ULTIMATE.start_main_~k~5) .cse14) (and .cse17 (<= 24 ULTIMATE.start_main_~k~5) .cse1) (and .cse27 .cse8 .cse12) (and (<= 89 ULTIMATE.start_main_~k~5) .cse18 .cse14) (and .cse2 .cse4 .cse22 (<= 4 ULTIMATE.start_main_~k~5)) (and .cse6 (<= 47 ULTIMATE.start_main_~k~5) .cse13) (and .cse18 (<= 79 ULTIMATE.start_main_~k~5) .cse12) (and .cse30 (<= 19 ULTIMATE.start_main_~k~5) .cse9 .cse4) (and .cse0 .cse5 (<= 93 ULTIMATE.start_main_~k~5)) (and .cse19 (<= 34 ULTIMATE.start_main_~k~5) .cse1) (and .cse20 .cse21 (<= 66 ULTIMATE.start_main_~k~5)) (and (<= 56 ULTIMATE.start_main_~k~5) .cse20 .cse16) (and .cse19 .cse5 (<= 33 ULTIMATE.start_main_~k~5)) (and .cse2 .cse31 .cse4 (<= 8 ULTIMATE.start_main_~k~5)) (and (<= 65 ULTIMATE.start_main_~k~5) .cse21 .cse26) (and (<= 45 ULTIMATE.start_main_~k~5) .cse6 .cse26) (and (<= 81 ULTIMATE.start_main_~k~5) .cse15 .cse14) (and .cse18 (<= 69 ULTIMATE.start_main_~k~5) .cse21) (and .cse19 (<= 38 ULTIMATE.start_main_~k~5) .cse11) (and .cse4 .cse12 .cse32) (and .cse2 (<= 3 ULTIMATE.start_main_~k~5) .cse33 .cse4) (and (<= 46 ULTIMATE.start_main_~k~5) .cse20 .cse6) (and .cse9 .cse4 (<= 12 ULTIMATE.start_main_~k~5) .cse34) (and .cse17 .cse23 (<= 22 ULTIMATE.start_main_~k~5)) (and .cse35 .cse16 .cse8) (and (<= 32 ULTIMATE.start_main_~k~5) .cse19 .cse23) (and .cse2 (<= 6 ULTIMATE.start_main_~k~5) .cse4 .cse10) (and .cse16 .cse29 .cse4) (and .cse6 (<= 48 ULTIMATE.start_main_~k~5) .cse11) (and .cse31 (<= 18 ULTIMATE.start_main_~k~5) .cse9 .cse4) (and .cse2 .cse36 .cse4) (and .cse17 .cse13 (<= 27 ULTIMATE.start_main_~k~5)) (and .cse0 .cse26 (<= 95 ULTIMATE.start_main_~k~5)) (and .cse26 .cse17 (<= 25 ULTIMATE.start_main_~k~5)) (and .cse16 .cse23 (<= 52 ULTIMATE.start_main_~k~5)) (and .cse2 .cse30 .cse4 (<= 9 ULTIMATE.start_main_~k~5)) (and .cse28 .cse9 (<= 11 ULTIMATE.start_main_~k~5) .cse4) (and .cse6 .cse1 (<= 44 ULTIMATE.start_main_~k~5)) (and .cse36 .cse9 .cse3 .cse4) (and .cse17 (<= 26 ULTIMATE.start_main_~k~5) .cse20) (and .cse6 .cse18 (<= 49 ULTIMATE.start_main_~k~5)) (and .cse25 .cse9 .cse4) (and (<= 84 ULTIMATE.start_main_~k~5) .cse1 .cse14) (and .cse17 .cse4 .cse37) (and .cse35 .cse6 .cse4) (and (<= 41 ULTIMATE.start_main_~k~5) .cse6 .cse15) (and (<= 82 ULTIMATE.start_main_~k~5) .cse23 .cse14) (and .cse0 (<= 100 ULTIMATE.start_main_~k~5) .cse4) (and .cse11 .cse16 (<= 58 ULTIMATE.start_main_~k~5)) (and .cse2 .cse38 .cse4 (<= 5 ULTIMATE.start_main_~k~5)) (and (<= 76 ULTIMATE.start_main_~k~5) .cse20 .cse12) (and .cse17 (<= 23 ULTIMATE.start_main_~k~5) .cse5) (and .cse24 .cse19 .cse4) (and .cse21 .cse13 (<= 67 ULTIMATE.start_main_~k~5)) (and .cse16 (<= 57 ULTIMATE.start_main_~k~5) .cse13) (and .cse9 .cse4 (<= 17 ULTIMATE.start_main_~k~5) .cse39) (and .cse26 .cse16 (<= 55 ULTIMATE.start_main_~k~5)) (and .cse23 .cse21 (<= 62 ULTIMATE.start_main_~k~5)) (and (<= 42 ULTIMATE.start_main_~k~5) .cse6 .cse23) (and .cse8 .cse14 .cse32) (and (<= 73 ULTIMATE.start_main_~k~5) .cse12 .cse5) (and .cse20 .cse14 (<= 86 ULTIMATE.start_main_~k~5)) (and .cse2 (<= 7 ULTIMATE.start_main_~k~5) .cse4 .cse39) (and .cse26 .cse12 (<= 75 ULTIMATE.start_main_~k~5)) (and .cse0 .cse20 (<= 96 ULTIMATE.start_main_~k~5)) (and .cse2 (<= 2 ULTIMATE.start_main_~k~5) .cse4 .cse34) (and .cse19 .cse8 .cse37) (and (<= 77 ULTIMATE.start_main_~k~5) .cse13 .cse12) (and .cse16 (<= 59 ULTIMATE.start_main_~k~5) .cse18) (and .cse9 (<= 15 ULTIMATE.start_main_~k~5) .cse38 .cse4) (and .cse9 (<= 13 ULTIMATE.start_main_~k~5) .cse33 .cse4) (and .cse26 (<= 85 ULTIMATE.start_main_~k~5) .cse14) (and .cse5 .cse21 (<= 63 ULTIMATE.start_main_~k~5))))) [2018-07-23 13:49:06,551 INFO L417 ceAbstractionStarter]: At program point L34(lines 34 45) the Hoare annotation is: (let ((.cse0 (<= 10 ULTIMATE.start_main_~m~5))) (or (and (<= 70 ULTIMATE.start_main_~k~5) .cse0 (<= (+ ULTIMATE.start_main_~i~5 3) ULTIMATE.start_main_~n~5)) (and (<= (+ ULTIMATE.start_main_~i~5 10) ULTIMATE.start_main_~n~5) (<= 0 ULTIMATE.start_main_~k~5) .cse0) (and (<= (+ ULTIMATE.start_main_~i~5 7) ULTIMATE.start_main_~n~5) .cse0 (<= 30 ULTIMATE.start_main_~k~5)) (and (<= 100 ULTIMATE.start_main_~k~5) .cse0) (and .cse0 (<= (+ ULTIMATE.start_main_~i~5 2) ULTIMATE.start_main_~n~5) (<= 80 ULTIMATE.start_main_~k~5)) (and (<= (+ ULTIMATE.start_main_~i~5 1) ULTIMATE.start_main_~n~5) (<= 90 ULTIMATE.start_main_~k~5) .cse0) (and (<= (+ ULTIMATE.start_main_~i~5 8) ULTIMATE.start_main_~n~5) (<= 20 ULTIMATE.start_main_~k~5) .cse0) (and (<= 60 ULTIMATE.start_main_~k~5) .cse0 (<= (+ ULTIMATE.start_main_~i~5 4) ULTIMATE.start_main_~n~5)) (and (<= 50 ULTIMATE.start_main_~k~5) (<= (+ ULTIMATE.start_main_~i~5 5) ULTIMATE.start_main_~n~5) .cse0) (and (<= 40 ULTIMATE.start_main_~k~5) (<= (+ ULTIMATE.start_main_~i~5 6) ULTIMATE.start_main_~n~5) .cse0) (and (<= 10 ULTIMATE.start_main_~k~5) (<= (+ ULTIMATE.start_main_~i~5 9) ULTIMATE.start_main_~n~5) .cse0))) [2018-07-23 13:49:06,552 INFO L417 ceAbstractionStarter]: At program point L44(lines 44 49) the Hoare annotation is: false [2018-07-23 13:49:06,552 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startErr0AssertViolationASSERT(line 50) the Hoare annotation is: false [2018-07-23 13:49:06,552 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 71) the Hoare annotation is: true [2018-07-23 13:49:06,552 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 71) no Hoare annotation was computed. [2018-07-23 13:49:06,552 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 71) no Hoare annotation was computed. [2018-07-23 13:49:06,584 INFO L202 PluginConnector]: Adding new model nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:49:06 BoogieIcfgContainer [2018-07-23 13:49:06,584 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:49:06,585 INFO L168 Benchmark]: Toolchain (without parser) took 113231.07 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2018-07-23 13:49:06,586 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:49:06,587 INFO L168 Benchmark]: Boogie Preprocessor took 48.86 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:49:06,587 INFO L168 Benchmark]: RCFGBuilder took 269.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-23 13:49:06,588 INFO L168 Benchmark]: TraceAbstraction took 112908.61 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2018-07-23 13:49:06,592 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 48.86 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 269.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 112908.61 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: 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: 34]: Loop Invariant Derived loop invariant: (((((((((((70 <= main_~k~5 && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) || ((main_~i~5 + 10 <= main_~n~5 && 0 <= main_~k~5) && 10 <= main_~m~5)) || ((main_~i~5 + 7 <= main_~n~5 && 10 <= main_~m~5) && 30 <= main_~k~5)) || (100 <= main_~k~5 && 10 <= main_~m~5)) || ((10 <= main_~m~5 && main_~i~5 + 2 <= main_~n~5) && 80 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && 90 <= main_~k~5) && 10 <= main_~m~5)) || ((main_~i~5 + 8 <= main_~n~5 && 20 <= main_~k~5) && 10 <= main_~m~5)) || ((60 <= main_~k~5 && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5)) || ((50 <= main_~k~5 && main_~i~5 + 5 <= main_~n~5) && 10 <= main_~m~5)) || ((40 <= main_~k~5 && main_~i~5 + 6 <= main_~n~5) && 10 <= main_~m~5)) || ((10 <= main_~k~5 && main_~i~5 + 9 <= main_~n~5) && 10 <= main_~m~5) - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5) && 94 <= main_~k~5) || (((main_~i~5 + 10 <= main_~n~5 && main_~j~5 + 10 <= main_~m~5) && 0 <= main_~k~5) && 10 <= main_~m~5)) || (((main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 6 <= main_~n~5) && 43 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && 90 <= main_~k~5) && main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5)) || (((main_~i~5 + 9 <= main_~n~5 && 16 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 4 <= main_~m~5)) || ((78 <= main_~k~5 && main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5)) || ((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5) && 97 <= main_~k~5)) || ((88 <= main_~k~5 && main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5) && 83 <= main_~k~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 5 <= main_~n~5) && 51 <= main_~k~5)) || ((main_~i~5 + 8 <= main_~n~5 && 29 <= main_~k~5) && main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5)) || ((main_~i~5 + 8 <= main_~n~5 && 28 <= main_~k~5) && main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5)) || ((71 <= main_~k~5 && main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5)) || ((main_~i~5 + 7 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && 36 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && 91 <= main_~k~5)) || ((74 <= main_~k~5 && main_~i~5 + 3 <= main_~n~5) && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5)) || (((main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && 68 <= main_~k~5)) || (((main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 8 <= main_~n~5) && 21 <= main_~k~5)) || (((main_~i~5 + 9 <= main_~n~5 && 14 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 6 <= main_~m~5)) || ((61 <= main_~k~5 && main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5)) || (((main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 7 <= main_~n~5) && 31 <= main_~k~5)) || ((main_~i~5 + 7 <= main_~n~5 && main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5) && 39 <= main_~k~5)) || ((72 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5)) || ((main_~i~5 + 1 <= main_~n~5 && 99 <= main_~k~5) && main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5)) || (((main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5) && 53 <= main_~k~5) && main_~i~5 + 5 <= main_~n~5)) || ((main_~i~5 + 1 <= main_~n~5 && 98 <= main_~k~5) && main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5)) || ((54 <= main_~k~5 && main_~i~5 + 5 <= main_~n~5) && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5)) || (((main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5) && 40 <= main_~k~5) && main_~i~5 + 6 <= main_~n~5)) || (((10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5) && main_~i~5 + 7 <= main_~n~5) && 37 <= main_~k~5)) || (((main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 8 <= main_~n~5) && 20 <= main_~k~5)) || ((main_~i~5 + 7 <= main_~n~5 && main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5) && 35 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && 92 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5)) || ((70 <= main_~k~5 && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5)) || ((90 <= main_~k~5 && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~i~5 + 10 <= main_~n~5 && main_~j~5 + 9 <= main_~m~5) && 1 <= main_~k~5) && 10 <= main_~m~5)) || ((60 <= main_~k~5 && main_~i~5 + 4 <= main_~n~5) && main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5)) || (((10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5) && 64 <= main_~k~5) && main_~i~5 + 4 <= main_~n~5)) || (((10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5) && 87 <= main_~k~5) && main_~i~5 + 2 <= main_~n~5)) || ((main_~i~5 + 8 <= main_~n~5 && 24 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5)) || ((70 <= main_~k~5 && main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5)) || ((89 <= main_~k~5 && main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~i~5 + 10 <= main_~n~5 && 10 <= main_~m~5) && main_~j~5 + 6 <= main_~m~5) && 4 <= main_~k~5)) || ((main_~i~5 + 6 <= main_~n~5 && 47 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5)) || (((main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5) && 79 <= main_~k~5) && main_~i~5 + 3 <= main_~n~5)) || (((main_~j~5 + 1 <= main_~m~5 && 19 <= main_~k~5) && main_~i~5 + 9 <= main_~n~5) && 10 <= main_~m~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5) && 93 <= main_~k~5)) || ((main_~i~5 + 7 <= main_~n~5 && 34 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5)) || (((10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && 66 <= main_~k~5)) || ((56 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && main_~i~5 + 5 <= main_~n~5)) || ((main_~i~5 + 7 <= main_~n~5 && main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5) && 33 <= main_~k~5)) || (((main_~i~5 + 10 <= main_~n~5 && main_~j~5 + 2 <= main_~m~5) && 10 <= main_~m~5) && 8 <= main_~k~5)) || ((65 <= main_~k~5 && main_~i~5 + 4 <= main_~n~5) && main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5)) || ((45 <= main_~k~5 && main_~i~5 + 6 <= main_~n~5) && main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5)) || ((81 <= main_~k~5 && main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5) && 69 <= main_~k~5) && main_~i~5 + 4 <= main_~n~5)) || ((main_~i~5 + 7 <= main_~n~5 && 38 <= main_~k~5) && main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5)) || ((10 <= main_~m~5 && main_~i~5 + 3 <= main_~n~5) && 80 <= main_~k~5)) || (((main_~i~5 + 10 <= main_~n~5 && 3 <= main_~k~5) && main_~j~5 + 7 <= main_~m~5) && 10 <= main_~m~5)) || ((46 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && main_~i~5 + 6 <= main_~n~5)) || (((main_~i~5 + 9 <= main_~n~5 && 10 <= main_~m~5) && 12 <= main_~k~5) && main_~j~5 + 8 <= main_~m~5)) || ((main_~i~5 + 8 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5) && 22 <= main_~k~5)) || ((50 <= main_~k~5 && main_~i~5 + 5 <= main_~n~5) && main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5)) || ((32 <= main_~k~5 && main_~i~5 + 7 <= main_~n~5) && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5)) || (((main_~i~5 + 10 <= main_~n~5 && 6 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 4 <= main_~m~5)) || ((main_~i~5 + 5 <= main_~n~5 && 60 <= main_~k~5) && 10 <= main_~m~5)) || ((main_~i~5 + 6 <= main_~n~5 && 48 <= main_~k~5) && main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5)) || (((main_~j~5 + 2 <= main_~m~5 && 18 <= main_~k~5) && main_~i~5 + 9 <= main_~n~5) && 10 <= main_~m~5)) || ((main_~i~5 + 10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5)) || ((main_~i~5 + 8 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5) && 27 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5) && 95 <= main_~k~5)) || (((main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 8 <= main_~n~5) && 25 <= main_~k~5)) || ((main_~i~5 + 5 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5) && 52 <= main_~k~5)) || (((main_~i~5 + 10 <= main_~n~5 && main_~j~5 + 1 <= main_~m~5) && 10 <= main_~m~5) && 9 <= main_~k~5)) || (((main_~j~5 + 9 <= main_~m~5 && main_~i~5 + 9 <= main_~n~5) && 11 <= main_~k~5) && 10 <= main_~m~5)) || ((main_~i~5 + 6 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5) && 44 <= main_~k~5)) || (((10 <= main_~k~5 && main_~i~5 + 9 <= main_~n~5) && main_~j~5 + 10 <= main_~m~5) && 10 <= main_~m~5)) || ((main_~i~5 + 8 <= main_~n~5 && 26 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5)) || ((main_~i~5 + 6 <= main_~n~5 && main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5) && 49 <= main_~k~5)) || ((20 <= main_~k~5 && main_~i~5 + 9 <= main_~n~5) && 10 <= main_~m~5)) || ((84 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || ((main_~i~5 + 8 <= main_~n~5 && 10 <= main_~m~5) && 30 <= main_~k~5)) || ((50 <= main_~k~5 && main_~i~5 + 6 <= main_~n~5) && 10 <= main_~m~5)) || ((41 <= main_~k~5 && main_~i~5 + 6 <= main_~n~5) && main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5)) || ((82 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || ((main_~i~5 + 1 <= main_~n~5 && 100 <= main_~k~5) && 10 <= main_~m~5)) || (((main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 5 <= main_~n~5) && 58 <= main_~k~5)) || (((main_~i~5 + 10 <= main_~n~5 && main_~j~5 + 5 <= main_~m~5) && 10 <= main_~m~5) && 5 <= main_~k~5)) || ((76 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5)) || ((main_~i~5 + 8 <= main_~n~5 && 23 <= main_~k~5) && main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5)) || ((40 <= main_~k~5 && main_~i~5 + 7 <= main_~n~5) && 10 <= main_~m~5)) || ((main_~i~5 + 4 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5) && 67 <= main_~k~5)) || ((main_~i~5 + 5 <= main_~n~5 && 57 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5)) || (((main_~i~5 + 9 <= main_~n~5 && 10 <= main_~m~5) && 17 <= main_~k~5) && main_~j~5 + 3 <= main_~m~5)) || (((main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 5 <= main_~n~5) && 55 <= main_~k~5)) || (((10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && 62 <= main_~k~5)) || ((42 <= main_~k~5 && main_~i~5 + 6 <= main_~n~5) && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5)) || (((main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5) && 80 <= main_~k~5)) || ((73 <= main_~k~5 && main_~i~5 + 3 <= main_~n~5) && main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5)) || (((10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5) && 86 <= main_~k~5)) || (((main_~i~5 + 10 <= main_~n~5 && 7 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 3 <= main_~m~5)) || (((main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) && 75 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && 96 <= main_~k~5)) || (((main_~i~5 + 10 <= main_~n~5 && 2 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 8 <= main_~m~5)) || ((main_~i~5 + 7 <= main_~n~5 && main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5) && 30 <= main_~k~5)) || ((77 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5)) || ((main_~i~5 + 5 <= main_~n~5 && 59 <= main_~k~5) && main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5)) || (((main_~i~5 + 9 <= main_~n~5 && 15 <= main_~k~5) && main_~j~5 + 5 <= main_~m~5) && 10 <= main_~m~5)) || (((main_~i~5 + 9 <= main_~n~5 && 13 <= main_~k~5) && main_~j~5 + 7 <= main_~m~5) && 10 <= main_~m~5)) || (((main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5) && 85 <= main_~k~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && 63 <= main_~k~5) - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5) && 94 <= main_~k~5) || (((main_~i~5 + 10 <= main_~n~5 && main_~j~5 + 10 <= main_~m~5) && 0 <= main_~k~5) && 10 <= main_~m~5)) || (((main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 6 <= main_~n~5) && 43 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && 90 <= main_~k~5) && main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5)) || (((main_~i~5 + 9 <= main_~n~5 && 16 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 4 <= main_~m~5)) || ((78 <= main_~k~5 && main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5)) || ((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5) && 97 <= main_~k~5)) || ((88 <= main_~k~5 && main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5) && 83 <= main_~k~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 5 <= main_~n~5) && 51 <= main_~k~5)) || ((main_~i~5 + 8 <= main_~n~5 && 29 <= main_~k~5) && main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5)) || ((main_~i~5 + 8 <= main_~n~5 && 28 <= main_~k~5) && main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5)) || ((71 <= main_~k~5 && main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5)) || ((main_~i~5 + 7 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && 36 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && 91 <= main_~k~5)) || ((74 <= main_~k~5 && main_~i~5 + 3 <= main_~n~5) && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5)) || (((main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && 68 <= main_~k~5)) || (((main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 8 <= main_~n~5) && 21 <= main_~k~5)) || (((main_~i~5 + 9 <= main_~n~5 && 14 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 6 <= main_~m~5)) || ((61 <= main_~k~5 && main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5)) || (((main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 7 <= main_~n~5) && 31 <= main_~k~5)) || ((main_~i~5 + 7 <= main_~n~5 && main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5) && 39 <= main_~k~5)) || ((72 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5)) || ((main_~i~5 + 1 <= main_~n~5 && 99 <= main_~k~5) && main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5)) || (((main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5) && 53 <= main_~k~5) && main_~i~5 + 5 <= main_~n~5)) || ((main_~i~5 + 1 <= main_~n~5 && 98 <= main_~k~5) && main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5)) || ((54 <= main_~k~5 && main_~i~5 + 5 <= main_~n~5) && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5)) || (((main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5) && 40 <= main_~k~5) && main_~i~5 + 6 <= main_~n~5)) || (((10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5) && main_~i~5 + 7 <= main_~n~5) && 37 <= main_~k~5)) || (((main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 8 <= main_~n~5) && 20 <= main_~k~5)) || ((main_~i~5 + 7 <= main_~n~5 && main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5) && 35 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && 92 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5)) || ((70 <= main_~k~5 && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5)) || ((90 <= main_~k~5 && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~i~5 + 10 <= main_~n~5 && main_~j~5 + 9 <= main_~m~5) && 1 <= main_~k~5) && 10 <= main_~m~5)) || ((60 <= main_~k~5 && main_~i~5 + 4 <= main_~n~5) && main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5)) || (((10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5) && 64 <= main_~k~5) && main_~i~5 + 4 <= main_~n~5)) || (((10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5) && 87 <= main_~k~5) && main_~i~5 + 2 <= main_~n~5)) || ((main_~i~5 + 8 <= main_~n~5 && 24 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5)) || ((70 <= main_~k~5 && main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5)) || ((89 <= main_~k~5 && main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~i~5 + 10 <= main_~n~5 && 10 <= main_~m~5) && main_~j~5 + 6 <= main_~m~5) && 4 <= main_~k~5)) || ((main_~i~5 + 6 <= main_~n~5 && 47 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5)) || (((main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5) && 79 <= main_~k~5) && main_~i~5 + 3 <= main_~n~5)) || (((main_~j~5 + 1 <= main_~m~5 && 19 <= main_~k~5) && main_~i~5 + 9 <= main_~n~5) && 10 <= main_~m~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5) && 93 <= main_~k~5)) || ((main_~i~5 + 7 <= main_~n~5 && 34 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5)) || (((10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && 66 <= main_~k~5)) || ((56 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && main_~i~5 + 5 <= main_~n~5)) || ((main_~i~5 + 7 <= main_~n~5 && main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5) && 33 <= main_~k~5)) || (((main_~i~5 + 10 <= main_~n~5 && main_~j~5 + 2 <= main_~m~5) && 10 <= main_~m~5) && 8 <= main_~k~5)) || ((65 <= main_~k~5 && main_~i~5 + 4 <= main_~n~5) && main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5)) || ((45 <= main_~k~5 && main_~i~5 + 6 <= main_~n~5) && main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5)) || ((81 <= main_~k~5 && main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5) && 69 <= main_~k~5) && main_~i~5 + 4 <= main_~n~5)) || ((main_~i~5 + 7 <= main_~n~5 && 38 <= main_~k~5) && main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5)) || ((10 <= main_~m~5 && main_~i~5 + 3 <= main_~n~5) && 80 <= main_~k~5)) || (((main_~i~5 + 10 <= main_~n~5 && 3 <= main_~k~5) && main_~j~5 + 7 <= main_~m~5) && 10 <= main_~m~5)) || ((46 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && main_~i~5 + 6 <= main_~n~5)) || (((main_~i~5 + 9 <= main_~n~5 && 10 <= main_~m~5) && 12 <= main_~k~5) && main_~j~5 + 8 <= main_~m~5)) || ((main_~i~5 + 8 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5) && 22 <= main_~k~5)) || ((50 <= main_~k~5 && main_~i~5 + 5 <= main_~n~5) && main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5)) || ((32 <= main_~k~5 && main_~i~5 + 7 <= main_~n~5) && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5)) || (((main_~i~5 + 10 <= main_~n~5 && 6 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 4 <= main_~m~5)) || ((main_~i~5 + 5 <= main_~n~5 && 60 <= main_~k~5) && 10 <= main_~m~5)) || ((main_~i~5 + 6 <= main_~n~5 && 48 <= main_~k~5) && main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5)) || (((main_~j~5 + 2 <= main_~m~5 && 18 <= main_~k~5) && main_~i~5 + 9 <= main_~n~5) && 10 <= main_~m~5)) || ((main_~i~5 + 10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5)) || ((main_~i~5 + 8 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5) && 27 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5) && 95 <= main_~k~5)) || (((main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 8 <= main_~n~5) && 25 <= main_~k~5)) || ((main_~i~5 + 5 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5) && 52 <= main_~k~5)) || (((main_~i~5 + 10 <= main_~n~5 && main_~j~5 + 1 <= main_~m~5) && 10 <= main_~m~5) && 9 <= main_~k~5)) || (((main_~j~5 + 9 <= main_~m~5 && main_~i~5 + 9 <= main_~n~5) && 11 <= main_~k~5) && 10 <= main_~m~5)) || ((main_~i~5 + 6 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5) && 44 <= main_~k~5)) || (((10 <= main_~k~5 && main_~i~5 + 9 <= main_~n~5) && main_~j~5 + 10 <= main_~m~5) && 10 <= main_~m~5)) || ((main_~i~5 + 8 <= main_~n~5 && 26 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5)) || ((main_~i~5 + 6 <= main_~n~5 && main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5) && 49 <= main_~k~5)) || ((20 <= main_~k~5 && main_~i~5 + 9 <= main_~n~5) && 10 <= main_~m~5)) || ((84 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || ((main_~i~5 + 8 <= main_~n~5 && 10 <= main_~m~5) && 30 <= main_~k~5)) || ((50 <= main_~k~5 && main_~i~5 + 6 <= main_~n~5) && 10 <= main_~m~5)) || ((41 <= main_~k~5 && main_~i~5 + 6 <= main_~n~5) && main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5)) || ((82 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || ((main_~i~5 + 1 <= main_~n~5 && 100 <= main_~k~5) && 10 <= main_~m~5)) || (((main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 5 <= main_~n~5) && 58 <= main_~k~5)) || (((main_~i~5 + 10 <= main_~n~5 && main_~j~5 + 5 <= main_~m~5) && 10 <= main_~m~5) && 5 <= main_~k~5)) || ((76 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5)) || ((main_~i~5 + 8 <= main_~n~5 && 23 <= main_~k~5) && main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5)) || ((40 <= main_~k~5 && main_~i~5 + 7 <= main_~n~5) && 10 <= main_~m~5)) || ((main_~i~5 + 4 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5) && 67 <= main_~k~5)) || ((main_~i~5 + 5 <= main_~n~5 && 57 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5)) || (((main_~i~5 + 9 <= main_~n~5 && 10 <= main_~m~5) && 17 <= main_~k~5) && main_~j~5 + 3 <= main_~m~5)) || (((main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 5 <= main_~n~5) && 55 <= main_~k~5)) || (((10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && 62 <= main_~k~5)) || ((42 <= main_~k~5 && main_~i~5 + 6 <= main_~n~5) && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5)) || (((main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5) && 80 <= main_~k~5)) || ((73 <= main_~k~5 && main_~i~5 + 3 <= main_~n~5) && main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5)) || (((10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5) && 86 <= main_~k~5)) || (((main_~i~5 + 10 <= main_~n~5 && 7 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 3 <= main_~m~5)) || (((main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) && 75 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && 96 <= main_~k~5)) || (((main_~i~5 + 10 <= main_~n~5 && 2 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 8 <= main_~m~5)) || ((main_~i~5 + 7 <= main_~n~5 && main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5) && 30 <= main_~k~5)) || ((77 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5)) || ((main_~i~5 + 5 <= main_~n~5 && 59 <= main_~k~5) && main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5)) || (((main_~i~5 + 9 <= main_~n~5 && 15 <= main_~k~5) && main_~j~5 + 5 <= main_~m~5) && 10 <= main_~m~5)) || (((main_~i~5 + 9 <= main_~n~5 && 13 <= main_~k~5) && main_~j~5 + 7 <= main_~m~5) && 10 <= main_~m~5)) || (((main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5) && 85 <= main_~k~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && 63 <= main_~k~5) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((((((((70 <= main_~k~5 && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) || ((main_~i~5 + 10 <= main_~n~5 && 0 <= main_~k~5) && 10 <= main_~m~5)) || ((main_~i~5 + 7 <= main_~n~5 && 10 <= main_~m~5) && 30 <= main_~k~5)) || (100 <= main_~k~5 && 10 <= main_~m~5)) || ((10 <= main_~m~5 && main_~i~5 + 2 <= main_~n~5) && 80 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && 90 <= main_~k~5) && 10 <= main_~m~5)) || ((main_~i~5 + 8 <= main_~n~5 && 20 <= main_~k~5) && 10 <= main_~m~5)) || ((60 <= main_~k~5 && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5)) || ((50 <= main_~k~5 && main_~i~5 + 5 <= main_~n~5) && 10 <= main_~m~5)) || ((40 <= main_~k~5 && main_~i~5 + 6 <= main_~n~5) && 10 <= main_~m~5)) || ((10 <= main_~k~5 && main_~i~5 + 9 <= main_~n~5) && 10 <= main_~m~5) - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. SAFE Result, 112.8s OverallTime, 21 OverallIterations, 110 TraceHistogramMax, 4.6s AutomataDifference, 0.0s DeadEndRemovalTime, 104.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 497 SDtfs, 552 SDslu, 771 SDs, 0 SdLazy, 542 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 297 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=245occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 17070/46770 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, 21 MinimizatonAttempts, 178 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 10239 NumberOfFragments, 4061 HoareAnnotationTreeSize, 7 FomulaSimplifications, 4073768 FormulaSimplificationTreeSizeReduction, 92.6s HoareSimplificationTime, 7 FomulaSimplificationsInter, 652974 FormulaSimplificationTreeSizeReductionInter, 11.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1534 NumberOfCodeBlocks, 1534 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1513 ConstructedInterpolants, 0 QuantifiedInterpolants, 1037761 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 17070/46770 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/nested.i_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-49-06-609.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/nested.i_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-49-06-609.csv Received shutdown request...