./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/reducercommutativity/rangesum10_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/reducercommutativity/rangesum10_false-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af68da58954d6230e3860792840330ae6de845ab ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-02 00:17:26,678 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:17:26,680 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:17:26,696 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:17:26,698 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:17:26,699 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:17:26,700 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:17:26,703 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:17:26,705 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:17:26,716 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:17:26,717 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:17:26,717 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:17:26,718 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:17:26,719 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:17:26,722 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:17:26,722 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:17:26,723 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:17:26,725 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:17:26,731 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:17:26,733 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:17:26,734 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:17:26,735 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:17:26,738 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:17:26,738 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:17:26,738 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:17:26,739 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:17:26,741 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:17:26,741 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:17:26,742 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:17:26,743 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:17:26,743 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:17:26,744 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:17:26,744 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:17:26,744 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:17:26,746 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:17:26,747 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:17:26,747 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-02 00:17:26,770 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:17:26,770 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:17:26,771 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:17:26,772 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:17:26,772 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:17:26,772 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:17:26,772 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:17:26,772 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:17:26,773 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:17:26,773 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:17:26,773 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:17:26,773 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:17:26,773 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:17:26,773 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:17:26,774 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:17:26,774 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:17:26,774 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:17:26,774 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:17:26,774 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:17:26,774 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:17:26,775 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:17:26,775 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:17:26,775 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:17:26,775 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:17:26,775 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:17:26,775 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:17:26,776 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:17:26,776 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:17:26,776 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:17:26,776 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:17:26,776 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:17:26,777 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:17:26,778 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> af68da58954d6230e3860792840330ae6de845ab [2019-01-02 00:17:26,819 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:17:26,836 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:17:26,844 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:17:26,846 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:17:26,847 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:17:26,848 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/reducercommutativity/rangesum10_false-unreach-call_true-termination.i [2019-01-02 00:17:26,918 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/264a69b83/f4ada7ab274d4d2a9ecff38fc6c6f97d/FLAGea0c0aa18 [2019-01-02 00:17:27,395 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:17:27,396 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/reducercommutativity/rangesum10_false-unreach-call_true-termination.i [2019-01-02 00:17:27,404 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/264a69b83/f4ada7ab274d4d2a9ecff38fc6c6f97d/FLAGea0c0aa18 [2019-01-02 00:17:27,690 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/264a69b83/f4ada7ab274d4d2a9ecff38fc6c6f97d [2019-01-02 00:17:27,694 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:17:27,696 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:17:27,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:17:27,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:17:27,703 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:17:27,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:17:27" (1/1) ... [2019-01-02 00:17:27,707 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46451202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:17:27, skipping insertion in model container [2019-01-02 00:17:27,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:17:27" (1/1) ... [2019-01-02 00:17:27,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:17:27,735 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:17:27,918 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:17:27,929 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:17:27,959 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:17:27,976 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:17:27,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:17:27 WrapperNode [2019-01-02 00:17:27,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:17:27,977 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:17:27,978 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:17:27,978 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:17:27,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:17:27" (1/1) ... [2019-01-02 00:17:27,995 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:17:27" (1/1) ... [2019-01-02 00:17:28,026 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:17:28,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:17:28,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:17:28,026 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:17:28,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:17:27" (1/1) ... [2019-01-02 00:17:28,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:17:27" (1/1) ... [2019-01-02 00:17:28,042 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:17:27" (1/1) ... [2019-01-02 00:17:28,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:17:27" (1/1) ... [2019-01-02 00:17:28,050 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:17:27" (1/1) ... [2019-01-02 00:17:28,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:17:27" (1/1) ... [2019-01-02 00:17:28,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:17:27" (1/1) ... [2019-01-02 00:17:28,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:17:28,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:17:28,137 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:17:28,137 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:17:28,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:17:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:17:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-02 00:17:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:17:28,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:17:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-02 00:17:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-02 00:17:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-02 00:17:28,768 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:17:28,769 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2019-01-02 00:17:28,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:17:28 BoogieIcfgContainer [2019-01-02 00:17:28,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:17:28,770 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:17:28,770 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:17:28,774 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:17:28,775 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:17:28,775 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:17:27" (1/3) ... [2019-01-02 00:17:28,776 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73d5dced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:17:28, skipping insertion in model container [2019-01-02 00:17:28,776 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:17:28,776 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:17:27" (2/3) ... [2019-01-02 00:17:28,776 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73d5dced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:17:28, skipping insertion in model container [2019-01-02 00:17:28,777 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:17:28,777 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:17:28" (3/3) ... [2019-01-02 00:17:28,779 INFO L375 chiAutomizerObserver]: Analyzing ICFG rangesum10_false-unreach-call_true-termination.i [2019-01-02 00:17:28,839 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:17:28,840 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:17:28,840 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:17:28,840 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:17:28,840 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:17:28,840 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:17:28,841 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:17:28,841 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:17:28,841 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:17:28,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2019-01-02 00:17:28,878 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-01-02 00:17:28,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:28,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:28,885 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-02 00:17:28,885 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:17:28,885 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:17:28,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2019-01-02 00:17:28,888 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-01-02 00:17:28,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:28,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:28,889 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-02 00:17:28,889 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:17:28,896 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 26#L6-3true [2019-01-02 00:17:28,897 INFO L796 eck$LassoCheckResult]: Loop: 26#L6-3true assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 30#L6-2true init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 26#L6-3true [2019-01-02 00:17:28,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:28,903 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-02 00:17:28,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:28,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:28,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:28,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:28,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:29,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:29,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-01-02 00:17:29,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:29,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:29,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:29,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:29,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:29,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:29,054 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-01-02 00:17:29,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:29,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:29,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:29,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:29,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:29,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:29,400 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-02 00:17:29,779 WARN L181 SmtUtils]: Spent 371.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-02 00:17:29,805 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:17:29,806 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:17:29,806 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:17:29,807 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:17:29,807 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:17:29,807 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:17:29,807 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:17:29,807 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:17:29,807 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum10_false-unreach-call_true-termination.i_Iteration1_Lasso [2019-01-02 00:17:29,808 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:17:29,808 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:17:29,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:29,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:29,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:29,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:29,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:29,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:30,117 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-01-02 00:17:30,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:30,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:30,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:30,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:30,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:30,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:30,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:30,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:30,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:30,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:30,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:30,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:30,621 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-02 00:17:31,005 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:17:31,011 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:17:31,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:17:31,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:31,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:17:31,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:31,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:31,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:31,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:17:31,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:17:31,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:31,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:17:31,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:31,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:17:31,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:31,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:31,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:31,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:17:31,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:17:31,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:31,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:17:31,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:31,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:17:31,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:31,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:31,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:31,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:17:31,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:17:31,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:31,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:17:31,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:31,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:31,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:31,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:31,045 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:17:31,045 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:17:31,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:31,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:17:31,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:31,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:17:31,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:31,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:31,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:31,061 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:17:31,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:17:31,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:31,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:17:31,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:31,067 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-02 00:17:31,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:31,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:31,076 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-02 00:17:31,079 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:17:31,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:31,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:17:31,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:31,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:31,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:31,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:31,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:17:31,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:17:31,185 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:17:31,268 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-02 00:17:31,268 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-02 00:17:31,271 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:17:31,275 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:17:31,275 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:17:31,276 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_init_nondet_~x.base)_1, ULTIMATE.start_init_nondet_~i~0) = 19*v_rep(select #length ULTIMATE.start_init_nondet_~x.base)_1 - 8*ULTIMATE.start_init_nondet_~i~0 Supporting invariants [] [2019-01-02 00:17:31,309 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-02 00:17:31,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:17:31,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:31,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:31,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:31,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:17:31,442 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-02 00:17:31,443 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states. Second operand 3 states. [2019-01-02 00:17:31,564 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states.. Second operand 3 states. Result 78 states and 122 transitions. Complement of second has 7 states. [2019-01-02 00:17:31,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-02 00:17:31,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:17:31,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2019-01-02 00:17:31,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 82 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-02 00:17:31,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:17:31,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 82 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-02 00:17:31,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:17:31,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 82 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-02 00:17:31,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:17:31,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 122 transitions. [2019-01-02 00:17:31,579 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:31,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 22 states and 32 transitions. [2019-01-02 00:17:31,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-02 00:17:31,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-02 00:17:31,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 32 transitions. [2019-01-02 00:17:31,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:17:31,587 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-01-02 00:17:31,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 32 transitions. [2019-01-02 00:17:31,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-02 00:17:31,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-02 00:17:31,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2019-01-02 00:17:31,617 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-01-02 00:17:31,617 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-01-02 00:17:31,617 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:17:31,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 32 transitions. [2019-01-02 00:17:31,618 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:31,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:31,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:31,619 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-02 00:17:31,619 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:31,619 INFO L794 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 171#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 172#L6-3 assume !(init_nondet_~i~0 < 10); 175#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 158#L17-3 [2019-01-02 00:17:31,619 INFO L796 eck$LassoCheckResult]: Loop: 158#L17-3 assume !!(rangesum_~i~1 < 10); 166#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 157#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 158#L17-3 [2019-01-02 00:17:31,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:31,620 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-01-02 00:17:31,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:31,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:31,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:31,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:31,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:31,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:17:31,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:17:31,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:17:31,674 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:17:31,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:31,675 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 1 times [2019-01-02 00:17:31,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:31,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:31,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:31,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:31,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:31,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:17:31,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:17:31,812 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. cyclomatic complexity: 15 Second operand 3 states. [2019-01-02 00:17:31,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:31,827 INFO L93 Difference]: Finished difference Result 23 states and 32 transitions. [2019-01-02 00:17:31,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:17:31,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. [2019-01-02 00:17:31,830 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:31,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 32 transitions. [2019-01-02 00:17:31,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-02 00:17:31,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-02 00:17:31,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2019-01-02 00:17:31,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:17:31,832 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-01-02 00:17:31,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2019-01-02 00:17:31,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-01-02 00:17:31,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-02 00:17:31,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2019-01-02 00:17:31,835 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-01-02 00:17:31,835 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-01-02 00:17:31,835 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:17:31,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2019-01-02 00:17:31,836 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:31,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:31,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:31,837 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-02 00:17:31,837 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:31,837 INFO L794 eck$LassoCheckResult]: Stem: 224#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 222#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 223#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 226#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 227#L6-3 assume !(init_nondet_~i~0 < 10); 228#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 209#L17-3 [2019-01-02 00:17:31,837 INFO L796 eck$LassoCheckResult]: Loop: 209#L17-3 assume !!(rangesum_~i~1 < 10); 217#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 208#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 209#L17-3 [2019-01-02 00:17:31,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:31,838 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2019-01-02 00:17:31,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:31,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:31,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:31,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:31,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:17:31,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:17:31,894 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:17:31,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:31,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:31,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:17:31,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:17:31,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-02 00:17:31,973 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:17:31,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:31,974 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 2 times [2019-01-02 00:17:31,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:31,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:31,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:31,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:31,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:32,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-02 00:17:32,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-02 00:17:32,083 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-01-02 00:17:32,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:32,132 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2019-01-02 00:17:32,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:17:32,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2019-01-02 00:17:32,134 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:32,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 34 transitions. [2019-01-02 00:17:32,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-02 00:17:32,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-02 00:17:32,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2019-01-02 00:17:32,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:17:32,135 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-01-02 00:17:32,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2019-01-02 00:17:32,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-01-02 00:17:32,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-02 00:17:32,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-01-02 00:17:32,138 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-02 00:17:32,139 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-02 00:17:32,139 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-02 00:17:32,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-01-02 00:17:32,140 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:32,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:32,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:32,140 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-01-02 00:17:32,141 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:32,141 INFO L794 eck$LassoCheckResult]: Stem: 294#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 292#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 293#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 296#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 297#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 298#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 301#L6-3 assume !(init_nondet_~i~0 < 10); 300#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 279#L17-3 [2019-01-02 00:17:32,141 INFO L796 eck$LassoCheckResult]: Loop: 279#L17-3 assume !!(rangesum_~i~1 < 10); 287#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 278#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 279#L17-3 [2019-01-02 00:17:32,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:32,141 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2019-01-02 00:17:32,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:32,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:32,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:32,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:32,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:32,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:17:32,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:17:32,217 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:17:32,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-02 00:17:32,257 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-02 00:17:32,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:17:32,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:32,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:17:32,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:17:32,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-02 00:17:32,381 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:17:32,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:32,381 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 3 times [2019-01-02 00:17:32,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:32,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:32,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:32,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:32,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:32,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-02 00:17:32,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-02 00:17:32,545 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 14 Second operand 6 states. [2019-01-02 00:17:32,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:32,573 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2019-01-02 00:17:32,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:17:32,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2019-01-02 00:17:32,575 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:32,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 36 transitions. [2019-01-02 00:17:32,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-02 00:17:32,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-02 00:17:32,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2019-01-02 00:17:32,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:17:32,577 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-01-02 00:17:32,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2019-01-02 00:17:32,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-01-02 00:17:32,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-02 00:17:32,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-01-02 00:17:32,580 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-01-02 00:17:32,580 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-01-02 00:17:32,580 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-02 00:17:32,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2019-01-02 00:17:32,581 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:32,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:32,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:32,582 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2019-01-02 00:17:32,582 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:32,582 INFO L794 eck$LassoCheckResult]: Stem: 375#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 373#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 374#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 377#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 381#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 384#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 378#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 379#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 383#L6-3 assume !(init_nondet_~i~0 < 10); 382#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 360#L17-3 [2019-01-02 00:17:32,582 INFO L796 eck$LassoCheckResult]: Loop: 360#L17-3 assume !!(rangesum_~i~1 < 10); 368#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 359#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 360#L17-3 [2019-01-02 00:17:32,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:32,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2019-01-02 00:17:32,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:32,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:32,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:32,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:32,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:32,694 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:17:32,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:17:32,695 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:17:32,705 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-02 00:17:32,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-02 00:17:32,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:17:32,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:32,760 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:17:32,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:17:32,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-02 00:17:32,781 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:17:32,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:32,782 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 4 times [2019-01-02 00:17:32,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:32,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:32,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:32,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:32,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:32,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-02 00:17:32,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-02 00:17:32,907 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. cyclomatic complexity: 14 Second operand 7 states. [2019-01-02 00:17:32,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:32,938 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-01-02 00:17:32,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-02 00:17:32,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2019-01-02 00:17:32,940 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:32,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 38 transitions. [2019-01-02 00:17:32,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-02 00:17:32,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-02 00:17:32,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2019-01-02 00:17:32,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:17:32,942 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-01-02 00:17:32,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2019-01-02 00:17:32,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-01-02 00:17:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-02 00:17:32,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2019-01-02 00:17:32,945 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-01-02 00:17:32,945 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-01-02 00:17:32,946 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-02 00:17:32,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2019-01-02 00:17:32,946 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:32,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:32,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:32,947 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2019-01-02 00:17:32,947 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:32,948 INFO L794 eck$LassoCheckResult]: Stem: 467#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 465#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 466#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 469#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 470#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 471#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 473#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 478#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 477#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 476#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 475#L6-3 assume !(init_nondet_~i~0 < 10); 474#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 452#L17-3 [2019-01-02 00:17:32,948 INFO L796 eck$LassoCheckResult]: Loop: 452#L17-3 assume !!(rangesum_~i~1 < 10); 460#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 451#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 452#L17-3 [2019-01-02 00:17:32,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:32,948 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2019-01-02 00:17:32,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:32,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:32,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:32,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:32,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:33,058 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:17:33,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:17:33,059 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:17:33,071 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-02 00:17:33,104 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-02 00:17:33,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:17:33,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:33,133 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:17:33,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:17:33,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-02 00:17:33,154 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:17:33,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:33,154 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 5 times [2019-01-02 00:17:33,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:33,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:33,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:33,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:33,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:33,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-02 00:17:33,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-02 00:17:33,312 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 14 Second operand 8 states. [2019-01-02 00:17:33,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:33,358 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-01-02 00:17:33,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-02 00:17:33,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2019-01-02 00:17:33,362 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:33,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 40 transitions. [2019-01-02 00:17:33,363 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-02 00:17:33,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-02 00:17:33,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2019-01-02 00:17:33,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:17:33,363 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-01-02 00:17:33,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2019-01-02 00:17:33,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-01-02 00:17:33,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-02 00:17:33,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2019-01-02 00:17:33,369 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-01-02 00:17:33,369 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-01-02 00:17:33,369 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-02 00:17:33,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2019-01-02 00:17:33,370 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:33,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:33,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:33,372 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2019-01-02 00:17:33,372 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:33,372 INFO L794 eck$LassoCheckResult]: Stem: 570#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 568#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 569#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 572#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 573#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 574#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 576#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 583#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 582#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 581#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 580#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 579#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 578#L6-3 assume !(init_nondet_~i~0 < 10); 577#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 555#L17-3 [2019-01-02 00:17:33,372 INFO L796 eck$LassoCheckResult]: Loop: 555#L17-3 assume !!(rangesum_~i~1 < 10); 563#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 554#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 555#L17-3 [2019-01-02 00:17:33,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:33,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2019-01-02 00:17:33,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:33,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:33,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:33,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:33,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:33,592 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:17:33,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:17:33,592 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:17:33,604 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-02 00:17:33,656 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-02 00:17:33,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:17:33,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:33,681 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:17:33,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:17:33,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-01-02 00:17:33,708 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:17:33,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:33,708 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 6 times [2019-01-02 00:17:33,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:33,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:33,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:33,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:33,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:33,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-02 00:17:33,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-02 00:17:33,800 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. cyclomatic complexity: 14 Second operand 9 states. [2019-01-02 00:17:33,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:33,834 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2019-01-02 00:17:33,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-02 00:17:33,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 42 transitions. [2019-01-02 00:17:33,836 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:33,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 42 transitions. [2019-01-02 00:17:33,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-02 00:17:33,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-02 00:17:33,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2019-01-02 00:17:33,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:17:33,837 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-01-02 00:17:33,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2019-01-02 00:17:33,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-01-02 00:17:33,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-02 00:17:33,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2019-01-02 00:17:33,840 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2019-01-02 00:17:33,841 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2019-01-02 00:17:33,841 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-02 00:17:33,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2019-01-02 00:17:33,841 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:33,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:33,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:33,842 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2019-01-02 00:17:33,842 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:33,843 INFO L794 eck$LassoCheckResult]: Stem: 684#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 682#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 683#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 686#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 687#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 688#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 690#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 699#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 698#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 697#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 696#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 695#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 694#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 693#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 692#L6-3 assume !(init_nondet_~i~0 < 10); 691#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 669#L17-3 [2019-01-02 00:17:33,843 INFO L796 eck$LassoCheckResult]: Loop: 669#L17-3 assume !!(rangesum_~i~1 < 10); 677#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 668#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 669#L17-3 [2019-01-02 00:17:33,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:33,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2019-01-02 00:17:33,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:33,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:33,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:33,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:33,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:33,935 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:17:33,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:17:33,936 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:17:33,968 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-02 00:17:34,049 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-02 00:17:34,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:17:34,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:34,066 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:17:34,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:17:34,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-02 00:17:34,090 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:17:34,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:34,090 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 7 times [2019-01-02 00:17:34,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:34,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:34,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:34,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:34,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:34,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-02 00:17:34,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-02 00:17:34,144 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. cyclomatic complexity: 14 Second operand 10 states. [2019-01-02 00:17:34,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:34,202 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2019-01-02 00:17:34,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-02 00:17:34,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2019-01-02 00:17:34,206 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:34,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 44 transitions. [2019-01-02 00:17:34,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-02 00:17:34,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-02 00:17:34,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2019-01-02 00:17:34,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:17:34,207 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2019-01-02 00:17:34,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2019-01-02 00:17:34,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-01-02 00:17:34,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-02 00:17:34,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2019-01-02 00:17:34,215 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2019-01-02 00:17:34,215 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2019-01-02 00:17:34,215 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-02 00:17:34,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2019-01-02 00:17:34,215 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:34,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:34,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:34,217 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2019-01-02 00:17:34,217 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:34,219 INFO L794 eck$LassoCheckResult]: Stem: 809#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 807#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 808#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 811#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 812#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 813#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 815#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 826#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 825#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 824#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 823#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 822#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 821#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 820#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 819#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 818#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 817#L6-3 assume !(init_nondet_~i~0 < 10); 816#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 794#L17-3 [2019-01-02 00:17:34,219 INFO L796 eck$LassoCheckResult]: Loop: 794#L17-3 assume !!(rangesum_~i~1 < 10); 802#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 793#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 794#L17-3 [2019-01-02 00:17:34,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:34,219 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2019-01-02 00:17:34,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:34,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:34,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:34,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:34,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:34,388 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:17:34,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:17:34,389 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:17:34,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:34,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:34,442 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:17:34,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:17:34,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-01-02 00:17:34,464 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:17:34,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:34,464 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 8 times [2019-01-02 00:17:34,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:34,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:34,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:34,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:34,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:34,622 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-02 00:17:34,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-02 00:17:34,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-02 00:17:34,641 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. cyclomatic complexity: 14 Second operand 11 states. [2019-01-02 00:17:34,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:34,683 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2019-01-02 00:17:34,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-02 00:17:34,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2019-01-02 00:17:34,685 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:34,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 46 transitions. [2019-01-02 00:17:34,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-02 00:17:34,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-02 00:17:34,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2019-01-02 00:17:34,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:17:34,686 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 46 transitions. [2019-01-02 00:17:34,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2019-01-02 00:17:34,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-01-02 00:17:34,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-02 00:17:34,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2019-01-02 00:17:34,689 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-01-02 00:17:34,689 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-01-02 00:17:34,689 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-02 00:17:34,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2019-01-02 00:17:34,690 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:34,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:34,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:34,691 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2019-01-02 00:17:34,691 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:34,691 INFO L794 eck$LassoCheckResult]: Stem: 945#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 943#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 944#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 947#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 948#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 949#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 951#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 964#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 963#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 962#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 961#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 960#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 959#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 958#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 957#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 956#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 955#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 954#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 953#L6-3 assume !(init_nondet_~i~0 < 10); 952#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 930#L17-3 [2019-01-02 00:17:34,691 INFO L796 eck$LassoCheckResult]: Loop: 930#L17-3 assume !!(rangesum_~i~1 < 10); 938#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 929#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 930#L17-3 [2019-01-02 00:17:34,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:34,691 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2019-01-02 00:17:34,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:34,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:34,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:34,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:34,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:34,824 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:17:34,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:17:34,824 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:17:34,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-02 00:17:34,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-02 00:17:34,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:17:34,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:34,874 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:17:34,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:17:34,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-02 00:17:34,895 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:17:34,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:34,895 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 9 times [2019-01-02 00:17:34,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:34,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:34,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:34,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:34,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:35,073 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-02 00:17:35,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-02 00:17:35,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-02 00:17:35,092 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. cyclomatic complexity: 14 Second operand 12 states. [2019-01-02 00:17:35,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:35,204 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2019-01-02 00:17:35,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-02 00:17:35,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2019-01-02 00:17:35,205 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:35,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 48 transitions. [2019-01-02 00:17:35,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-02 00:17:35,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-02 00:17:35,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 48 transitions. [2019-01-02 00:17:35,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:17:35,206 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2019-01-02 00:17:35,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 48 transitions. [2019-01-02 00:17:35,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-01-02 00:17:35,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-02 00:17:35,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2019-01-02 00:17:35,215 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2019-01-02 00:17:35,215 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2019-01-02 00:17:35,215 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-02 00:17:35,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. [2019-01-02 00:17:35,219 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:35,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:35,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:35,220 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2019-01-02 00:17:35,220 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:35,220 INFO L794 eck$LassoCheckResult]: Stem: 1092#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1090#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1091#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1094#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1095#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1096#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1098#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1113#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1112#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1111#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1110#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1109#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1108#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1107#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1106#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1105#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1104#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1103#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1102#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1101#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1100#L6-3 assume !(init_nondet_~i~0 < 10); 1099#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1077#L17-3 [2019-01-02 00:17:35,220 INFO L796 eck$LassoCheckResult]: Loop: 1077#L17-3 assume !!(rangesum_~i~1 < 10); 1085#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1076#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1077#L17-3 [2019-01-02 00:17:35,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:35,229 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2019-01-02 00:17:35,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:35,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:35,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:35,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:35,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:35,376 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:17:35,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:17:35,377 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:17:35,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-02 00:17:35,485 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-02 00:17:35,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:17:35,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:35,574 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:17:35,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:17:35,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-01-02 00:17:35,594 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:17:35,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:35,594 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 10 times [2019-01-02 00:17:35,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:35,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:35,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:35,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:35,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:35,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-02 00:17:35,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-02 00:17:35,681 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. cyclomatic complexity: 14 Second operand 13 states. [2019-01-02 00:17:35,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:35,734 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2019-01-02 00:17:35,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-02 00:17:35,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2019-01-02 00:17:35,738 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:35,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 49 transitions. [2019-01-02 00:17:35,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-02 00:17:35,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-02 00:17:35,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2019-01-02 00:17:35,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:17:35,740 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2019-01-02 00:17:35,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2019-01-02 00:17:35,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-02 00:17:35,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-02 00:17:35,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2019-01-02 00:17:35,744 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2019-01-02 00:17:35,744 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2019-01-02 00:17:35,744 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-02 00:17:35,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2019-01-02 00:17:35,747 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:35,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:35,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:35,748 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2019-01-02 00:17:35,748 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:35,749 INFO L794 eck$LassoCheckResult]: Stem: 1249#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1247#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1248#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1251#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1252#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1253#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1256#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1272#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1271#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1270#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1269#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1268#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1267#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1266#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1265#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1264#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1263#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1262#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1261#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1260#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1259#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1258#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1257#L6-3 assume !(init_nondet_~i~0 < 10); 1255#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1234#L17-3 [2019-01-02 00:17:35,749 INFO L796 eck$LassoCheckResult]: Loop: 1234#L17-3 assume !!(rangesum_~i~1 < 10); 1242#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1233#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1234#L17-3 [2019-01-02 00:17:35,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:35,749 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2019-01-02 00:17:35,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:35,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:35,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:35,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:35,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:35,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:35,807 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 11 times [2019-01-02 00:17:35,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:35,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:35,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:35,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:35,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:35,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:35,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1328180093, now seen corresponding path program 1 times [2019-01-02 00:17:35,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:35,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:35,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:35,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:35,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:35,902 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-02 00:17:35,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:17:35,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:17:35,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:17:35,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:17:35,942 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-01-02 00:17:36,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:36,000 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2019-01-02 00:17:36,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:17:36,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 58 transitions. [2019-01-02 00:17:36,003 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:36,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 58 transitions. [2019-01-02 00:17:36,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-01-02 00:17:36,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-01-02 00:17:36,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 58 transitions. [2019-01-02 00:17:36,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:17:36,007 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 58 transitions. [2019-01-02 00:17:36,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 58 transitions. [2019-01-02 00:17:36,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2019-01-02 00:17:36,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-02 00:17:36,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2019-01-02 00:17:36,012 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 55 transitions. [2019-01-02 00:17:36,012 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 55 transitions. [2019-01-02 00:17:36,012 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-02 00:17:36,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 55 transitions. [2019-01-02 00:17:36,014 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:36,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:36,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:36,015 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1] [2019-01-02 00:17:36,015 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:36,018 INFO L794 eck$LassoCheckResult]: Stem: 1348#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1345#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1346#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1350#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1351#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1352#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1375#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1374#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1373#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1372#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1371#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1370#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1369#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1368#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1367#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1366#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1365#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1364#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1362#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1361#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1360#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1358#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1357#L6-3 assume !(init_nondet_~i~0 < 10); 1355#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1353#L17-3 assume !!(rangesum_~i~1 < 10); 1340#L18 assume !(rangesum_~i~1 > 5); 1330#L17-2 [2019-01-02 00:17:36,018 INFO L796 eck$LassoCheckResult]: Loop: 1330#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1331#L17-3 assume !!(rangesum_~i~1 < 10); 1363#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1330#L17-2 [2019-01-02 00:17:36,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:36,018 INFO L82 PathProgramCache]: Analyzing trace with hash -95702812, now seen corresponding path program 1 times [2019-01-02 00:17:36,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:36,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:36,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:36,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:36,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:36,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:36,050 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 12 times [2019-01-02 00:17:36,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:36,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:36,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:36,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:36,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:36,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:36,061 INFO L82 PathProgramCache]: Analyzing trace with hash 775842814, now seen corresponding path program 1 times [2019-01-02 00:17:36,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:36,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:36,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:36,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:36,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-02 00:17:36,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:17:36,108 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:17:36,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:36,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:36,207 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-02 00:17:36,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:17:36,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2019-01-02 00:17:36,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-02 00:17:36,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-02 00:17:36,279 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-01-02 00:17:36,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:36,359 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2019-01-02 00:17:36,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:17:36,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 67 transitions. [2019-01-02 00:17:36,361 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:36,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 67 transitions. [2019-01-02 00:17:36,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-01-02 00:17:36,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-01-02 00:17:36,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 67 transitions. [2019-01-02 00:17:36,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:17:36,363 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2019-01-02 00:17:36,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 67 transitions. [2019-01-02 00:17:36,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2019-01-02 00:17:36,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-02 00:17:36,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2019-01-02 00:17:36,369 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 64 transitions. [2019-01-02 00:17:36,369 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 64 transitions. [2019-01-02 00:17:36,369 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-02 00:17:36,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 64 transitions. [2019-01-02 00:17:36,370 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:36,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:36,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:36,372 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 2, 2, 1, 1, 1, 1, 1] [2019-01-02 00:17:36,373 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:36,373 INFO L794 eck$LassoCheckResult]: Stem: 1548#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1545#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1546#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1550#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1551#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1552#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1555#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1579#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1578#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1577#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1576#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1575#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1574#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1573#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1572#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1570#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1569#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1565#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1564#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1563#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1562#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1559#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1558#L6-3 assume !(init_nondet_~i~0 < 10); 1556#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1557#L17-3 assume !!(rangesum_~i~1 < 10); 1571#L18 assume !(rangesum_~i~1 > 5); 1528#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1529#L17-3 assume !!(rangesum_~i~1 < 10); 1538#L18 assume !(rangesum_~i~1 > 5); 1539#L17-2 [2019-01-02 00:17:36,373 INFO L796 eck$LassoCheckResult]: Loop: 1539#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1567#L17-3 assume !!(rangesum_~i~1 < 10); 1568#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1539#L17-2 [2019-01-02 00:17:36,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:36,373 INFO L82 PathProgramCache]: Analyzing trace with hash 775842816, now seen corresponding path program 1 times [2019-01-02 00:17:36,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:36,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:36,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:36,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:36,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:36,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:36,400 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 13 times [2019-01-02 00:17:36,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:36,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:36,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:36,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:36,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:36,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:36,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1914342242, now seen corresponding path program 2 times [2019-01-02 00:17:36,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:36,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:36,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:36,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:36,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:36,657 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-02 00:17:36,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:17:36,657 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:17:36,677 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-02 00:17:36,726 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-02 00:17:36,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:17:36,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:36,833 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-02 00:17:36,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:17:36,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-02 00:17:37,091 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-02 00:17:37,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-02 00:17:37,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-02 00:17:37,120 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. cyclomatic complexity: 14 Second operand 6 states. [2019-01-02 00:17:37,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:37,204 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2019-01-02 00:17:37,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:17:37,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 76 transitions. [2019-01-02 00:17:37,208 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:37,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 76 transitions. [2019-01-02 00:17:37,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2019-01-02 00:17:37,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2019-01-02 00:17:37,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 76 transitions. [2019-01-02 00:17:37,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:17:37,210 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 76 transitions. [2019-01-02 00:17:37,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 76 transitions. [2019-01-02 00:17:37,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2019-01-02 00:17:37,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-02 00:17:37,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2019-01-02 00:17:37,217 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 73 transitions. [2019-01-02 00:17:37,217 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 73 transitions. [2019-01-02 00:17:37,217 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-02 00:17:37,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 73 transitions. [2019-01-02 00:17:37,220 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:37,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:37,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:37,223 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 3, 3, 2, 1, 1, 1, 1] [2019-01-02 00:17:37,223 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:37,223 INFO L794 eck$LassoCheckResult]: Stem: 1773#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1770#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1771#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1775#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1776#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1777#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1804#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1803#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1802#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1801#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1800#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1799#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1798#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1797#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1796#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1795#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1794#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1792#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1789#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1788#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1787#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1784#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1783#L6-3 assume !(init_nondet_~i~0 < 10); 1781#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1778#L17-3 assume !!(rangesum_~i~1 < 10); 1764#L18 assume !(rangesum_~i~1 > 5); 1754#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1755#L17-3 assume !!(rangesum_~i~1 < 10); 1808#L18 assume !(rangesum_~i~1 > 5); 1807#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1806#L17-3 assume !!(rangesum_~i~1 < 10); 1805#L18 assume !(rangesum_~i~1 > 5); 1793#L17-2 [2019-01-02 00:17:37,223 INFO L796 eck$LassoCheckResult]: Loop: 1793#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1790#L17-3 assume !!(rangesum_~i~1 < 10); 1791#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1793#L17-2 [2019-01-02 00:17:37,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:37,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1914342244, now seen corresponding path program 2 times [2019-01-02 00:17:37,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:37,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:37,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:37,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:37,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:37,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:37,258 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 14 times [2019-01-02 00:17:37,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:37,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:37,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:37,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:37,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:37,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:37,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:37,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1594065278, now seen corresponding path program 3 times [2019-01-02 00:17:37,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:37,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:37,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:37,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:37,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:37,394 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-02 00:17:37,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:17:37,394 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:17:37,404 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-02 00:17:37,423 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-02 00:17:37,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:17:37,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:37,451 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-02 00:17:37,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:17:37,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-02 00:17:37,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-02 00:17:37,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-02 00:17:37,563 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. cyclomatic complexity: 14 Second operand 7 states. [2019-01-02 00:17:37,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:37,677 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2019-01-02 00:17:37,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-02 00:17:37,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 85 transitions. [2019-01-02 00:17:37,679 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:37,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 85 transitions. [2019-01-02 00:17:37,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2019-01-02 00:17:37,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2019-01-02 00:17:37,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 85 transitions. [2019-01-02 00:17:37,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:17:37,682 INFO L705 BuchiCegarLoop]: Abstraction has 76 states and 85 transitions. [2019-01-02 00:17:37,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 85 transitions. [2019-01-02 00:17:37,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2019-01-02 00:17:37,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-02 00:17:37,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2019-01-02 00:17:37,688 INFO L728 BuchiCegarLoop]: Abstraction has 73 states and 82 transitions. [2019-01-02 00:17:37,688 INFO L608 BuchiCegarLoop]: Abstraction has 73 states and 82 transitions. [2019-01-02 00:17:37,688 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2019-01-02 00:17:37,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 82 transitions. [2019-01-02 00:17:37,689 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:37,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:37,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:37,693 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 3, 1, 1, 1, 1] [2019-01-02 00:17:37,693 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:37,693 INFO L794 eck$LassoCheckResult]: Stem: 2028#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2025#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 2026#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2030#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2031#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2032#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2058#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2057#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2056#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2055#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2054#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2053#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2052#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2051#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2050#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2049#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2048#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2046#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2043#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2042#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2040#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2037#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2036#L6-3 assume !(init_nondet_~i~0 < 10); 2034#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2035#L17-3 assume !!(rangesum_~i~1 < 10); 2070#L18 assume !(rangesum_~i~1 > 5); 2008#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2009#L17-3 assume !!(rangesum_~i~1 < 10); 2018#L18 assume !(rangesum_~i~1 > 5); 2019#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2068#L17-3 assume !!(rangesum_~i~1 < 10); 2066#L18 assume !(rangesum_~i~1 > 5); 2064#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2063#L17-3 assume !!(rangesum_~i~1 < 10); 2061#L18 assume !(rangesum_~i~1 > 5); 2047#L17-2 [2019-01-02 00:17:37,693 INFO L796 eck$LassoCheckResult]: Loop: 2047#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2044#L17-3 assume !!(rangesum_~i~1 < 10); 2045#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2047#L17-2 [2019-01-02 00:17:37,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:37,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1594065280, now seen corresponding path program 3 times [2019-01-02 00:17:37,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:37,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:37,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:37,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:37,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:37,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:37,731 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 15 times [2019-01-02 00:17:37,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:37,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:37,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:37,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:37,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:37,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:37,741 INFO L82 PathProgramCache]: Analyzing trace with hash -654604830, now seen corresponding path program 4 times [2019-01-02 00:17:37,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:37,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:37,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:37,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:37,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:38,009 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-02 00:17:38,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:17:38,009 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:17:38,020 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-02 00:17:38,046 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-02 00:17:38,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:17:38,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:38,064 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-02 00:17:38,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:17:38,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-02 00:17:38,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-02 00:17:38,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-02 00:17:38,132 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. cyclomatic complexity: 14 Second operand 8 states. [2019-01-02 00:17:38,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:38,253 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2019-01-02 00:17:38,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-02 00:17:38,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 94 transitions. [2019-01-02 00:17:38,256 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:38,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 85 states and 94 transitions. [2019-01-02 00:17:38,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2019-01-02 00:17:38,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2019-01-02 00:17:38,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 94 transitions. [2019-01-02 00:17:38,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:17:38,258 INFO L705 BuchiCegarLoop]: Abstraction has 85 states and 94 transitions. [2019-01-02 00:17:38,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 94 transitions. [2019-01-02 00:17:38,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2019-01-02 00:17:38,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-02 00:17:38,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2019-01-02 00:17:38,262 INFO L728 BuchiCegarLoop]: Abstraction has 82 states and 91 transitions. [2019-01-02 00:17:38,262 INFO L608 BuchiCegarLoop]: Abstraction has 82 states and 91 transitions. [2019-01-02 00:17:38,262 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2019-01-02 00:17:38,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 91 transitions. [2019-01-02 00:17:38,263 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:38,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:38,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:38,264 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 5, 5, 4, 1, 1, 1, 1] [2019-01-02 00:17:38,264 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:38,265 INFO L794 eck$LassoCheckResult]: Stem: 2310#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2307#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 2308#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2312#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2313#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2314#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2340#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2339#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2338#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2337#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2336#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2335#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2334#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2333#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2332#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2331#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2330#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2328#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2325#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2324#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2322#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2319#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2318#L6-3 assume !(init_nondet_~i~0 < 10); 2316#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2317#L17-3 assume !!(rangesum_~i~1 < 10); 2358#L18 assume !(rangesum_~i~1 > 5); 2290#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2291#L17-3 assume !!(rangesum_~i~1 < 10); 2300#L18 assume !(rangesum_~i~1 > 5); 2301#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2356#L17-3 assume !!(rangesum_~i~1 < 10); 2354#L18 assume !(rangesum_~i~1 > 5); 2352#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2350#L17-3 assume !!(rangesum_~i~1 < 10); 2348#L18 assume !(rangesum_~i~1 > 5); 2346#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2345#L17-3 assume !!(rangesum_~i~1 < 10); 2343#L18 assume !(rangesum_~i~1 > 5); 2329#L17-2 [2019-01-02 00:17:38,265 INFO L796 eck$LassoCheckResult]: Loop: 2329#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2326#L17-3 assume !!(rangesum_~i~1 < 10); 2327#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2329#L17-2 [2019-01-02 00:17:38,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:38,265 INFO L82 PathProgramCache]: Analyzing trace with hash -654604828, now seen corresponding path program 4 times [2019-01-02 00:17:38,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:38,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:38,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:38,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:38,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:38,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:38,291 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 16 times [2019-01-02 00:17:38,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:38,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:38,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:38,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:38,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:38,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:38,297 INFO L82 PathProgramCache]: Analyzing trace with hash 2114090750, now seen corresponding path program 5 times [2019-01-02 00:17:38,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:38,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:38,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:38,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:38,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:38,441 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-02 00:17:38,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:17:38,441 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:17:38,453 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-02 00:17:38,503 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-01-02 00:17:38,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:17:38,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:38,538 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-02 00:17:38,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:17:38,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-02 00:17:38,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-02 00:17:38,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-02 00:17:38,610 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. cyclomatic complexity: 14 Second operand 9 states. [2019-01-02 00:17:38,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:38,731 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2019-01-02 00:17:38,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-02 00:17:38,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 103 transitions. [2019-01-02 00:17:38,734 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-02 00:17:38,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 94 states and 103 transitions. [2019-01-02 00:17:38,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2019-01-02 00:17:38,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2019-01-02 00:17:38,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 103 transitions. [2019-01-02 00:17:38,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:17:38,736 INFO L705 BuchiCegarLoop]: Abstraction has 94 states and 103 transitions. [2019-01-02 00:17:38,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 103 transitions. [2019-01-02 00:17:38,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2019-01-02 00:17:38,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-02 00:17:38,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2019-01-02 00:17:38,739 INFO L728 BuchiCegarLoop]: Abstraction has 91 states and 100 transitions. [2019-01-02 00:17:38,739 INFO L608 BuchiCegarLoop]: Abstraction has 91 states and 100 transitions. [2019-01-02 00:17:38,739 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2019-01-02 00:17:38,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 100 transitions. [2019-01-02 00:17:38,747 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:38,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:38,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:38,750 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 6, 6, 5, 1, 1, 1, 1] [2019-01-02 00:17:38,750 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:38,751 INFO L794 eck$LassoCheckResult]: Stem: 2620#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2617#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 2618#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2622#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2623#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2624#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2650#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2649#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2648#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2647#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2646#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2645#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2644#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2643#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2642#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2641#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2639#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2636#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2635#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2633#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2630#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2629#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2628#L6-3 assume !(init_nondet_~i~0 < 10); 2626#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2627#L17-3 assume !!(rangesum_~i~1 < 10); 2674#L18 assume !(rangesum_~i~1 > 5); 2600#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2601#L17-3 assume !!(rangesum_~i~1 < 10); 2610#L18 assume !(rangesum_~i~1 > 5); 2611#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2672#L17-3 assume !!(rangesum_~i~1 < 10); 2670#L18 assume !(rangesum_~i~1 > 5); 2668#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2666#L17-3 assume !!(rangesum_~i~1 < 10); 2664#L18 assume !(rangesum_~i~1 > 5); 2662#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2660#L17-3 assume !!(rangesum_~i~1 < 10); 2658#L18 assume !(rangesum_~i~1 > 5); 2656#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2655#L17-3 assume !!(rangesum_~i~1 < 10); 2653#L18 assume !(rangesum_~i~1 > 5); 2640#L17-2 [2019-01-02 00:17:38,751 INFO L796 eck$LassoCheckResult]: Loop: 2640#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2637#L17-3 assume !!(rangesum_~i~1 < 10); 2638#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2640#L17-2 [2019-01-02 00:17:38,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:38,751 INFO L82 PathProgramCache]: Analyzing trace with hash 2114090752, now seen corresponding path program 5 times [2019-01-02 00:17:38,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:38,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:38,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:38,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:38,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:38,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:38,791 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 17 times [2019-01-02 00:17:38,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:38,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:38,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:38,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:38,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:38,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:38,805 INFO L82 PathProgramCache]: Analyzing trace with hash -522805150, now seen corresponding path program 6 times [2019-01-02 00:17:38,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:38,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:38,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:38,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:38,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:39,080 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-02 00:17:39,205 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-02 00:17:43,672 WARN L181 SmtUtils]: Spent 4.46 s on a formula simplification. DAG size of input: 244 DAG size of output: 179 [2019-01-02 00:17:43,823 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-01-02 00:17:43,826 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:17:43,826 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:17:43,826 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:17:43,826 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:17:43,826 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:17:43,826 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:17:43,826 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:17:43,827 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:17:43,827 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum10_false-unreach-call_true-termination.i_Iteration18_Lasso [2019-01-02 00:17:43,827 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:17:43,827 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:17:43,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:43,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:43,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:43,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:44,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:44,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:44,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:44,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:44,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:44,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:44,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:44,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:44,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:44,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:44,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:44,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:44,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:44,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:44,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:44,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:44,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:44,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:44,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:44,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:44,398 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:17:44,398 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:17:44,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:17:44,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:44,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:17:44,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:44,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:44,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:44,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:17:44,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:17:44,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:44,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:17:44,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:44,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:17:44,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:44,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:44,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:44,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:17:44,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:17:44,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:44,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:17:44,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:44,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:44,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:44,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:44,411 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:17:44,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:17:44,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:44,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:17:44,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:44,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:44,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:44,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:44,424 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:17:44,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:17:44,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:44,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:17:44,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:44,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:44,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:44,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:44,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:17:44,441 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:17:44,455 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:17:44,461 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:17:44,461 INFO L444 ModelExtractionUtils]: 25 out of 28 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-02 00:17:44,461 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:17:44,462 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:17:44,462 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:17:44,462 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1) = -2*ULTIMATE.start_rangesum_~i~1 + 17 Supporting invariants [] [2019-01-02 00:17:44,530 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-02 00:17:44,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:44,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:44,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:44,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:17:44,757 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-02 00:17:44,757 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 100 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-01-02 00:17:44,812 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 100 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 104 states and 116 transitions. Complement of second has 7 states. [2019-01-02 00:17:44,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-02 00:17:44,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-02 00:17:44,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-02 00:17:44,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 41 letters. Loop has 3 letters. [2019-01-02 00:17:44,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:17:44,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 44 letters. Loop has 3 letters. [2019-01-02 00:17:44,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:17:44,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 41 letters. Loop has 6 letters. [2019-01-02 00:17:44,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:17:44,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 116 transitions. [2019-01-02 00:17:44,822 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-01-02 00:17:44,826 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 93 states and 104 transitions. [2019-01-02 00:17:44,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2019-01-02 00:17:44,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2019-01-02 00:17:44,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 104 transitions. [2019-01-02 00:17:44,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:17:44,827 INFO L705 BuchiCegarLoop]: Abstraction has 93 states and 104 transitions. [2019-01-02 00:17:44,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 104 transitions. [2019-01-02 00:17:44,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-02 00:17:44,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-02 00:17:44,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2019-01-02 00:17:44,831 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 104 transitions. [2019-01-02 00:17:44,831 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 104 transitions. [2019-01-02 00:17:44,831 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2019-01-02 00:17:44,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 104 transitions. [2019-01-02 00:17:44,833 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-01-02 00:17:44,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:44,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:44,834 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:17:44,834 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:44,835 INFO L794 eck$LassoCheckResult]: Stem: 2986#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2983#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 2984#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2988#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2989#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2990#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2993#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3040#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3039#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3038#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3037#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3036#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3035#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3034#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3033#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3032#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3031#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3030#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3029#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3028#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3027#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3026#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3025#L6-3 assume !(init_nondet_~i~0 < 10); 2994#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2992#L17-3 assume !!(rangesum_~i~1 < 10); 2976#L18 assume !(rangesum_~i~1 > 5); 2964#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2965#L17-3 assume !!(rangesum_~i~1 < 10); 2977#L18 assume !(rangesum_~i~1 > 5); 2978#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3022#L17-3 assume !!(rangesum_~i~1 < 10); 3020#L18 assume !(rangesum_~i~1 > 5); 3018#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3016#L17-3 assume !!(rangesum_~i~1 < 10); 3014#L18 assume !(rangesum_~i~1 > 5); 3012#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3010#L17-3 assume !!(rangesum_~i~1 < 10); 3008#L18 assume !(rangesum_~i~1 > 5); 3006#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3004#L17-3 assume !!(rangesum_~i~1 < 10); 3002#L18 assume !(rangesum_~i~1 > 5); 2999#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2997#L17-3 assume !(rangesum_~i~1 < 10); 2987#L17-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 2968#L26 main_#t~ret4 := rangesum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2969#L17-8 assume !!(rangesum_~i~1 < 10); 2972#L18-2 assume !(rangesum_~i~1 > 5); 2973#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2985#L17-8 assume !!(rangesum_~i~1 < 10); 3024#L18-2 assume !(rangesum_~i~1 > 5); 3023#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3021#L17-8 assume !!(rangesum_~i~1 < 10); 3019#L18-2 assume !(rangesum_~i~1 > 5); 3017#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3015#L17-8 assume !!(rangesum_~i~1 < 10); 3013#L18-2 assume !(rangesum_~i~1 > 5); 3011#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3009#L17-8 assume !!(rangesum_~i~1 < 10); 3007#L18-2 assume !(rangesum_~i~1 > 5); 3005#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3003#L17-8 assume !!(rangesum_~i~1 < 10); 3000#L18-2 assume !(rangesum_~i~1 > 5); 2998#L17-7 [2019-01-02 00:17:44,835 INFO L796 eck$LassoCheckResult]: Loop: 2998#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2995#L17-8 assume !!(rangesum_~i~1 < 10); 2996#L18-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2998#L17-7 [2019-01-02 00:17:44,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:44,835 INFO L82 PathProgramCache]: Analyzing trace with hash -365260545, now seen corresponding path program 1 times [2019-01-02 00:17:44,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:44,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:44,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:44,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:44,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:44,952 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-01-02 00:17:44,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:17:44,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-02 00:17:44,954 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:17:44,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:44,954 INFO L82 PathProgramCache]: Analyzing trace with hash 85178, now seen corresponding path program 1 times [2019-01-02 00:17:44,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:44,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:44,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:44,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:44,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:45,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:17:45,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:17:45,072 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. cyclomatic complexity: 16 Second operand 4 states. [2019-01-02 00:17:45,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:45,143 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2019-01-02 00:17:45,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:17:45,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 123 transitions. [2019-01-02 00:17:45,146 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2019-01-02 00:17:45,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 106 states and 119 transitions. [2019-01-02 00:17:45,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2019-01-02 00:17:45,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2019-01-02 00:17:45,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 119 transitions. [2019-01-02 00:17:45,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:17:45,148 INFO L705 BuchiCegarLoop]: Abstraction has 106 states and 119 transitions. [2019-01-02 00:17:45,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 119 transitions. [2019-01-02 00:17:45,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2019-01-02 00:17:45,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-02 00:17:45,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2019-01-02 00:17:45,153 INFO L728 BuchiCegarLoop]: Abstraction has 95 states and 104 transitions. [2019-01-02 00:17:45,153 INFO L608 BuchiCegarLoop]: Abstraction has 95 states and 104 transitions. [2019-01-02 00:17:45,153 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2019-01-02 00:17:45,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 104 transitions. [2019-01-02 00:17:45,154 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-02 00:17:45,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:45,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:45,159 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 7, 7, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:17:45,160 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:45,160 INFO L794 eck$LassoCheckResult]: Stem: 3193#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3190#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 3191#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3195#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3196#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3197#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3223#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3222#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3221#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3220#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3219#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3218#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3217#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3216#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3215#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3214#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3213#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3212#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3211#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3210#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3209#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3207#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3206#L6-3 assume !(init_nondet_~i~0 < 10); 3200#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 3198#L17-3 assume !!(rangesum_~i~1 < 10); 3184#L18 assume !(rangesum_~i~1 > 5); 3172#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3173#L17-3 assume !!(rangesum_~i~1 < 10); 3185#L18 assume !(rangesum_~i~1 > 5); 3174#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3175#L17-3 assume !!(rangesum_~i~1 < 10); 3247#L18 assume !(rangesum_~i~1 > 5); 3245#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3243#L17-3 assume !!(rangesum_~i~1 < 10); 3241#L18 assume !(rangesum_~i~1 > 5); 3239#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3237#L17-3 assume !!(rangesum_~i~1 < 10); 3235#L18 assume !(rangesum_~i~1 > 5); 3233#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3231#L17-3 assume !!(rangesum_~i~1 < 10); 3229#L18 assume !(rangesum_~i~1 > 5); 3225#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3227#L17-3 assume !!(rangesum_~i~1 < 10); 3224#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 3205#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3203#L17-3 assume !(rangesum_~i~1 < 10); 3194#L17-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 3176#L26 main_#t~ret4 := rangesum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 3177#L17-8 assume !!(rangesum_~i~1 < 10); 3180#L18-2 assume !(rangesum_~i~1 > 5); 3181#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3192#L17-8 assume !!(rangesum_~i~1 < 10); 3250#L18-2 assume !(rangesum_~i~1 > 5); 3249#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3248#L17-8 assume !!(rangesum_~i~1 < 10); 3246#L18-2 assume !(rangesum_~i~1 > 5); 3244#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3242#L17-8 assume !!(rangesum_~i~1 < 10); 3240#L18-2 assume !(rangesum_~i~1 > 5); 3238#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3236#L17-8 assume !!(rangesum_~i~1 < 10); 3234#L18-2 assume !(rangesum_~i~1 > 5); 3232#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3230#L17-8 assume !!(rangesum_~i~1 < 10); 3228#L18-2 assume !(rangesum_~i~1 > 5); 3208#L17-7 [2019-01-02 00:17:45,160 INFO L796 eck$LassoCheckResult]: Loop: 3208#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3226#L17-8 assume !!(rangesum_~i~1 < 10); 3202#L18-2 assume !(rangesum_~i~1 > 5); 3208#L17-7 [2019-01-02 00:17:45,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:45,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1039890653, now seen corresponding path program 1 times [2019-01-02 00:17:45,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:45,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:45,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:45,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:45,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:45,362 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-01-02 00:17:45,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:17:45,362 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:17:45,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:45,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:45,433 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-01-02 00:17:45,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-02 00:17:45,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-01-02 00:17:45,464 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:17:45,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:45,465 INFO L82 PathProgramCache]: Analyzing trace with hash 85180, now seen corresponding path program 1 times [2019-01-02 00:17:45,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:45,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:45,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:45,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:45,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:45,632 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-02 00:17:45,659 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:17:45,659 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:17:45,659 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:17:45,659 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:17:45,659 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:17:45,659 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:17:45,659 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:17:45,659 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:17:45,659 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum10_false-unreach-call_true-termination.i_Iteration20_Loop [2019-01-02 00:17:45,660 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:17:45,660 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:17:45,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:45,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:45,690 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:17:45,691 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:17:45,698 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:17:45,699 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:17:45,722 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:17:45,722 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:17:45,809 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-02 00:17:45,811 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:17:45,812 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:17:45,812 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:17:45,812 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:17:45,812 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:17:45,812 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:17:45,812 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:17:45,812 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:17:45,812 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum10_false-unreach-call_true-termination.i_Iteration20_Loop [2019-01-02 00:17:45,812 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:17:45,812 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:17:45,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:45,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:17:45,841 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:17:45,841 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:17:45,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:17:45,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:45,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:17:45,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:45,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:45,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:45,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:17:45,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:17:45,846 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:17:45,847 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:17:45,847 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-02 00:17:45,848 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:17:45,848 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:17:45,848 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:17:45,848 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1) = -2*ULTIMATE.start_rangesum_~i~1 + 9 Supporting invariants [] [2019-01-02 00:17:45,848 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:17:45,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:45,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:45,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:45,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:17:46,000 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-02 00:17:46,001 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 95 states and 104 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-01-02 00:17:46,038 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 95 states and 104 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 114 states and 126 transitions. Complement of second has 5 states. [2019-01-02 00:17:46,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-02 00:17:46,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:17:46,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2019-01-02 00:17:46,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 65 letters. Loop has 3 letters. [2019-01-02 00:17:46,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:17:46,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 68 letters. Loop has 3 letters. [2019-01-02 00:17:46,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:17:46,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 65 letters. Loop has 6 letters. [2019-01-02 00:17:46,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:17:46,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 126 transitions. [2019-01-02 00:17:46,048 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-01-02 00:17:46,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 99 states and 109 transitions. [2019-01-02 00:17:46,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2019-01-02 00:17:46,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2019-01-02 00:17:46,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 109 transitions. [2019-01-02 00:17:46,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:17:46,050 INFO L705 BuchiCegarLoop]: Abstraction has 99 states and 109 transitions. [2019-01-02 00:17:46,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 109 transitions. [2019-01-02 00:17:46,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-01-02 00:17:46,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-02 00:17:46,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2019-01-02 00:17:46,058 INFO L728 BuchiCegarLoop]: Abstraction has 98 states and 108 transitions. [2019-01-02 00:17:46,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-02 00:17:46,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-02 00:17:46,058 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 7 states. [2019-01-02 00:17:46,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:46,948 INFO L93 Difference]: Finished difference Result 137 states and 157 transitions. [2019-01-02 00:17:46,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-02 00:17:46,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 157 transitions. [2019-01-02 00:17:46,952 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2019-01-02 00:17:46,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 135 states and 154 transitions. [2019-01-02 00:17:46,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2019-01-02 00:17:46,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2019-01-02 00:17:46,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 154 transitions. [2019-01-02 00:17:46,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:17:46,955 INFO L705 BuchiCegarLoop]: Abstraction has 135 states and 154 transitions. [2019-01-02 00:17:46,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 154 transitions. [2019-01-02 00:17:46,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 104. [2019-01-02 00:17:46,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-02 00:17:46,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2019-01-02 00:17:46,958 INFO L728 BuchiCegarLoop]: Abstraction has 104 states and 113 transitions. [2019-01-02 00:17:46,958 INFO L608 BuchiCegarLoop]: Abstraction has 104 states and 113 transitions. [2019-01-02 00:17:46,958 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2019-01-02 00:17:46,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 113 transitions. [2019-01-02 00:17:46,960 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-01-02 00:17:46,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:46,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:46,961 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 8, 8, 8, 7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:17:46,961 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:46,961 INFO L794 eck$LassoCheckResult]: Stem: 4080#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4076#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 4077#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4082#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4083#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4084#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4111#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4110#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4109#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4108#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4107#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4106#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4105#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4104#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4103#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4102#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4101#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4100#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4099#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4098#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4097#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4096#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4095#L6-3 assume !(init_nondet_~i~0 < 10); 4088#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 4089#L17-3 assume !!(rangesum_~i~1 < 10); 4065#L18 assume !(rangesum_~i~1 > 5); 4051#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4052#L17-3 assume !!(rangesum_~i~1 < 10); 4130#L18 assume !(rangesum_~i~1 > 5); 4053#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4054#L17-3 assume !!(rangesum_~i~1 < 10); 4066#L18 assume !(rangesum_~i~1 > 5); 4067#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4129#L17-3 assume !!(rangesum_~i~1 < 10); 4128#L18 assume !(rangesum_~i~1 > 5); 4127#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4126#L17-3 assume !!(rangesum_~i~1 < 10); 4125#L18 assume !(rangesum_~i~1 > 5); 4124#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4123#L17-3 assume !!(rangesum_~i~1 < 10); 4122#L18 assume !(rangesum_~i~1 > 5); 4114#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4121#L17-3 assume !!(rangesum_~i~1 < 10); 4120#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4113#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4117#L17-3 assume !!(rangesum_~i~1 < 10); 4112#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4093#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4085#L17-3 assume !(rangesum_~i~1 < 10); 4081#L17-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 4055#L26 main_#t~ret4 := rangesum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 4056#L17-8 assume !!(rangesum_~i~1 < 10); 4059#L18-2 assume !(rangesum_~i~1 > 5); 4060#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4078#L17-8 assume !!(rangesum_~i~1 < 10); 4134#L18-2 assume !(rangesum_~i~1 > 5); 4133#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4131#L17-8 assume !!(rangesum_~i~1 < 10); 4132#L18-2 assume !(rangesum_~i~1 > 5); 4139#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4138#L17-8 assume !!(rangesum_~i~1 < 10); 4137#L18-2 assume !(rangesum_~i~1 > 5); 4136#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4135#L17-8 assume !!(rangesum_~i~1 < 10); 4061#L18-2 assume !(rangesum_~i~1 > 5); 4062#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4140#L17-8 assume !!(rangesum_~i~1 < 10); 4119#L18-2 assume !(rangesum_~i~1 > 5); 4118#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4072#L17-8 assume !!(rangesum_~i~1 < 10); 4073#L18-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4115#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4116#L17-8 assume !!(rangesum_~i~1 < 10); 4092#L18-2 [2019-01-02 00:17:46,962 INFO L796 eck$LassoCheckResult]: Loop: 4092#L18-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4094#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4091#L17-8 assume !!(rangesum_~i~1 < 10); 4092#L18-2 [2019-01-02 00:17:46,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:46,962 INFO L82 PathProgramCache]: Analyzing trace with hash 2012858871, now seen corresponding path program 1 times [2019-01-02 00:17:46,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:46,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:46,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:46,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:46,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:46,973 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-02 00:17:46,973 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-02 00:17:46,974 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-02 00:17:46,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:47,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:47,203 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2019-01-02 00:17:47,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-02 00:17:47,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-01-02 00:17:47,222 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:17:47,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:47,222 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 2 times [2019-01-02 00:17:47,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:47,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:47,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:47,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:47,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:47,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-02 00:17:47,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-02 00:17:47,328 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. cyclomatic complexity: 15 Second operand 11 states. [2019-01-02 00:17:47,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:47,492 INFO L93 Difference]: Finished difference Result 138 states and 156 transitions. [2019-01-02 00:17:47,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-02 00:17:47,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 156 transitions. [2019-01-02 00:17:47,496 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2019-01-02 00:17:47,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 136 states and 154 transitions. [2019-01-02 00:17:47,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2019-01-02 00:17:47,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2019-01-02 00:17:47,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 154 transitions. [2019-01-02 00:17:47,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:17:47,501 INFO L705 BuchiCegarLoop]: Abstraction has 136 states and 154 transitions. [2019-01-02 00:17:47,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 154 transitions. [2019-01-02 00:17:47,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 110. [2019-01-02 00:17:47,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-02 00:17:47,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2019-01-02 00:17:47,508 INFO L728 BuchiCegarLoop]: Abstraction has 110 states and 120 transitions. [2019-01-02 00:17:47,508 INFO L608 BuchiCegarLoop]: Abstraction has 110 states and 120 transitions. [2019-01-02 00:17:47,508 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2019-01-02 00:17:47,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 120 transitions. [2019-01-02 00:17:47,509 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-01-02 00:17:47,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:47,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:47,515 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 9, 9, 9, 8, 6, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:17:47,516 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:47,516 INFO L794 eck$LassoCheckResult]: Stem: 4551#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4546#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 4547#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4553#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4554#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4555#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4583#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4582#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4581#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4580#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4579#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4578#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4577#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4576#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4575#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4574#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4573#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4572#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4571#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4570#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4569#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4568#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4567#L6-3 assume !(init_nondet_~i~0 < 10); 4560#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 4561#L17-3 assume !!(rangesum_~i~1 < 10); 4537#L18 assume !(rangesum_~i~1 > 5); 4523#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4524#L17-3 assume !!(rangesum_~i~1 < 10); 4538#L18 assume !(rangesum_~i~1 > 5); 4525#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4526#L17-3 assume !!(rangesum_~i~1 < 10); 4557#L18 assume !(rangesum_~i~1 > 5); 4608#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4607#L17-3 assume !!(rangesum_~i~1 < 10); 4606#L18 assume !(rangesum_~i~1 > 5); 4605#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4604#L17-3 assume !!(rangesum_~i~1 < 10); 4603#L18 assume !(rangesum_~i~1 > 5); 4602#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4601#L17-3 assume !!(rangesum_~i~1 < 10); 4600#L18 assume !(rangesum_~i~1 > 5); 4586#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4599#L17-3 assume !!(rangesum_~i~1 < 10); 4598#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4597#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4596#L17-3 assume !!(rangesum_~i~1 < 10); 4595#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4585#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4587#L17-3 assume !!(rangesum_~i~1 < 10); 4584#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4565#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4556#L17-3 assume !(rangesum_~i~1 < 10); 4552#L17-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 4527#L26 main_#t~ret4 := rangesum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 4528#L17-8 assume !!(rangesum_~i~1 < 10); 4543#L18-2 assume !(rangesum_~i~1 > 5); 4548#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4549#L17-8 assume !!(rangesum_~i~1 < 10); 4612#L18-2 assume !(rangesum_~i~1 > 5); 4611#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4609#L17-8 assume !!(rangesum_~i~1 < 10); 4610#L18-2 assume !(rangesum_~i~1 > 5); 4617#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4616#L17-8 assume !!(rangesum_~i~1 < 10); 4615#L18-2 assume !(rangesum_~i~1 > 5); 4614#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4613#L17-8 assume !!(rangesum_~i~1 < 10); 4533#L18-2 assume !(rangesum_~i~1 > 5); 4534#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4618#L17-8 assume !!(rangesum_~i~1 < 10); 4594#L18-2 assume !(rangesum_~i~1 > 5); 4593#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4592#L17-8 assume !!(rangesum_~i~1 < 10); 4531#L18-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4532#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4591#L17-8 assume !!(rangesum_~i~1 < 10); 4590#L18-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4589#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4588#L17-8 assume !!(rangesum_~i~1 < 10); 4564#L18-2 [2019-01-02 00:17:47,516 INFO L796 eck$LassoCheckResult]: Loop: 4564#L18-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4566#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4563#L17-8 assume !!(rangesum_~i~1 < 10); 4564#L18-2 [2019-01-02 00:17:47,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:47,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1646097460, now seen corresponding path program 2 times [2019-01-02 00:17:47,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:47,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:47,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:47,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:47,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:47,532 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-02 00:17:47,532 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-02 00:17:47,532 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-02 00:17:47,551 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-02 00:17:47,590 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-02 00:17:47,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:17:47,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:47,748 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-01-02 00:17:47,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-02 00:17:47,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-01-02 00:17:47,771 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:17:47,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:47,771 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 3 times [2019-01-02 00:17:47,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:47,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:47,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:47,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:47,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:47,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-02 00:17:47,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-02 00:17:47,825 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. cyclomatic complexity: 16 Second operand 12 states. [2019-01-02 00:17:48,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:48,097 INFO L93 Difference]: Finished difference Result 141 states and 158 transitions. [2019-01-02 00:17:48,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-02 00:17:48,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 158 transitions. [2019-01-02 00:17:48,101 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2019-01-02 00:17:48,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 139 states and 156 transitions. [2019-01-02 00:17:48,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2019-01-02 00:17:48,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2019-01-02 00:17:48,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 156 transitions. [2019-01-02 00:17:48,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:17:48,103 INFO L705 BuchiCegarLoop]: Abstraction has 139 states and 156 transitions. [2019-01-02 00:17:48,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 156 transitions. [2019-01-02 00:17:48,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 116. [2019-01-02 00:17:48,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-02 00:17:48,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2019-01-02 00:17:48,112 INFO L728 BuchiCegarLoop]: Abstraction has 116 states and 127 transitions. [2019-01-02 00:17:48,112 INFO L608 BuchiCegarLoop]: Abstraction has 116 states and 127 transitions. [2019-01-02 00:17:48,112 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2019-01-02 00:17:48,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 127 transitions. [2019-01-02 00:17:48,113 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-01-02 00:17:48,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:48,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:48,114 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 9, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:17:48,114 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:48,114 INFO L794 eck$LassoCheckResult]: Stem: 5050#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5046#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 5047#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5052#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5053#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5054#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5098#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5097#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5096#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5095#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5093#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5091#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5089#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5087#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5085#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5083#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5081#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5079#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5077#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5075#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5073#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5071#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5070#L6-3 assume !(init_nondet_~i~0 < 10); 5059#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 5060#L17-3 assume !!(rangesum_~i~1 < 10); 5037#L18 assume !(rangesum_~i~1 > 5); 5023#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5024#L17-3 assume !!(rangesum_~i~1 < 10); 5056#L18 assume !(rangesum_~i~1 > 5); 5025#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5026#L17-3 assume !!(rangesum_~i~1 < 10); 5038#L18 assume !(rangesum_~i~1 > 5); 5039#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5114#L17-3 assume !!(rangesum_~i~1 < 10); 5113#L18 assume !(rangesum_~i~1 > 5); 5112#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5111#L17-3 assume !!(rangesum_~i~1 < 10); 5110#L18 assume !(rangesum_~i~1 > 5); 5109#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5108#L17-3 assume !!(rangesum_~i~1 < 10); 5107#L18 assume !(rangesum_~i~1 > 5); 5067#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5106#L17-3 assume !!(rangesum_~i~1 < 10); 5105#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5104#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5103#L17-3 assume !!(rangesum_~i~1 < 10); 5102#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5101#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5100#L17-3 assume !!(rangesum_~i~1 < 10); 5099#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5066#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5068#L17-3 assume !!(rangesum_~i~1 < 10); 5065#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5064#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5055#L17-3 assume !(rangesum_~i~1 < 10); 5051#L17-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 5027#L26 main_#t~ret4 := rangesum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 5028#L17-8 assume !!(rangesum_~i~1 < 10); 5031#L18-2 assume !(rangesum_~i~1 > 5); 5032#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5048#L17-8 assume !!(rangesum_~i~1 < 10); 5118#L18-2 assume !(rangesum_~i~1 > 5); 5117#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5115#L17-8 assume !!(rangesum_~i~1 < 10); 5116#L18-2 assume !(rangesum_~i~1 > 5); 5123#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5122#L17-8 assume !!(rangesum_~i~1 < 10); 5121#L18-2 assume !(rangesum_~i~1 > 5); 5120#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5119#L17-8 assume !!(rangesum_~i~1 < 10); 5033#L18-2 assume !(rangesum_~i~1 > 5); 5034#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5124#L17-8 assume !!(rangesum_~i~1 < 10); 5094#L18-2 assume !(rangesum_~i~1 > 5); 5092#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5090#L17-8 assume !!(rangesum_~i~1 < 10); 5088#L18-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5086#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5084#L17-8 assume !!(rangesum_~i~1 < 10); 5082#L18-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5080#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5078#L17-8 assume !!(rangesum_~i~1 < 10); 5076#L18-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5074#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5072#L17-8 assume !!(rangesum_~i~1 < 10); 5063#L18-2 [2019-01-02 00:17:48,114 INFO L796 eck$LassoCheckResult]: Loop: 5063#L18-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5069#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5062#L17-8 assume !!(rangesum_~i~1 < 10); 5063#L18-2 [2019-01-02 00:17:48,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:48,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1484601769, now seen corresponding path program 3 times [2019-01-02 00:17:48,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:48,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:48,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:48,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:48,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:48,136 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-02 00:17:48,136 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-02 00:17:48,136 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-02 00:17:48,164 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-02 00:17:48,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-02 00:17:48,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-02 00:17:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:48,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:48,452 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 4 times [2019-01-02 00:17:48,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:48,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:48,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:48,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:48,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:48,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:48,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1801965686, now seen corresponding path program 4 times [2019-01-02 00:17:48,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:48,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:48,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:48,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:48,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:48,502 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-02 00:17:48,502 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-02 00:17:48,503 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-02 00:17:48,541 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-02 00:17:48,594 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-02 00:17:48,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:17:48,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:48,914 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2019-01-02 00:17:48,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:17:48,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-02 00:17:48,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-02 00:17:48,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-02 00:17:48,970 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. cyclomatic complexity: 17 Second operand 7 states. [2019-01-02 00:17:49,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:49,095 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2019-01-02 00:17:49,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-02 00:17:49,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 143 transitions. [2019-01-02 00:17:49,098 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-02 00:17:49,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 115 states and 119 transitions. [2019-01-02 00:17:49,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2019-01-02 00:17:49,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2019-01-02 00:17:49,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 119 transitions. [2019-01-02 00:17:49,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:17:49,103 INFO L705 BuchiCegarLoop]: Abstraction has 115 states and 119 transitions. [2019-01-02 00:17:49,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 119 transitions. [2019-01-02 00:17:49,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2019-01-02 00:17:49,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-02 00:17:49,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2019-01-02 00:17:49,105 INFO L728 BuchiCegarLoop]: Abstraction has 96 states and 100 transitions. [2019-01-02 00:17:49,105 INFO L608 BuchiCegarLoop]: Abstraction has 96 states and 100 transitions. [2019-01-02 00:17:49,105 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2019-01-02 00:17:49,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 100 transitions. [2019-01-02 00:17:49,111 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-02 00:17:49,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:49,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:49,112 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:17:49,113 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:17:49,113 INFO L794 eck$LassoCheckResult]: Stem: 5576#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5572#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 5573#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5578#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5579#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5580#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5639#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5638#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5637#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5636#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5635#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5634#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5633#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5632#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5631#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5630#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5629#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5627#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5625#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5623#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5621#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5618#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5617#L6-3 assume !(init_nondet_~i~0 < 10); 5584#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 5581#L17-3 assume !!(rangesum_~i~1 < 10); 5564#L18 assume !(rangesum_~i~1 > 5); 5551#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5552#L17-3 assume !!(rangesum_~i~1 < 10); 5582#L18 assume !(rangesum_~i~1 > 5); 5553#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5554#L17-3 assume !!(rangesum_~i~1 < 10); 5565#L18 assume !(rangesum_~i~1 > 5); 5566#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5628#L17-3 assume !!(rangesum_~i~1 < 10); 5626#L18 assume !(rangesum_~i~1 > 5); 5624#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5622#L17-3 assume !!(rangesum_~i~1 < 10); 5620#L18 assume !(rangesum_~i~1 > 5); 5619#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5616#L17-3 assume !!(rangesum_~i~1 < 10); 5615#L18 assume !(rangesum_~i~1 > 5); 5610#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5613#L17-3 assume !!(rangesum_~i~1 < 10); 5609#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5607#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5605#L17-3 assume !!(rangesum_~i~1 < 10); 5603#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5601#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5599#L17-3 assume !!(rangesum_~i~1 < 10); 5597#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5595#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5593#L17-3 assume !!(rangesum_~i~1 < 10); 5591#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5589#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5587#L17-3 assume !(rangesum_~i~1 < 10); 5577#L17-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 5555#L26 main_#t~ret4 := rangesum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 5556#L17-8 assume !!(rangesum_~i~1 < 10); 5559#L18-2 assume !(rangesum_~i~1 > 5); 5560#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5574#L17-8 assume !!(rangesum_~i~1 < 10); 5646#L18-2 assume !(rangesum_~i~1 > 5); 5575#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5571#L17-8 assume !!(rangesum_~i~1 < 10); 5561#L18-2 assume !(rangesum_~i~1 > 5); 5562#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5645#L17-8 assume !!(rangesum_~i~1 < 10); 5644#L18-2 assume !(rangesum_~i~1 > 5); 5643#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5642#L17-8 assume !!(rangesum_~i~1 < 10); 5641#L18-2 assume !(rangesum_~i~1 > 5); 5640#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5612#L17-8 assume !!(rangesum_~i~1 < 10); 5614#L18-2 assume !(rangesum_~i~1 > 5); 5611#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5608#L17-8 assume !!(rangesum_~i~1 < 10); 5606#L18-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5604#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5602#L17-8 assume !!(rangesum_~i~1 < 10); 5600#L18-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5598#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5596#L17-8 assume !!(rangesum_~i~1 < 10); 5594#L18-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5592#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5590#L17-8 assume !!(rangesum_~i~1 < 10); 5588#L18-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5586#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5585#L17-8 assume !(rangesum_~i~1 < 10); 5567#L17-9 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 5568#L26-1 main_#t~ret7 := rangesum_#res;main_~ret2~0 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;main_~i~2 := 0; 5569#L43-3 [2019-01-02 00:17:49,113 INFO L796 eck$LassoCheckResult]: Loop: 5569#L43-3 assume !!(main_~i~2 < 9);call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem10; 5570#L43-2 main_#t~post9 := main_~i~2;main_~i~2 := 1 + main_#t~post9;havoc main_#t~post9; 5569#L43-3 [2019-01-02 00:17:49,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:49,114 INFO L82 PathProgramCache]: Analyzing trace with hash 817204024, now seen corresponding path program 1 times [2019-01-02 00:17:49,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:49,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:49,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:49,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:49,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:49,133 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-02 00:17:49,133 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-02 00:17:49,133 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-02 00:17:49,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:49,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:49,388 INFO L82 PathProgramCache]: Analyzing trace with hash 3331, now seen corresponding path program 1 times [2019-01-02 00:17:49,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:49,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:49,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:49,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:49,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:49,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:49,403 INFO L82 PathProgramCache]: Analyzing trace with hash -645945734, now seen corresponding path program 1 times [2019-01-02 00:17:49,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:49,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:49,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:49,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:49,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:49,418 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-02 00:17:49,419 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-02 00:17:49,419 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-02 00:17:49,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:49,884 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-02 00:18:10,004 WARN L181 SmtUtils]: Spent 20.09 s on a formula simplification. DAG size of input: 517 DAG size of output: 379 [2019-01-02 00:18:52,272 WARN L181 SmtUtils]: Spent 38.71 s on a formula simplification. DAG size of input: 325 DAG size of output: 185 [2019-01-02 00:18:52,276 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:18:52,276 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:18:52,276 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:18:52,276 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:18:52,277 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:18:52,277 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:18:52,277 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:18:52,277 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:18:52,277 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum10_false-unreach-call_true-termination.i_Iteration24_Lasso [2019-01-02 00:18:52,277 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:18:52,277 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:18:52,281 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-02 00:18:52,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:52,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:52,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:52,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:52,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:52,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:52,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:52,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:53,454 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:286) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:958) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-01-02 00:18:53,463 INFO L168 Benchmark]: Toolchain (without parser) took 85762.85 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 470.8 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 590.0 MB. Max. memory is 11.5 GB. [2019-01-02 00:18:53,464 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:18:53,464 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.21 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-02 00:18:53,465 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.47 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-02 00:18:53,466 INFO L168 Benchmark]: Boogie Preprocessor took 109.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -208.3 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-01-02 00:18:53,471 INFO L168 Benchmark]: RCFGBuilder took 633.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2019-01-02 00:18:53,472 INFO L168 Benchmark]: BuchiAutomizer took 84687.06 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 319.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 611.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:18:53,480 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 280.21 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.47 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 109.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -208.3 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 633.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 84687.06 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 319.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 611.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...