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/vogal.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:50:21,144 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:50:21,148 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:50:21,165 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:50:21,166 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:50:21,167 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:50:21,171 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:50:21,174 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:50:21,176 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:50:21,177 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:50:21,178 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:50:21,178 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:50:21,179 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:50:21,180 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:50:21,181 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:50:21,182 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:50:21,183 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:50:21,185 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:50:21,187 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:50:21,189 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:50:21,190 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:50:21,191 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:50:21,194 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:50:21,194 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:50:21,194 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:50:21,196 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:50:21,197 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:50:21,198 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:50:21,199 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:50:21,200 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:50:21,200 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:50:21,201 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:50:21,201 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:50:21,201 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:50:21,203 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:50:21,203 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:50:21,204 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 13:50:21,220 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:50:21,220 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:50:21,222 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:50:21,222 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:50:21,223 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:50:21,223 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:50:21,223 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:50:21,223 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:50:21,280 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:50:21,298 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:50:21,302 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:50:21,304 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:50:21,304 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:50:21,305 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/vogal.i_5.bpl [2018-07-23 13:50:21,306 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/vogal.i_5.bpl' [2018-07-23 13:50:21,369 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:50:21,371 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:50:21,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:50:21,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:50:21,372 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:50:21,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:21" (1/1) ... [2018-07-23 13:50:21,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:21" (1/1) ... [2018-07-23 13:50:21,417 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:21" (1/1) ... [2018-07-23 13:50:21,417 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:21" (1/1) ... [2018-07-23 13:50:21,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:21" (1/1) ... [2018-07-23 13:50:21,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:21" (1/1) ... [2018-07-23 13:50:21,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:21" (1/1) ... [2018-07-23 13:50:21,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:50:21,430 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:50:21,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:50:21,430 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:50:21,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:21" (1/1) ... [2018-07-23 13:50:21,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 13:50:21,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 13:50:21,778 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 13:50:21,779 INFO L202 PluginConnector]: Adding new model vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:50:21 BoogieIcfgContainer [2018-07-23 13:50:21,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:50:21,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:50:21,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:50:21,784 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:50:21,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:21" (1/2) ... [2018-07-23 13:50:21,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64090e2b and model type vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:50:21, skipping insertion in model container [2018-07-23 13:50:21,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:50:21" (2/2) ... [2018-07-23 13:50:21,788 INFO L112 eAbstractionObserver]: Analyzing ICFG vogal.i_5.bpl [2018-07-23 13:50:21,799 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:50:21,814 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:50:21,865 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:50:21,866 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:50:21,866 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:50:21,866 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:50:21,867 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:50:21,867 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:50:21,867 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:50:21,867 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:50:21,868 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:50:21,885 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2018-07-23 13:50:21,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:50:21,897 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:21,898 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:50:21,898 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:21,906 INFO L82 PathProgramCache]: Analyzing trace with hash 148998095, now seen corresponding path program 1 times [2018-07-23 13:50:21,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:22,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:22,015 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:50:22,015 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 13:50:22,017 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:22,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:22,018 INFO L185 omatonBuilderFactory]: Interpolants [16#(= ULTIMATE.start_main_~i~5 0), 14#true, 15#false] [2018-07-23 13:50:22,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:22,019 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:50:22,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:50:22,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:50:22,035 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2018-07-23 13:50:22,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:22,101 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2018-07-23 13:50:22,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:50:22,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-07-23 13:50:22,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:22,116 INFO L225 Difference]: With dead ends: 27 [2018-07-23 13:50:22,116 INFO L226 Difference]: Without dead ends: 19 [2018-07-23 13:50:22,121 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:50:22,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-23 13:50:22,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 13. [2018-07-23 13:50:22,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 13:50:22,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-07-23 13:50:22,162 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 8 [2018-07-23 13:50:22,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:22,162 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-07-23 13:50:22,162 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:50:22,163 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2018-07-23 13:50:22,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:50:22,164 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:22,164 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:50:22,164 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:22,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1897140361, now seen corresponding path program 1 times [2018-07-23 13:50:22,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:22,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:22,217 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:22,217 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 13:50:22,218 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:22,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:22,218 INFO L185 omatonBuilderFactory]: Interpolants [97#true, 98#false, 99#(= ULTIMATE.start_main_~i~5 0), 100#(and (<= ULTIMATE.start_main_~i~5 1) (<= 1 ULTIMATE.start_main_~i~5))] [2018-07-23 13:50:22,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:22,221 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:50:22,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:50:22,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:50:22,222 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand 4 states. [2018-07-23 13:50:22,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:22,304 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2018-07-23 13:50:22,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:50:22,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-07-23 13:50:22,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:22,305 INFO L225 Difference]: With dead ends: 35 [2018-07-23 13:50:22,306 INFO L226 Difference]: Without dead ends: 27 [2018-07-23 13:50:22,307 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:50:22,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-23 13:50:22,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2018-07-23 13:50:22,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-23 13:50:22,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-07-23 13:50:22,312 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 10 [2018-07-23 13:50:22,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:22,313 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-07-23 13:50:22,313 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:50:22,313 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2018-07-23 13:50:22,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:50:22,314 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:22,314 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:50:22,314 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:22,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1765322045, now seen corresponding path program 2 times [2018-07-23 13:50:22,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:22,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:22,413 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:22,413 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:50:22,413 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:22,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:22,414 INFO L185 omatonBuilderFactory]: Interpolants [201#true, 202#false, 203#(= ULTIMATE.start_main_~i~5 0), 204#(and (<= ULTIMATE.start_main_~i~5 1) (<= 1 ULTIMATE.start_main_~i~5)), 205#(and (<= 2 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 2))] [2018-07-23 13:50:22,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:22,416 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:50:22,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:50:22,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:50:22,417 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand 5 states. [2018-07-23 13:50:22,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:22,553 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-07-23 13:50:22,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:50:22,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-07-23 13:50:22,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:22,555 INFO L225 Difference]: With dead ends: 43 [2018-07-23 13:50:22,555 INFO L226 Difference]: Without dead ends: 35 [2018-07-23 13:50:22,556 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:50:22,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-23 13:50:22,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 17. [2018-07-23 13:50:22,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-23 13:50:22,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-07-23 13:50:22,562 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 12 [2018-07-23 13:50:22,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:22,567 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-07-23 13:50:22,567 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:50:22,567 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2018-07-23 13:50:22,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:50:22,568 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:22,568 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:50:22,568 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:22,569 INFO L82 PathProgramCache]: Analyzing trace with hash 481488509, now seen corresponding path program 3 times [2018-07-23 13:50:22,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:22,615 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:22,616 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:22,616 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:50:22,616 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:22,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:22,617 INFO L185 omatonBuilderFactory]: Interpolants [326#true, 327#false, 328#(= ULTIMATE.start_main_~i~5 0), 329#(and (<= ULTIMATE.start_main_~i~5 1) (<= 1 ULTIMATE.start_main_~i~5)), 330#(and (<= 2 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 2)), 331#(and (<= ULTIMATE.start_main_~i~5 3) (<= 3 ULTIMATE.start_main_~i~5))] [2018-07-23 13:50:22,617 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:22,618 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:50:22,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:50:22,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:50:22,619 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 6 states. [2018-07-23 13:50:22,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:22,791 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2018-07-23 13:50:22,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:50:22,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-07-23 13:50:22,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:22,793 INFO L225 Difference]: With dead ends: 51 [2018-07-23 13:50:22,796 INFO L226 Difference]: Without dead ends: 43 [2018-07-23 13:50:22,797 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:50:22,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-23 13:50:22,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 19. [2018-07-23 13:50:22,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-23 13:50:22,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-07-23 13:50:22,815 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 14 [2018-07-23 13:50:22,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:22,817 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-07-23 13:50:22,817 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:50:22,817 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2018-07-23 13:50:22,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:50:22,818 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:22,818 INFO L357 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:50:22,818 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:22,819 INFO L82 PathProgramCache]: Analyzing trace with hash -702118985, now seen corresponding path program 4 times [2018-07-23 13:50:22,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:22,882 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:22,883 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:22,883 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:50:22,883 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:22,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:22,884 INFO L185 omatonBuilderFactory]: Interpolants [472#true, 473#false, 474#(= ULTIMATE.start_main_~i~5 0), 475#(and (<= ULTIMATE.start_main_~i~5 1) (<= 1 ULTIMATE.start_main_~i~5)), 476#(and (<= 2 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 2)), 477#(and (<= ULTIMATE.start_main_~i~5 3) (<= 3 ULTIMATE.start_main_~i~5)), 478#(and (<= ULTIMATE.start_main_~i~5 4) (<= 4 ULTIMATE.start_main_~i~5))] [2018-07-23 13:50:22,886 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:22,887 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:50:22,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:50:22,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:50:22,888 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 7 states. [2018-07-23 13:50:23,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:23,091 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-07-23 13:50:23,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:50:23,092 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-07-23 13:50:23,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:23,093 INFO L225 Difference]: With dead ends: 59 [2018-07-23 13:50:23,094 INFO L226 Difference]: Without dead ends: 51 [2018-07-23 13:50:23,094 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:50:23,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-23 13:50:23,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 21. [2018-07-23 13:50:23,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-23 13:50:23,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-07-23 13:50:23,102 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2018-07-23 13:50:23,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:23,103 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-07-23 13:50:23,104 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:50:23,104 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-07-23 13:50:23,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:50:23,105 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:23,106 INFO L357 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:50:23,108 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:23,108 INFO L82 PathProgramCache]: Analyzing trace with hash 17412721, now seen corresponding path program 5 times [2018-07-23 13:50:23,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:23,182 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:23,184 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:23,184 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:50:23,184 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:23,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:23,185 INFO L185 omatonBuilderFactory]: Interpolants [640#false, 641#(= ULTIMATE.start_main_~i~5 0), 642#(and (<= ULTIMATE.start_main_~i~5 1) (<= 1 ULTIMATE.start_main_~i~5)), 643#(and (<= 2 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 2)), 644#(and (<= ULTIMATE.start_main_~i~5 3) (<= 3 ULTIMATE.start_main_~i~5)), 645#(and (<= ULTIMATE.start_main_~i~5 4) (<= 4 ULTIMATE.start_main_~i~5)), 646#(and (<= 5 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 5)), 639#true] [2018-07-23 13:50:23,186 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:23,186 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:50:23,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:50:23,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:50:23,187 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 8 states. [2018-07-23 13:50:23,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:23,353 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-07-23 13:50:23,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 13:50:23,354 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-07-23 13:50:23,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:23,358 INFO L225 Difference]: With dead ends: 67 [2018-07-23 13:50:23,358 INFO L226 Difference]: Without dead ends: 59 [2018-07-23 13:50:23,359 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:50:23,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-23 13:50:23,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 23. [2018-07-23 13:50:23,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-23 13:50:23,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-07-23 13:50:23,371 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 18 [2018-07-23 13:50:23,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:23,372 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-07-23 13:50:23,372 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:50:23,372 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-07-23 13:50:23,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:50:23,373 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:23,374 INFO L357 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:50:23,374 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:23,374 INFO L82 PathProgramCache]: Analyzing trace with hash -2352469, now seen corresponding path program 6 times [2018-07-23 13:50:23,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:23,428 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:23,429 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:23,429 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:50:23,429 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:23,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:23,430 INFO L185 omatonBuilderFactory]: Interpolants [832#(and (<= ULTIMATE.start_main_~i~5 3) (<= 3 ULTIMATE.start_main_~i~5)), 833#(and (<= ULTIMATE.start_main_~i~5 4) (<= 4 ULTIMATE.start_main_~i~5)), 834#(and (<= 5 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 5)), 835#(and (<= 6 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 6)), 827#true, 828#false, 829#(= ULTIMATE.start_main_~i~5 0), 830#(and (<= ULTIMATE.start_main_~i~5 1) (<= 1 ULTIMATE.start_main_~i~5)), 831#(and (<= 2 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 2))] [2018-07-23 13:50:23,430 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:23,431 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:50:23,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:50:23,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:50:23,432 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 9 states. [2018-07-23 13:50:23,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:23,571 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2018-07-23 13:50:23,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:50:23,571 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-07-23 13:50:23,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:23,572 INFO L225 Difference]: With dead ends: 75 [2018-07-23 13:50:23,573 INFO L226 Difference]: Without dead ends: 67 [2018-07-23 13:50:23,575 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:50:23,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-23 13:50:23,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 25. [2018-07-23 13:50:23,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-23 13:50:23,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-07-23 13:50:23,589 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 20 [2018-07-23 13:50:23,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:23,589 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-07-23 13:50:23,589 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:50:23,590 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-07-23 13:50:23,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:50:23,591 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:23,591 INFO L357 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:50:23,591 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:23,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1816830875, now seen corresponding path program 7 times [2018-07-23 13:50:23,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:23,642 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:23,642 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:23,642 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:50:23,643 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:23,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:23,643 INFO L185 omatonBuilderFactory]: Interpolants [1040#(and (<= 2 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 2)), 1041#(and (<= ULTIMATE.start_main_~i~5 3) (<= 3 ULTIMATE.start_main_~i~5)), 1042#(and (<= ULTIMATE.start_main_~i~5 4) (<= 4 ULTIMATE.start_main_~i~5)), 1043#(and (<= 5 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 5)), 1044#(and (<= 6 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 6)), 1045#(and (<= 7 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 7)), 1036#true, 1037#false, 1038#(= ULTIMATE.start_main_~i~5 0), 1039#(and (<= ULTIMATE.start_main_~i~5 1) (<= 1 ULTIMATE.start_main_~i~5))] [2018-07-23 13:50:23,644 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:23,644 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:50:23,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:50:23,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:50:23,645 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 10 states. [2018-07-23 13:50:23,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:23,798 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2018-07-23 13:50:23,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:50:23,799 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-07-23 13:50:23,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:23,800 INFO L225 Difference]: With dead ends: 83 [2018-07-23 13:50:23,800 INFO L226 Difference]: Without dead ends: 75 [2018-07-23 13:50:23,802 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:50:23,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-23 13:50:23,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 27. [2018-07-23 13:50:23,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-23 13:50:23,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-07-23 13:50:23,809 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 22 [2018-07-23 13:50:23,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:23,809 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-07-23 13:50:23,809 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:50:23,809 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-07-23 13:50:23,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-23 13:50:23,810 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:23,811 INFO L357 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:50:23,814 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:23,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1773856865, now seen corresponding path program 8 times [2018-07-23 13:50:23,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:23,873 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:23,874 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:23,874 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:50:23,874 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:23,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:23,875 INFO L185 omatonBuilderFactory]: Interpolants [1266#true, 1267#false, 1268#(= ULTIMATE.start_main_~i~5 0), 1269#(and (<= ULTIMATE.start_main_~i~5 1) (<= 1 ULTIMATE.start_main_~i~5)), 1270#(and (<= 2 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 2)), 1271#(and (<= ULTIMATE.start_main_~i~5 3) (<= 3 ULTIMATE.start_main_~i~5)), 1272#(and (<= ULTIMATE.start_main_~i~5 4) (<= 4 ULTIMATE.start_main_~i~5)), 1273#(and (<= 5 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 5)), 1274#(and (<= 6 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 6)), 1275#(and (<= 7 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 7)), 1276#(and (<= ULTIMATE.start_main_~i~5 8) (<= 8 ULTIMATE.start_main_~i~5))] [2018-07-23 13:50:23,876 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:23,876 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:50:23,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:50:23,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:50:23,877 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 11 states. [2018-07-23 13:50:24,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:24,057 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2018-07-23 13:50:24,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:50:24,058 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-07-23 13:50:24,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:24,059 INFO L225 Difference]: With dead ends: 91 [2018-07-23 13:50:24,059 INFO L226 Difference]: Without dead ends: 83 [2018-07-23 13:50:24,060 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:50:24,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-23 13:50:24,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 29. [2018-07-23 13:50:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-23 13:50:24,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-07-23 13:50:24,069 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 24 [2018-07-23 13:50:24,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:24,069 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-07-23 13:50:24,069 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:50:24,069 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-07-23 13:50:24,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-23 13:50:24,070 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:24,071 INFO L357 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:50:24,071 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:24,071 INFO L82 PathProgramCache]: Analyzing trace with hash 869461081, now seen corresponding path program 9 times [2018-07-23 13:50:24,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:24,130 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:24,131 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:24,131 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:50:24,132 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:24,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:24,133 INFO L185 omatonBuilderFactory]: Interpolants [1520#(and (<= ULTIMATE.start_main_~i~5 1) (<= 1 ULTIMATE.start_main_~i~5)), 1521#(and (<= 2 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 2)), 1522#(and (<= ULTIMATE.start_main_~i~5 3) (<= 3 ULTIMATE.start_main_~i~5)), 1523#(and (<= ULTIMATE.start_main_~i~5 4) (<= 4 ULTIMATE.start_main_~i~5)), 1524#(and (<= 5 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 5)), 1525#(and (<= 6 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 6)), 1526#(and (<= 7 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 7)), 1527#(and (<= ULTIMATE.start_main_~i~5 8) (<= 8 ULTIMATE.start_main_~i~5)), 1528#(and (<= ULTIMATE.start_main_~i~5 9) (<= 9 ULTIMATE.start_main_~i~5)), 1517#true, 1518#false, 1519#(= ULTIMATE.start_main_~i~5 0)] [2018-07-23 13:50:24,133 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:24,134 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:50:24,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:50:24,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:50:24,135 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 12 states. [2018-07-23 13:50:24,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:24,346 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2018-07-23 13:50:24,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:50:24,346 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-07-23 13:50:24,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:24,347 INFO L225 Difference]: With dead ends: 99 [2018-07-23 13:50:24,348 INFO L226 Difference]: Without dead ends: 91 [2018-07-23 13:50:24,348 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:50:24,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-23 13:50:24,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 31. [2018-07-23 13:50:24,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-23 13:50:24,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-07-23 13:50:24,368 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 26 [2018-07-23 13:50:24,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:24,369 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-07-23 13:50:24,369 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:50:24,369 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-07-23 13:50:24,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-23 13:50:24,371 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:24,371 INFO L357 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:50:24,371 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:24,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1522632045, now seen corresponding path program 10 times [2018-07-23 13:50:24,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:24,429 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-23 13:50:24,430 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:50:24,430 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:50:24,430 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:24,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:24,431 INFO L185 omatonBuilderFactory]: Interpolants [1789#true, 1790#false, 1791#(and (= ULTIMATE.start_main_~cont~5 0) (= ULTIMATE.start_main_~cont_aux~5 0))] [2018-07-23 13:50:24,431 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-23 13:50:24,431 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:50:24,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:50:24,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:50:24,432 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 3 states. [2018-07-23 13:50:24,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:24,439 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-07-23 13:50:24,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:50:24,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-07-23 13:50:24,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:24,441 INFO L225 Difference]: With dead ends: 37 [2018-07-23 13:50:24,441 INFO L226 Difference]: Without dead ends: 35 [2018-07-23 13:50:24,441 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:50:24,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-23 13:50:24,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-23 13:50:24,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-23 13:50:24,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-07-23 13:50:24,448 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 28 [2018-07-23 13:50:24,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:24,449 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-07-23 13:50:24,449 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:50:24,449 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-07-23 13:50:24,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-23 13:50:24,450 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:24,451 INFO L357 BasicCegarLoop]: trace histogram [11, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:50:24,451 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:24,452 INFO L82 PathProgramCache]: Analyzing trace with hash 50698691, now seen corresponding path program 1 times [2018-07-23 13:50:24,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:24,497 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-23 13:50:24,498 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:24,498 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:50:24,498 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:24,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:24,499 INFO L185 omatonBuilderFactory]: Interpolants [1936#true, 1937#false, 1938#(= ULTIMATE.start_main_~j~5 0), 1939#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1))] [2018-07-23 13:50:24,499 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-23 13:50:24,500 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:50:24,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:50:24,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:50:24,501 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2018-07-23 13:50:24,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:24,511 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-07-23 13:50:24,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:50:24,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-07-23 13:50:24,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:24,513 INFO L225 Difference]: With dead ends: 49 [2018-07-23 13:50:24,513 INFO L226 Difference]: Without dead ends: 39 [2018-07-23 13:50:24,514 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:50:24,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-23 13:50:24,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-07-23 13:50:24,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-23 13:50:24,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-07-23 13:50:24,523 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 34 [2018-07-23 13:50:24,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:24,524 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-07-23 13:50:24,524 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:50:24,524 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-07-23 13:50:24,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-23 13:50:24,525 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:24,525 INFO L357 BasicCegarLoop]: trace histogram [11, 10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:50:24,526 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:24,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1544539549, now seen corresponding path program 2 times [2018-07-23 13:50:24,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:24,576 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-23 13:50:24,577 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:24,577 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:50:24,577 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:24,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:24,578 INFO L185 omatonBuilderFactory]: Interpolants [2112#true, 2113#false, 2114#(= ULTIMATE.start_main_~j~5 0), 2115#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1)), 2116#(and (<= 2 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 2))] [2018-07-23 13:50:24,578 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-23 13:50:24,578 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:50:24,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:50:24,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:50:24,579 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 5 states. [2018-07-23 13:50:24,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:24,592 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-07-23 13:50:24,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:50:24,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-07-23 13:50:24,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:24,593 INFO L225 Difference]: With dead ends: 49 [2018-07-23 13:50:24,593 INFO L226 Difference]: Without dead ends: 39 [2018-07-23 13:50:24,594 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:50:24,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-23 13:50:24,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-23 13:50:24,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-23 13:50:24,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-07-23 13:50:24,604 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 36 [2018-07-23 13:50:24,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:24,604 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-07-23 13:50:24,605 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:50:24,605 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-07-23 13:50:24,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-23 13:50:24,607 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:24,607 INFO L357 BasicCegarLoop]: trace histogram [11, 10, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:50:24,607 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:24,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1688440073, now seen corresponding path program 3 times [2018-07-23 13:50:24,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:24,661 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-23 13:50:24,661 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:24,661 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:50:24,662 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:24,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:24,663 INFO L185 omatonBuilderFactory]: Interpolants [2293#true, 2294#false, 2295#(= ULTIMATE.start_main_~j~5 0), 2296#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1)), 2297#(and (<= 2 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 2)), 2298#(and (<= ULTIMATE.start_main_~j~5 3) (<= 3 ULTIMATE.start_main_~j~5))] [2018-07-23 13:50:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-23 13:50:24,665 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:50:24,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:50:24,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:50:24,666 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2018-07-23 13:50:24,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:24,684 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-07-23 13:50:24,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:50:24,684 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-07-23 13:50:24,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:24,685 INFO L225 Difference]: With dead ends: 53 [2018-07-23 13:50:24,685 INFO L226 Difference]: Without dead ends: 41 [2018-07-23 13:50:24,686 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:50:24,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-23 13:50:24,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-23 13:50:24,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-23 13:50:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-07-23 13:50:24,696 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 38 [2018-07-23 13:50:24,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:24,696 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-07-23 13:50:24,697 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:50:24,697 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-07-23 13:50:24,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-23 13:50:24,699 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:24,699 INFO L357 BasicCegarLoop]: trace histogram [11, 10, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:50:24,699 INFO L414 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:24,700 INFO L82 PathProgramCache]: Analyzing trace with hash 974465489, now seen corresponding path program 4 times [2018-07-23 13:50:24,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:24,761 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-23 13:50:24,761 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:24,762 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:50:24,762 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:24,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:24,763 INFO L185 omatonBuilderFactory]: Interpolants [2487#true, 2488#false, 2489#(= ULTIMATE.start_main_~j~5 0), 2490#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1)), 2491#(and (<= 2 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 2)), 2492#(and (<= ULTIMATE.start_main_~j~5 3) (<= 3 ULTIMATE.start_main_~j~5)), 2493#(and (<= ULTIMATE.start_main_~j~5 4) (<= 4 ULTIMATE.start_main_~j~5))] [2018-07-23 13:50:24,763 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-23 13:50:24,763 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:50:24,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:50:24,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:50:24,764 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 7 states. [2018-07-23 13:50:24,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:24,783 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-07-23 13:50:24,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:50:24,783 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-07-23 13:50:24,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:24,784 INFO L225 Difference]: With dead ends: 57 [2018-07-23 13:50:24,784 INFO L226 Difference]: Without dead ends: 43 [2018-07-23 13:50:24,785 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:50:24,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-23 13:50:24,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-23 13:50:24,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-23 13:50:24,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-07-23 13:50:24,796 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 40 [2018-07-23 13:50:24,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:24,797 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-07-23 13:50:24,797 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:50:24,797 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-07-23 13:50:24,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-23 13:50:24,803 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:24,803 INFO L357 BasicCegarLoop]: trace histogram [11, 10, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:50:24,803 INFO L414 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:24,804 INFO L82 PathProgramCache]: Analyzing trace with hash 226202155, now seen corresponding path program 5 times [2018-07-23 13:50:24,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:24,864 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-23 13:50:24,864 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:24,864 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:50:24,865 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:24,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:24,865 INFO L185 omatonBuilderFactory]: Interpolants [2694#true, 2695#false, 2696#(= ULTIMATE.start_main_~j~5 0), 2697#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1)), 2698#(and (<= 2 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 2)), 2699#(and (<= ULTIMATE.start_main_~j~5 3) (<= 3 ULTIMATE.start_main_~j~5)), 2700#(and (<= ULTIMATE.start_main_~j~5 4) (<= 4 ULTIMATE.start_main_~j~5)), 2701#(and (<= ULTIMATE.start_main_~j~5 5) (<= 5 ULTIMATE.start_main_~j~5))] [2018-07-23 13:50:24,866 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-23 13:50:24,866 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:50:24,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:50:24,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:50:24,867 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 8 states. [2018-07-23 13:50:24,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:24,896 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-07-23 13:50:24,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 13:50:24,897 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-07-23 13:50:24,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:24,898 INFO L225 Difference]: With dead ends: 61 [2018-07-23 13:50:24,898 INFO L226 Difference]: Without dead ends: 45 [2018-07-23 13:50:24,898 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:50:24,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-23 13:50:24,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-23 13:50:24,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-23 13:50:24,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-07-23 13:50:24,905 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 42 [2018-07-23 13:50:24,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:24,906 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-07-23 13:50:24,906 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:50:24,906 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-07-23 13:50:24,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-23 13:50:24,907 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:24,907 INFO L357 BasicCegarLoop]: trace histogram [11, 10, 7, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:50:24,907 INFO L414 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:24,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1595323387, now seen corresponding path program 6 times [2018-07-23 13:50:24,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:24,959 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-23 13:50:24,959 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:24,960 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:50:24,960 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:24,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:24,961 INFO L185 omatonBuilderFactory]: Interpolants [2914#true, 2915#false, 2916#(= ULTIMATE.start_main_~j~5 0), 2917#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1)), 2918#(and (<= 2 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 2)), 2919#(and (<= ULTIMATE.start_main_~j~5 3) (<= 3 ULTIMATE.start_main_~j~5)), 2920#(and (<= ULTIMATE.start_main_~j~5 4) (<= 4 ULTIMATE.start_main_~j~5)), 2921#(and (<= ULTIMATE.start_main_~j~5 5) (<= 5 ULTIMATE.start_main_~j~5)), 2922#(and (<= ULTIMATE.start_main_~j~5 6) (<= 6 ULTIMATE.start_main_~j~5))] [2018-07-23 13:50:24,961 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-23 13:50:24,961 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:50:24,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:50:24,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:50:24,962 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 9 states. [2018-07-23 13:50:24,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:24,989 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-07-23 13:50:24,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:50:24,990 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-07-23 13:50:24,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:24,990 INFO L225 Difference]: With dead ends: 65 [2018-07-23 13:50:24,990 INFO L226 Difference]: Without dead ends: 47 [2018-07-23 13:50:24,991 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:50:24,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-23 13:50:24,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-23 13:50:24,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-23 13:50:25,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-07-23 13:50:25,003 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 44 [2018-07-23 13:50:25,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:25,003 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-07-23 13:50:25,004 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:50:25,004 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-07-23 13:50:25,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-23 13:50:25,005 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:25,007 INFO L357 BasicCegarLoop]: trace histogram [11, 10, 8, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:50:25,008 INFO L414 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:25,008 INFO L82 PathProgramCache]: Analyzing trace with hash 265287519, now seen corresponding path program 7 times [2018-07-23 13:50:25,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:25,080 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 2 proven. 56 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-23 13:50:25,080 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:25,081 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:50:25,081 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:25,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:25,082 INFO L185 omatonBuilderFactory]: Interpolants [3152#(and (<= ULTIMATE.start_main_~j~5 3) (<= 3 ULTIMATE.start_main_~j~5)), 3153#(and (<= ULTIMATE.start_main_~j~5 4) (<= 4 ULTIMATE.start_main_~j~5)), 3154#(and (<= ULTIMATE.start_main_~j~5 5) (<= 5 ULTIMATE.start_main_~j~5)), 3155#(and (<= ULTIMATE.start_main_~j~5 6) (<= 6 ULTIMATE.start_main_~j~5)), 3156#(and (<= 7 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 7)), 3147#true, 3148#false, 3149#(= ULTIMATE.start_main_~j~5 0), 3150#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1)), 3151#(and (<= 2 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 2))] [2018-07-23 13:50:25,082 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 2 proven. 56 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-23 13:50:25,082 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:50:25,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:50:25,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:50:25,083 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 10 states. [2018-07-23 13:50:25,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:25,119 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2018-07-23 13:50:25,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:50:25,119 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2018-07-23 13:50:25,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:25,120 INFO L225 Difference]: With dead ends: 69 [2018-07-23 13:50:25,120 INFO L226 Difference]: Without dead ends: 49 [2018-07-23 13:50:25,121 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:50:25,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-23 13:50:25,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-23 13:50:25,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-23 13:50:25,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-07-23 13:50:25,132 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 46 [2018-07-23 13:50:25,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:25,135 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-07-23 13:50:25,135 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:50:25,135 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-07-23 13:50:25,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-23 13:50:25,136 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:25,136 INFO L357 BasicCegarLoop]: trace histogram [11, 10, 9, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:50:25,136 INFO L414 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:25,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1605973049, now seen corresponding path program 8 times [2018-07-23 13:50:25,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:25,211 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 2 proven. 72 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-23 13:50:25,212 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:25,212 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:50:25,212 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:25,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:25,213 INFO L185 omatonBuilderFactory]: Interpolants [3393#true, 3394#false, 3395#(= ULTIMATE.start_main_~j~5 0), 3396#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1)), 3397#(and (<= 2 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 2)), 3398#(and (<= ULTIMATE.start_main_~j~5 3) (<= 3 ULTIMATE.start_main_~j~5)), 3399#(and (<= ULTIMATE.start_main_~j~5 4) (<= 4 ULTIMATE.start_main_~j~5)), 3400#(and (<= ULTIMATE.start_main_~j~5 5) (<= 5 ULTIMATE.start_main_~j~5)), 3401#(and (<= ULTIMATE.start_main_~j~5 6) (<= 6 ULTIMATE.start_main_~j~5)), 3402#(and (<= 7 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 7)), 3403#(and (<= 8 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 8))] [2018-07-23 13:50:25,213 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 2 proven. 72 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-23 13:50:25,214 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:50:25,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:50:25,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:50:25,215 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 11 states. [2018-07-23 13:50:25,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:25,256 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2018-07-23 13:50:25,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:50:25,256 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-07-23 13:50:25,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:25,257 INFO L225 Difference]: With dead ends: 73 [2018-07-23 13:50:25,257 INFO L226 Difference]: Without dead ends: 51 [2018-07-23 13:50:25,258 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:50:25,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-23 13:50:25,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-23 13:50:25,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-23 13:50:25,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-07-23 13:50:25,263 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 48 [2018-07-23 13:50:25,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:25,264 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-07-23 13:50:25,264 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:50:25,264 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-07-23 13:50:25,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-23 13:50:25,265 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:25,265 INFO L357 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:50:25,265 INFO L414 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:25,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1514578579, now seen corresponding path program 9 times [2018-07-23 13:50:25,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:25,334 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 2 proven. 90 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-23 13:50:25,335 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:25,335 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:50:25,335 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:25,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:25,336 INFO L185 omatonBuilderFactory]: Interpolants [3652#true, 3653#false, 3654#(= ULTIMATE.start_main_~j~5 0), 3655#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1)), 3656#(and (<= 2 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 2)), 3657#(and (<= ULTIMATE.start_main_~j~5 3) (<= 3 ULTIMATE.start_main_~j~5)), 3658#(and (<= ULTIMATE.start_main_~j~5 4) (<= 4 ULTIMATE.start_main_~j~5)), 3659#(and (<= ULTIMATE.start_main_~j~5 5) (<= 5 ULTIMATE.start_main_~j~5)), 3660#(and (<= ULTIMATE.start_main_~j~5 6) (<= 6 ULTIMATE.start_main_~j~5)), 3661#(and (<= 7 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 7)), 3662#(and (<= 8 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 8)), 3663#(and (<= 9 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 9))] [2018-07-23 13:50:25,336 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 2 proven. 90 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-23 13:50:25,337 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:50:25,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:50:25,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:50:25,338 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 12 states. [2018-07-23 13:50:25,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:25,381 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-07-23 13:50:25,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:50:25,382 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2018-07-23 13:50:25,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:25,382 INFO L225 Difference]: With dead ends: 77 [2018-07-23 13:50:25,383 INFO L226 Difference]: Without dead ends: 53 [2018-07-23 13:50:25,383 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:50:25,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-23 13:50:25,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-23 13:50:25,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-23 13:50:25,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-07-23 13:50:25,388 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 50 [2018-07-23 13:50:25,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:25,389 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-07-23 13:50:25,389 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:50:25,389 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-07-23 13:50:25,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-23 13:50:25,390 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:25,390 INFO L357 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:50:25,390 INFO L414 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:25,390 INFO L82 PathProgramCache]: Analyzing trace with hash -416161171, now seen corresponding path program 10 times [2018-07-23 13:50:25,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:25,464 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-07-23 13:50:25,465 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:50:25,465 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:50:25,465 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:25,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:25,466 INFO L185 omatonBuilderFactory]: Interpolants [3924#true, 3925#false, 3926#(and (= ULTIMATE.start_main_~i~5 0) (= 0 (select ULTIMATE.start_main_~string_entrada~5 0)))] [2018-07-23 13:50:25,466 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-07-23 13:50:25,466 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:50:25,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:50:25,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:50:25,467 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 3 states. [2018-07-23 13:50:25,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:25,474 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-07-23 13:50:25,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:50:25,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-07-23 13:50:25,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:25,475 INFO L225 Difference]: With dead ends: 53 [2018-07-23 13:50:25,475 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 13:50:25,476 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:50:25,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 13:50:25,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 13:50:25,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 13:50:25,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 13:50:25,477 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2018-07-23 13:50:25,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:25,477 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 13:50:25,477 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:50:25,478 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 13:50:25,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 13:50:25,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 13:50:25,512 INFO L417 ceAbstractionStarter]: At program point L123(lines 100 123) the Hoare annotation is: false [2018-07-23 13:50:25,512 INFO L424 ceAbstractionStarter]: At program point L83(lines 54 83) the Hoare annotation is: true [2018-07-23 13:50:25,513 INFO L424 ceAbstractionStarter]: At program point L63(lines 44 63) the Hoare annotation is: true [2018-07-23 13:50:25,513 INFO L417 ceAbstractionStarter]: At program point L105(lines 105 114) the Hoare annotation is: false [2018-07-23 13:50:25,513 INFO L417 ceAbstractionStarter]: At program point L86(lines 86 97) the Hoare annotation is: (and (= ULTIMATE.start_main_~cont~5 0) (= ULTIMATE.start_main_~cont_aux~5 0) (= ULTIMATE.start_main_~i~5 0) (= 0 (select ULTIMATE.start_main_~string_entrada~5 0))) [2018-07-23 13:50:25,513 INFO L424 ceAbstractionStarter]: At program point L66(lines 66 78) the Hoare annotation is: true [2018-07-23 13:50:25,514 INFO L424 ceAbstractionStarter]: At program point L47(lines 47 55) the Hoare annotation is: true [2018-07-23 13:50:25,514 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 124) the Hoare annotation is: true [2018-07-23 13:50:25,514 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 124) no Hoare annotation was computed. [2018-07-23 13:50:25,514 INFO L417 ceAbstractionStarter]: At program point L113(lines 77 113) the Hoare annotation is: (and (= ULTIMATE.start_main_~cont~5 0) (= ULTIMATE.start_main_~cont_aux~5 0) (= ULTIMATE.start_main_~i~5 0) (= 0 (select ULTIMATE.start_main_~string_entrada~5 0))) [2018-07-23 13:50:25,514 INFO L417 ceAbstractionStarter]: At program point L96(lines 96 101) the Hoare annotation is: false [2018-07-23 13:50:25,514 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startErr0AssertViolationASSERT(line 102) the Hoare annotation is: false [2018-07-23 13:50:25,515 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 124) no Hoare annotation was computed. [2018-07-23 13:50:25,530 INFO L202 PluginConnector]: Adding new model vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:50:25 BoogieIcfgContainer [2018-07-23 13:50:25,530 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:50:25,532 INFO L168 Benchmark]: Toolchain (without parser) took 4161.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 391.1 MB). Peak memory consumption was 391.1 MB. Max. memory is 7.1 GB. [2018-07-23 13:50:25,534 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:50:25,535 INFO L168 Benchmark]: Boogie Preprocessor took 57.65 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:50:25,536 INFO L168 Benchmark]: RCFGBuilder took 349.15 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:50:25,537 INFO L168 Benchmark]: TraceAbstraction took 3750.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 380.5 MB). Peak memory consumption was 380.5 MB. Max. memory is 7.1 GB. [2018-07-23 13:50:25,544 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.22 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 57.65 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 349.15 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 3750.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 380.5 MB). Peak memory consumption was 380.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 102]: 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: 100]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: true - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: ((main_~cont~5 == 0 && main_~cont_aux~5 == 0) && main_~i~5 == 0) && 0 == main_~string_entrada~5[0] - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: true - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((main_~cont~5 == 0 && main_~cont_aux~5 == 0) && main_~i~5 == 0) && 0 == main_~string_entrada~5[0] - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: true - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: true - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. SAFE Result, 3.6s OverallTime, 21 OverallIterations, 11 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 453 SDtfs, 333 SDslu, 2262 SDs, 0 SdLazy, 2647 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 1340/2000 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 332 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 35 NumberOfFragments, 39 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 628 NumberOfCodeBlocks, 628 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 607 ConstructedInterpolants, 0 QuantifiedInterpolants, 59045 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 1340/2000 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/vogal.i_5.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-50-25-568.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/vogal.i_5.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-50-25-568.csv Received shutdown request...