./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/reducercommutativity/rangesum_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/rangesum_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 279fae57395782089eff32ec1396d1726d808c7f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:43,786 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:17:43,791 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:17:43,813 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:17:43,813 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:17:43,815 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:17:43,816 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:17:43,818 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:17:43,820 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:17:43,821 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:17:43,822 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:17:43,822 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:17:43,824 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:17:43,825 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:17:43,826 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:17:43,827 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:17:43,828 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:17:43,830 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:17:43,832 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:17:43,834 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:17:43,835 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:17:43,837 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:17:43,839 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:17:43,840 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:17:43,840 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:17:43,841 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:17:43,842 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:17:43,843 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:17:43,845 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:17:43,846 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:17:43,846 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:17:43,847 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:17:43,847 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:17:43,847 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:17:43,849 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:17:43,849 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:17:43,850 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:43,867 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:17:43,867 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:17:43,868 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:17:43,869 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:17:43,869 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:17:43,869 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:17:43,870 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:17:43,870 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:17:43,870 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:17:43,870 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:17:43,870 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:17:43,871 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:17:43,871 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:17:43,871 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:17:43,871 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:17:43,871 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:17:43,871 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:17:43,873 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:17:43,873 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:17:43,873 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:17:43,873 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:17:43,874 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:17:43,874 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:17:43,874 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:17:43,874 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:17:43,874 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:17:43,875 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:17:43,875 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:17:43,875 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:17:43,875 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:17:43,875 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:17:43,878 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:17:43,878 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 -> 279fae57395782089eff32ec1396d1726d808c7f [2019-01-02 00:17:43,946 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:17:43,964 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:17:43,971 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:17:43,973 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:17:43,973 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:17:43,977 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/reducercommutativity/rangesum_false-unreach-call_true-termination.i [2019-01-02 00:17:44,034 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8c99e349/3c03fa2bd10d44328d97ddc15e249166/FLAG9f3f99872 [2019-01-02 00:17:44,506 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:17:44,507 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/reducercommutativity/rangesum_false-unreach-call_true-termination.i [2019-01-02 00:17:44,513 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8c99e349/3c03fa2bd10d44328d97ddc15e249166/FLAG9f3f99872 [2019-01-02 00:17:44,868 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8c99e349/3c03fa2bd10d44328d97ddc15e249166 [2019-01-02 00:17:44,873 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:17:44,875 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:17:44,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:17:44,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:17:44,880 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:17:44,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:17:44" (1/1) ... [2019-01-02 00:17:44,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66f03938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:17:44, skipping insertion in model container [2019-01-02 00:17:44,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:17:44" (1/1) ... [2019-01-02 00:17:44,895 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:17:44,921 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:17:45,185 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:17:45,201 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:17:45,240 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:17:45,262 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:17:45,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:17:45 WrapperNode [2019-01-02 00:17:45,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:17:45,263 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:17:45,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:17:45,264 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:17:45,275 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:45" (1/1) ... [2019-01-02 00:17:45,288 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:45" (1/1) ... [2019-01-02 00:17:45,339 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:17:45,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:17:45,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:17:45,340 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:17:45,421 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:45" (1/1) ... [2019-01-02 00:17:45,421 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:45" (1/1) ... [2019-01-02 00:17:45,426 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:45" (1/1) ... [2019-01-02 00:17:45,426 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:45" (1/1) ... [2019-01-02 00:17:45,435 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:45" (1/1) ... [2019-01-02 00:17:45,442 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:45" (1/1) ... [2019-01-02 00:17:45,444 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:45" (1/1) ... [2019-01-02 00:17:45,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:17:45,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:17:45,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:17:45,449 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:17:45,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:17:45" (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:45,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-02 00:17:45,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:17:45,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:17:45,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-02 00:17:45,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-02 00:17:45,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-02 00:17:46,150 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:17:46,150 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2019-01-02 00:17:46,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:17:46 BoogieIcfgContainer [2019-01-02 00:17:46,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:17:46,152 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:17:46,152 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:17:46,156 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:17:46,157 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:17:46,157 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:17:44" (1/3) ... [2019-01-02 00:17:46,158 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c26e111 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:17:46, skipping insertion in model container [2019-01-02 00:17:46,158 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:17:46,159 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:17:45" (2/3) ... [2019-01-02 00:17:46,159 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c26e111 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:17:46, skipping insertion in model container [2019-01-02 00:17:46,159 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:17:46,159 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:17:46" (3/3) ... [2019-01-02 00:17:46,161 INFO L375 chiAutomizerObserver]: Analyzing ICFG rangesum_false-unreach-call_true-termination.i [2019-01-02 00:17:46,226 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:17:46,227 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:17:46,227 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:17:46,227 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:17:46,228 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:17:46,228 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:17:46,228 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:17:46,228 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:17:46,228 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:17:46,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2019-01-02 00:17:46,278 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-01-02 00:17:46,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:46,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:46,286 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-02 00:17:46,287 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:17:46,287 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:17:46,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2019-01-02 00:17:46,290 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-01-02 00:17:46,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:46,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:46,291 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-02 00:17:46,291 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:17:46,300 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 9#L-1true havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 30#L33true assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);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; 17#L7-3true [2019-01-02 00:17:46,300 INFO L796 eck$LassoCheckResult]: Loop: 17#L7-3true assume !!(init_nondet_~i~0 < ~N~0);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; 6#L7-2true init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 17#L7-3true [2019-01-02 00:17:46,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:46,306 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-01-02 00:17:46,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:46,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:46,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:46,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:46,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:46,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:46,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1379, now seen corresponding path program 1 times [2019-01-02 00:17:46,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:46,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:46,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:46,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:46,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:46,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:46,459 INFO L82 PathProgramCache]: Analyzing trace with hash 28693956, now seen corresponding path program 1 times [2019-01-02 00:17:46,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:46,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:46,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:46,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:46,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:46,845 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-02 00:17:46,973 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:17:46,974 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:17:46,974 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:17:46,974 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:17:46,974 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:17:46,974 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:17:46,975 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:17:46,975 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:17:46,975 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration1_Lasso [2019-01-02 00:17:46,975 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:17:46,975 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:17:47,003 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:47,027 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:47,047 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:47,056 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:47,060 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:47,062 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:47,073 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:47,080 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:47,588 WARN L181 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-01-02 00:17:47,685 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:47,689 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:47,694 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:47,696 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:47,700 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:47,707 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:47,709 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:47,712 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:47,715 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:47,723 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:47,725 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:48,435 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:17:48,441 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:17:48,444 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:48,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:48,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:17:48,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:48,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:48,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:48,451 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:17:48,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:17:48,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:48,456 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:48,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:48,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:17:48,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:48,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:48,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:48,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:17:48,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:17:48,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:48,461 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:48,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:48,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:17:48,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:48,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:48,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:48,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:17:48,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:17:48,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:48,467 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:48,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:48,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:17:48,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:48,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:48,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:48,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:17:48,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:17:48,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:48,473 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:48,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:48,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:17:48,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:48,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:48,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:48,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:17:48,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:17:48,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:48,479 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:48,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:48,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:17:48,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:48,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:48,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:48,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:17:48,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:17:48,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:48,484 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:48,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:48,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:48,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:48,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:48,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:17:48,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:17:48,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:48,497 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:48,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:48,498 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-02 00:17:48,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:48,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:48,504 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-02 00:17:48,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:17:48,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:48,532 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:48,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:48,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:17:48,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:48,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:48,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:48,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:17:48,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:17:48,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:48,538 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:48,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:48,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:48,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:48,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:48,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:17:48,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:17:48,639 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:17:48,683 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:17:48,683 INFO L444 ModelExtractionUtils]: 21 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-02 00:17:48,688 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:17:48,694 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:17:48,694 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:17:48,695 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_nondet_~i~0, ~N~0) = -1*ULTIMATE.start_init_nondet_~i~0 + 1*~N~0 Supporting invariants [] [2019-01-02 00:17:48,782 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-02 00:17:48,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:48,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:48,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:49,037 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:49,052 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:49,054 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states. Second operand 3 states. [2019-01-02 00:17:49,241 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states.. Second operand 3 states. Result 86 states and 130 transitions. Complement of second has 7 states. [2019-01-02 00:17:49,241 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:49,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:17:49,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2019-01-02 00:17:49,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-02 00:17:49,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:17:49,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-02 00:17:49,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:17:49,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 3 letters. Loop has 4 letters. [2019-01-02 00:17:49,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:17:49,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 130 transitions. [2019-01-02 00:17:49,255 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:49,260 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 23 states and 33 transitions. [2019-01-02 00:17:49,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-02 00:17:49,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-01-02 00:17:49,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 33 transitions. [2019-01-02 00:17:49,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:17:49,263 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2019-01-02 00:17:49,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 33 transitions. [2019-01-02 00:17:49,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-02 00:17:49,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-02 00:17:49,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2019-01-02 00:17:49,290 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2019-01-02 00:17:49,290 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2019-01-02 00:17:49,290 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:17:49,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 33 transitions. [2019-01-02 00:17:49,292 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:49,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:49,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:49,292 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:17:49,292 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:49,293 INFO L794 eck$LassoCheckResult]: Stem: 190#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 187#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 188#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);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; 192#L7-3 assume !(init_nondet_~i~0 < ~N~0); 178#L5 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; 170#L18-3 [2019-01-02 00:17:49,293 INFO L796 eck$LassoCheckResult]: Loop: 170#L18-3 assume !!(rangesum_~i~1 < ~N~0); 172#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 181#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 170#L18-3 [2019-01-02 00:17:49,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:49,293 INFO L82 PathProgramCache]: Analyzing trace with hash 28693898, now seen corresponding path program 1 times [2019-01-02 00:17:49,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:49,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:49,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:49,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:49,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:49,405 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:49,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:17:49,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:17:49,408 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:17:49,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:49,409 INFO L82 PathProgramCache]: Analyzing trace with hash 56764, now seen corresponding path program 1 times [2019-01-02 00:17:49,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:49,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:49,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:49,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:49,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:49,489 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:17:49,489 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:17:49,490 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:17:49,490 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:17:49,490 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:17:49,490 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:17:49,490 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:17:49,490 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:17:49,491 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration2_Loop [2019-01-02 00:17:49,491 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:17:49,491 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:17:49,492 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:49,501 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:49,662 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 20 [2019-01-02 00:17:49,704 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:17:49,705 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:17:49,713 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:17:49,713 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:17:49,732 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-02 00:17:49,732 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_rangesum_#t~post2=0} Honda state: {ULTIMATE.start_rangesum_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:17:49,757 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:17:49,757 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:17:49,896 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:17:49,896 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:17:50,146 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-02 00:17:50,149 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:17:50,149 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:17:50,149 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:17:50,149 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:17:50,149 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:17:50,149 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:17:50,149 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:17:50,150 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:17:50,150 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration2_Loop [2019-01-02 00:17:50,150 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:17:50,150 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:17:50,151 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:50,157 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:50,296 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 20 [2019-01-02 00:17:50,329 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:17:50,329 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:17:50,330 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:50,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:50,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:17:50,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:50,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:50,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:50,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:17:50,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:17:50,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:50,337 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:50,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:50,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:17:50,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:50,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:50,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:50,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:17:50,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:17:50,346 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:17:50,350 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-02 00:17:50,350 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-02 00:17:50,351 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:17:50,351 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:17:50,351 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:17:50,351 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1, ~N~0) = -4*ULTIMATE.start_rangesum_~i~1 + 3*~N~0 Supporting invariants [] [2019-01-02 00:17:50,353 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:17:50,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:50,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:50,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:50,856 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 14 [2019-01-02 00:17:50,857 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:50,858 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:50,858 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 33 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-01-02 00:17:50,926 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 33 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 34 states and 53 transitions. Complement of second has 9 states. [2019-01-02 00:17:50,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-02 00:17:50,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-02 00:17:50,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-01-02 00:17:50,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-02 00:17:50,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:17:50,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-02 00:17:50,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:17:50,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 5 letters. Loop has 6 letters. [2019-01-02 00:17:50,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:17:50,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 53 transitions. [2019-01-02 00:17:50,935 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:50,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 46 transitions. [2019-01-02 00:17:50,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-01-02 00:17:50,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-02 00:17:50,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 46 transitions. [2019-01-02 00:17:50,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:17:50,939 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-01-02 00:17:50,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 46 transitions. [2019-01-02 00:17:50,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-01-02 00:17:50,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-02 00:17:50,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2019-01-02 00:17:50,943 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2019-01-02 00:17:50,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:17:50,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:17:50,948 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. Second operand 3 states. [2019-01-02 00:17:51,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:51,007 INFO L93 Difference]: Finished difference Result 30 states and 43 transitions. [2019-01-02 00:17:51,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:17:51,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 43 transitions. [2019-01-02 00:17:51,011 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:51,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 43 transitions. [2019-01-02 00:17:51,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-01-02 00:17:51,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-01-02 00:17:51,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 43 transitions. [2019-01-02 00:17:51,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:17:51,013 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2019-01-02 00:17:51,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 43 transitions. [2019-01-02 00:17:51,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-01-02 00:17:51,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-02 00:17:51,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2019-01-02 00:17:51,016 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2019-01-02 00:17:51,016 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2019-01-02 00:17:51,017 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:17:51,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 42 transitions. [2019-01-02 00:17:51,018 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:51,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:51,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:51,019 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:17:51,019 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:51,019 INFO L794 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 359#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 360#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);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; 364#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 347#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 348#L7-3 assume !(init_nondet_~i~0 < ~N~0); 349#L5 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; 350#L18-3 assume !!(rangesum_~i~1 < ~N~0); 339#L19 [2019-01-02 00:17:51,019 INFO L796 eck$LassoCheckResult]: Loop: 339#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);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; 351#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 337#L18-3 assume !!(rangesum_~i~1 < ~N~0); 339#L19 [2019-01-02 00:17:51,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:51,020 INFO L82 PathProgramCache]: Analyzing trace with hash 123162479, now seen corresponding path program 1 times [2019-01-02 00:17:51,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:51,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:51,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:51,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:51,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:51,083 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:51,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:17:51,083 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:51,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:51,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:51,175 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:51,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:17:51,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-01-02 00:17:51,195 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:17:51,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:51,195 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 1 times [2019-01-02 00:17:51,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:51,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:51,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:51,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:51,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:51,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-02 00:17:51,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-02 00:17:51,307 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. cyclomatic complexity: 19 Second operand 6 states. [2019-01-02 00:17:51,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:51,415 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2019-01-02 00:17:51,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:17:51,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2019-01-02 00:17:51,419 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:51,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 45 transitions. [2019-01-02 00:17:51,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-01-02 00:17:51,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-01-02 00:17:51,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 45 transitions. [2019-01-02 00:17:51,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:17:51,421 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 45 transitions. [2019-01-02 00:17:51,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 45 transitions. [2019-01-02 00:17:51,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-01-02 00:17:51,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-02 00:17:51,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2019-01-02 00:17:51,426 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2019-01-02 00:17:51,426 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2019-01-02 00:17:51,426 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-02 00:17:51,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. [2019-01-02 00:17:51,427 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:51,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:51,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:51,432 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-02 00:17:51,432 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:51,432 INFO L794 eck$LassoCheckResult]: Stem: 453#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 450#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 451#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);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; 455#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 456#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 457#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 437#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 438#L7-3 assume !(init_nondet_~i~0 < ~N~0); 439#L5 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; 440#L18-3 assume !!(rangesum_~i~1 < ~N~0); 430#L19 [2019-01-02 00:17:51,433 INFO L796 eck$LassoCheckResult]: Loop: 430#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);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; 442#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 428#L18-3 assume !!(rangesum_~i~1 < ~N~0); 430#L19 [2019-01-02 00:17:51,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:51,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1898228851, now seen corresponding path program 2 times [2019-01-02 00:17:51,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:51,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:51,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:51,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:51,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:51,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:51,462 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 2 times [2019-01-02 00:17:51,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:51,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:51,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:51,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:51,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:51,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:51,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1698716202, now seen corresponding path program 1 times [2019-01-02 00:17:51,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:51,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:51,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:51,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:51,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:51,555 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-02 00:17:51,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:17:51,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-02 00:17:51,880 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-02 00:17:51,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:17:51,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:17:51,882 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. cyclomatic complexity: 19 Second operand 4 states. [2019-01-02 00:17:52,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:52,138 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-01-02 00:17:52,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:17:52,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2019-01-02 00:17:52,141 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:52,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 50 transitions. [2019-01-02 00:17:52,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-02 00:17:52,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-02 00:17:52,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. [2019-01-02 00:17:52,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:17:52,143 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-01-02 00:17:52,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. [2019-01-02 00:17:52,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-01-02 00:17:52,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-02 00:17:52,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2019-01-02 00:17:52,147 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2019-01-02 00:17:52,147 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2019-01-02 00:17:52,147 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-02 00:17:52,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 47 transitions. [2019-01-02 00:17:52,148 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:17:52,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:52,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:52,149 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:17:52,149 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:52,150 INFO L794 eck$LassoCheckResult]: Stem: 535#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 531#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 532#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);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; 538#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 516#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 517#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 540#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 541#L7-3 assume !(init_nondet_~i~0 < ~N~0); 518#L5 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; 508#L18-3 assume !!(rangesum_~i~1 < ~N~0); 509#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 529#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 542#L18-3 assume !!(rangesum_~i~1 < ~N~0); 528#L19 [2019-01-02 00:17:52,150 INFO L796 eck$LassoCheckResult]: Loop: 528#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);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; 521#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 522#L18-3 assume !!(rangesum_~i~1 < ~N~0); 528#L19 [2019-01-02 00:17:52,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:52,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1698718124, now seen corresponding path program 1 times [2019-01-02 00:17:52,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:52,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:52,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:52,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:52,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:52,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:52,180 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 3 times [2019-01-02 00:17:52,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:52,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:52,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:52,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:52,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:52,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:52,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1087986773, now seen corresponding path program 1 times [2019-01-02 00:17:52,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:52,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:52,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:52,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:52,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:52,445 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-02 00:17:52,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:17:52,446 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:52,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:52,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:52,601 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:17:52,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:17:52,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 12 [2019-01-02 00:17:52,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-02 00:17:52,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-01-02 00:17:52,673 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. cyclomatic complexity: 17 Second operand 12 states. [2019-01-02 00:17:52,965 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 7 [2019-01-02 00:17:53,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:53,326 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2019-01-02 00:17:53,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-02 00:17:53,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 95 transitions. [2019-01-02 00:17:53,328 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2019-01-02 00:17:53,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 71 states and 85 transitions. [2019-01-02 00:17:53,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2019-01-02 00:17:53,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2019-01-02 00:17:53,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 85 transitions. [2019-01-02 00:17:53,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:17:53,330 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 85 transitions. [2019-01-02 00:17:53,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 85 transitions. [2019-01-02 00:17:53,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2019-01-02 00:17:53,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-02 00:17:53,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2019-01-02 00:17:53,338 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 82 transitions. [2019-01-02 00:17:53,338 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 82 transitions. [2019-01-02 00:17:53,339 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-02 00:17:53,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 82 transitions. [2019-01-02 00:17:53,340 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-01-02 00:17:53,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:53,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:53,341 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2019-01-02 00:17:53,341 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:53,341 INFO L794 eck$LassoCheckResult]: Stem: 732#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 728#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 729#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);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; 736#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 712#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 713#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 740#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 766#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 765#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 764#L7-3 assume !(init_nondet_~i~0 < ~N~0); 763#L5 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; 761#L18-3 assume !!(rangesum_~i~1 < ~N~0); 725#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 717#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 718#L18-3 assume !!(rangesum_~i~1 < ~N~0); 754#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 751#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 749#L18-3 assume !!(rangesum_~i~1 < ~N~0); 750#L19 [2019-01-02 00:17:53,341 INFO L796 eck$LassoCheckResult]: Loop: 750#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);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; 760#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 759#L18-3 assume !!(rangesum_~i~1 < ~N~0); 750#L19 [2019-01-02 00:17:53,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:53,341 INFO L82 PathProgramCache]: Analyzing trace with hash -194268853, now seen corresponding path program 2 times [2019-01-02 00:17:53,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:53,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:53,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:53,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:53,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:53,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:53,368 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 4 times [2019-01-02 00:17:53,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:53,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:53,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:53,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:53,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:53,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:53,378 INFO L82 PathProgramCache]: Analyzing trace with hash -2142422100, now seen corresponding path program 2 times [2019-01-02 00:17:53,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:53,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:53,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:53,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:53,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:53,620 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-02 00:17:53,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:17:53,620 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:53,630 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-02 00:17:53,674 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-02 00:17:53,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:17:53,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:53,975 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:17:53,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:17:53,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2019-01-02 00:17:54,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-02 00:17:54,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-01-02 00:17:54,040 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. cyclomatic complexity: 21 Second operand 19 states. [2019-01-02 00:17:54,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:54,829 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2019-01-02 00:17:54,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-02 00:17:54,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 141 transitions. [2019-01-02 00:17:54,833 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 17 [2019-01-02 00:17:54,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 104 states and 125 transitions. [2019-01-02 00:17:54,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2019-01-02 00:17:54,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2019-01-02 00:17:54,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 125 transitions. [2019-01-02 00:17:54,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:17:54,836 INFO L705 BuchiCegarLoop]: Abstraction has 104 states and 125 transitions. [2019-01-02 00:17:54,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 125 transitions. [2019-01-02 00:17:54,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 91. [2019-01-02 00:17:54,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-02 00:17:54,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2019-01-02 00:17:54,843 INFO L728 BuchiCegarLoop]: Abstraction has 91 states and 109 transitions. [2019-01-02 00:17:54,843 INFO L608 BuchiCegarLoop]: Abstraction has 91 states and 109 transitions. [2019-01-02 00:17:54,843 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-02 00:17:54,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 109 transitions. [2019-01-02 00:17:54,844 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-01-02 00:17:54,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:54,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:54,845 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1] [2019-01-02 00:17:54,845 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:54,845 INFO L794 eck$LassoCheckResult]: Stem: 1024#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1019#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1020#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);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; 1027#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 1004#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1005#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 1030#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1061#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 1060#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1058#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 1057#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1056#L7-3 assume !(init_nondet_~i~0 < ~N~0); 1055#L5 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; 1054#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1017#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1010#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1011#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1050#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1048#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1045#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1046#L19 [2019-01-02 00:17:54,845 INFO L796 eck$LassoCheckResult]: Loop: 1046#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);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; 1049#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1047#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1046#L19 [2019-01-02 00:17:54,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:54,846 INFO L82 PathProgramCache]: Analyzing trace with hash -326653975, now seen corresponding path program 3 times [2019-01-02 00:17:54,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:54,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:54,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:54,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:54,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:54,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:54,880 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 5 times [2019-01-02 00:17:54,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:54,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:54,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:54,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:54,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:54,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:54,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1047353422, now seen corresponding path program 3 times [2019-01-02 00:17:54,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:54,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:54,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:54,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:54,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:55,146 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-02 00:17:55,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:17:55,146 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:55,156 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-02 00:17:55,174 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-02 00:17:55,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:17:55,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:55,352 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-02 00:17:55,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:17:55,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2019-01-02 00:17:55,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-02 00:17:55,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-01-02 00:17:55,420 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. cyclomatic complexity: 25 Second operand 17 states. [2019-01-02 00:17:57,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:17:57,038 INFO L93 Difference]: Finished difference Result 245 states and 301 transitions. [2019-01-02 00:17:57,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-02 00:17:57,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 245 states and 301 transitions. [2019-01-02 00:17:57,043 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 41 [2019-01-02 00:17:57,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 245 states to 231 states and 286 transitions. [2019-01-02 00:17:57,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 197 [2019-01-02 00:17:57,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 197 [2019-01-02 00:17:57,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 231 states and 286 transitions. [2019-01-02 00:17:57,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:17:57,047 INFO L705 BuchiCegarLoop]: Abstraction has 231 states and 286 transitions. [2019-01-02 00:17:57,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states and 286 transitions. [2019-01-02 00:17:57,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 133. [2019-01-02 00:17:57,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-02 00:17:57,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 163 transitions. [2019-01-02 00:17:57,062 INFO L728 BuchiCegarLoop]: Abstraction has 133 states and 163 transitions. [2019-01-02 00:17:57,062 INFO L608 BuchiCegarLoop]: Abstraction has 133 states and 163 transitions. [2019-01-02 00:17:57,062 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-02 00:17:57,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 163 transitions. [2019-01-02 00:17:57,063 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 21 [2019-01-02 00:17:57,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:57,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:57,064 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 3, 1, 1, 1, 1, 1] [2019-01-02 00:17:57,064 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:17:57,064 INFO L794 eck$LassoCheckResult]: Stem: 1502#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1498#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1499#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);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; 1505#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 1506#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1507#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 1484#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1485#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 1509#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1533#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 1532#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1531#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 1530#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1529#L7-3 assume !(init_nondet_~i~0 < ~N~0); 1528#L5 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; 1527#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1526#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1525#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1524#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1523#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1522#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1521#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1520#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1516#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1519#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1573#L19 [2019-01-02 00:17:57,067 INFO L796 eck$LassoCheckResult]: Loop: 1573#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);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; 1574#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1571#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1573#L19 [2019-01-02 00:17:57,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:57,068 INFO L82 PathProgramCache]: Analyzing trace with hash -185017358, now seen corresponding path program 4 times [2019-01-02 00:17:57,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:57,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:57,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:57,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:57,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:57,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:57,100 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 6 times [2019-01-02 00:17:57,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:57,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:57,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:57,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:57,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:57,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:57,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1409041499, now seen corresponding path program 4 times [2019-01-02 00:17:57,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:57,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:57,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:57,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:57,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:57,853 WARN L181 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 128 [2019-01-02 00:17:57,962 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:17:57,962 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:17:57,962 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:17:57,963 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:17:57,963 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:17:57,963 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:17:57,963 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:17:57,963 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:17:57,964 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration8_Lasso [2019-01-02 00:17:57,964 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:17:57,964 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:17:57,968 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:57,977 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:57,979 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:57,980 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:57,982 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:57,985 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:58,160 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-01-02 00:17:58,282 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:58,284 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:58,287 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:58,289 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:58,291 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:58,315 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:58,317 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:58,318 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:58,320 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:58,322 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:58,324 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:58,326 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:58,331 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:58,333 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:58,336 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:58,338 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:58,341 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:58,342 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:58,827 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:17:58,827 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:17:58,828 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:58,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:58,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:17:58,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:58,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:58,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:58,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:17:58,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:17:58,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:58,835 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:58,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:58,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:17:58,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:58,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:58,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:58,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:17:58,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:17:58,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:58,840 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:58,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:58,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:17:58,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:58,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:58,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:58,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:17:58,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:17:58,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:58,848 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:58,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:58,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:17:58,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:58,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:58,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:58,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:17:58,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:17:58,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:58,854 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:58,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:58,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:58,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:58,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:58,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:17:58,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:17:58,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:58,861 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:58,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:58,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:58,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:58,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:58,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:17:58,865 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:17:58,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:58,872 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:58,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:58,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:58,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:58,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:58,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:17:58,877 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:17:58,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:58,880 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:58,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:58,881 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-02 00:17:58,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:58,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:58,886 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-02 00:17:58,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:17:58,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:58,894 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:58,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:58,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:58,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:58,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:58,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:17:58,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:17:58,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:17:58,902 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:58,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:17:58,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:17:58,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:17:58,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:17:58,910 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:17:58,910 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:17:58,936 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:17:58,971 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-02 00:17:58,971 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-02 00:17:58,972 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:17:58,972 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:17:58,976 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:17:58,976 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_init_nondet_~x.base)_2, ULTIMATE.start_rangesum_~i~1, ULTIMATE.start_rangesum_~x.offset) = 1*v_rep(select #length ULTIMATE.start_init_nondet_~x.base)_2 - 4*ULTIMATE.start_rangesum_~i~1 - 1*ULTIMATE.start_rangesum_~x.offset Supporting invariants [] [2019-01-02 00:17:59,118 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2019-01-02 00:17:59,143 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:17:59,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:59,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:17:59,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:17:59,416 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:59,416 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2019-01-02 00:17:59,417 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 133 states and 163 transitions. cyclomatic complexity: 41 Second operand 6 states. [2019-01-02 00:17:59,531 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 133 states and 163 transitions. cyclomatic complexity: 41. Second operand 6 states. Result 179 states and 227 transitions. Complement of second has 9 states. [2019-01-02 00:17:59,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-02 00:17:59,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-02 00:17:59,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2019-01-02 00:17:59,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 25 letters. Loop has 3 letters. [2019-01-02 00:17:59,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:17:59,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 28 letters. Loop has 3 letters. [2019-01-02 00:17:59,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:17:59,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 25 letters. Loop has 6 letters. [2019-01-02 00:17:59,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:17:59,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 179 states and 227 transitions. [2019-01-02 00:17:59,543 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 18 [2019-01-02 00:17:59,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 179 states to 156 states and 192 transitions. [2019-01-02 00:17:59,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2019-01-02 00:17:59,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 111 [2019-01-02 00:17:59,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 192 transitions. [2019-01-02 00:17:59,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:17:59,546 INFO L705 BuchiCegarLoop]: Abstraction has 156 states and 192 transitions. [2019-01-02 00:17:59,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 192 transitions. [2019-01-02 00:17:59,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 150. [2019-01-02 00:17:59,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-01-02 00:17:59,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 183 transitions. [2019-01-02 00:17:59,563 INFO L728 BuchiCegarLoop]: Abstraction has 150 states and 183 transitions. [2019-01-02 00:17:59,563 INFO L608 BuchiCegarLoop]: Abstraction has 150 states and 183 transitions. [2019-01-02 00:17:59,563 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-02 00:17:59,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 183 transitions. [2019-01-02 00:17:59,566 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 18 [2019-01-02 00:17:59,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:17:59,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:17:59,569 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:17:59,569 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:17:59,569 INFO L794 eck$LassoCheckResult]: Stem: 1958#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1953#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1954#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);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; 1962#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 1966#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2006#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 2005#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2003#L7-3 assume !(init_nondet_~i~0 < ~N~0); 2002#L5 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; 2001#L18-3 assume !!(rangesum_~i~1 < ~N~0); 2000#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1999#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1998#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1997#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1996#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1995#L18-3 assume !(rangesum_~i~1 < ~N~0); 1993#L18-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 1991#L27 main_#t~ret5 := rangesum_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;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; 1989#L18-8 assume !!(rangesum_~i~1 < ~N~0); 1987#L19-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1985#L18-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1983#L18-8 assume !!(rangesum_~i~1 < ~N~0); 1981#L19-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1980#L18-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1973#L18-8 assume !(rangesum_~i~1 < ~N~0); 1972#L18-9 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 1971#L27-1 main_#t~ret8 := rangesum_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~2 := 0; 1960#L46-3 [2019-01-02 00:17:59,569 INFO L796 eck$LassoCheckResult]: Loop: 1960#L46-3 assume !!(main_~i~2 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem11; 1961#L46-2 main_#t~post10 := main_~i~2;main_~i~2 := 1 + main_#t~post10;havoc main_#t~post10; 1960#L46-3 [2019-01-02 00:17:59,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:59,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1751120697, now seen corresponding path program 1 times [2019-01-02 00:17:59,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:59,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:59,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:59,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:17:59,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:59,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:59,613 INFO L82 PathProgramCache]: Analyzing trace with hash 3427, now seen corresponding path program 1 times [2019-01-02 00:17:59,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:59,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:59,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:59,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:59,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:59,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:17:59,623 INFO L82 PathProgramCache]: Analyzing trace with hash 800192681, now seen corresponding path program 1 times [2019-01-02 00:17:59,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:17:59,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:17:59,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:59,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:17:59,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:17:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:17:59,993 WARN L181 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-02 00:18:00,153 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-02 00:18:01,468 WARN L181 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 180 DAG size of output: 152 [2019-01-02 00:18:01,991 WARN L181 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 97 [2019-01-02 00:18:01,993 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:18:01,993 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:18:01,993 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:18:01,993 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:18:01,993 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:18:01,993 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:18:01,993 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:18:01,993 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:18:01,993 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum_false-unreach-call_true-termination.i_Iteration9_Lasso [2019-01-02 00:18:01,993 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:18:01,994 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:18:01,998 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:02,001 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:02,002 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:02,004 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:02,049 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:02,052 INFO L168 Benchmark]: Toolchain (without parser) took 17178.23 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 310.4 MB). Free memory was 943.3 MB in the beginning and 1.3 GB in the end (delta: -339.5 MB). Peak memory consumption was 414.0 MB. Max. memory is 11.5 GB. [2019-01-02 00:18:02,053 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:18:02,054 INFO L168 Benchmark]: CACSL2BoogieTranslator took 387.06 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.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:02,055 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.21 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.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:02,055 INFO L168 Benchmark]: Boogie Preprocessor took 108.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -191.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-02 00:18:02,056 INFO L168 Benchmark]: RCFGBuilder took 702.34 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: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-01-02 00:18:02,057 INFO L168 Benchmark]: BuchiAutomizer took 15899.00 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -181.6 MB). Peak memory consumption was 435.1 MB. Max. memory is 11.5 GB. [2019-01-02 00:18:02,063 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 387.06 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.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 76.21 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.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 108.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -191.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 702.34 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: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15899.00 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -181.6 MB). Peak memory consumption was 435.1 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...