./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/rangesum.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/reducercommutativity/rangesum.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.25-f470102 [2019-11-28 21:24:39,258 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 21:24:39,260 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 21:24:39,275 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 21:24:39,275 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 21:24:39,278 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 21:24:39,280 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 21:24:39,292 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 21:24:39,295 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 21:24:39,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 21:24:39,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 21:24:39,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 21:24:39,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 21:24:39,305 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 21:24:39,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 21:24:39,309 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 21:24:39,311 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 21:24:39,314 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 21:24:39,317 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 21:24:39,322 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 21:24:39,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 21:24:39,330 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 21:24:39,332 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 21:24:39,334 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 21:24:39,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 21:24:39,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 21:24:39,339 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 21:24:39,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 21:24:39,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 21:24:39,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 21:24:39,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 21:24:39,343 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 21:24:39,344 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 21:24:39,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 21:24:39,347 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 21:24:39,347 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 21:24:39,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 21:24:39,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 21:24:39,349 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 21:24:39,351 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 21:24:39,352 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 21:24:39,354 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 21:24:39,376 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 21:24:39,376 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 21:24:39,378 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 21:24:39,379 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 21:24:39,379 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 21:24:39,379 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 21:24:39,380 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 21:24:39,380 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 21:24:39,380 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 21:24:39,380 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 21:24:39,382 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 21:24:39,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 21:24:39,382 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 21:24:39,383 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 21:24:39,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 21:24:39,383 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 21:24:39,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 21:24:39,384 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 21:24:39,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 21:24:39,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 21:24:39,385 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 21:24:39,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 21:24:39,385 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 21:24:39,386 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 21:24:39,386 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 21:24:39,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 21:24:39,386 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 21:24:39,387 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 21:24:39,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 21:24:39,387 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 21:24:39,387 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 21:24:39,389 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 21:24:39,390 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 21:24:39,391 INFO L138 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-11-28 21:24:39,716 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 21:24:39,730 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 21:24:39,734 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 21:24:39,735 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 21:24:39,736 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 21:24:39,737 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/rangesum.i [2019-11-28 21:24:39,806 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5283060e5/5839fef33db94642bf5a4f288acbf943/FLAG47896d81b [2019-11-28 21:24:40,295 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 21:24:40,296 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum.i [2019-11-28 21:24:40,302 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5283060e5/5839fef33db94642bf5a4f288acbf943/FLAG47896d81b [2019-11-28 21:24:40,682 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5283060e5/5839fef33db94642bf5a4f288acbf943 [2019-11-28 21:24:40,686 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 21:24:40,690 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 21:24:40,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 21:24:40,692 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 21:24:40,695 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 21:24:40,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:24:40" (1/1) ... [2019-11-28 21:24:40,700 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@569619e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:24:40, skipping insertion in model container [2019-11-28 21:24:40,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:24:40" (1/1) ... [2019-11-28 21:24:40,710 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 21:24:40,739 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 21:24:41,008 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:24:41,020 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 21:24:41,116 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:24:41,131 INFO L208 MainTranslator]: Completed translation [2019-11-28 21:24:41,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:24:41 WrapperNode [2019-11-28 21:24:41,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 21:24:41,132 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 21:24:41,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 21:24:41,133 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 21:24:41,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:24:41" (1/1) ... [2019-11-28 21:24:41,148 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:24:41" (1/1) ... [2019-11-28 21:24:41,179 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 21:24:41,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 21:24:41,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 21:24:41,180 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 21:24:41,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:24:41" (1/1) ... [2019-11-28 21:24:41,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:24:41" (1/1) ... [2019-11-28 21:24:41,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:24:41" (1/1) ... [2019-11-28 21:24:41,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:24:41" (1/1) ... [2019-11-28 21:24:41,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:24:41" (1/1) ... [2019-11-28 21:24:41,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:24:41" (1/1) ... [2019-11-28 21:24:41,216 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:24:41" (1/1) ... [2019-11-28 21:24:41,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 21:24:41,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 21:24:41,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 21:24:41,220 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 21:24:41,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:24:41" (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-11-28 21:24:41,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 21:24:41,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 21:24:41,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 21:24:41,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 21:24:41,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 21:24:41,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 21:24:41,630 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 21:24:41,631 INFO L287 CfgBuilder]: Removed 17 assume(true) statements. [2019-11-28 21:24:41,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:24:41 BoogieIcfgContainer [2019-11-28 21:24:41,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 21:24:41,633 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 21:24:41,633 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 21:24:41,638 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 21:24:41,639 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:24:41,639 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 09:24:40" (1/3) ... [2019-11-28 21:24:41,641 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28a6c23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:24:41, skipping insertion in model container [2019-11-28 21:24:41,641 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:24:41,641 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:24:41" (2/3) ... [2019-11-28 21:24:41,642 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28a6c23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:24:41, skipping insertion in model container [2019-11-28 21:24:41,642 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:24:41,643 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:24:41" (3/3) ... [2019-11-28 21:24:41,645 INFO L371 chiAutomizerObserver]: Analyzing ICFG rangesum.i [2019-11-28 21:24:41,702 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 21:24:41,702 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 21:24:41,702 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 21:24:41,702 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 21:24:41,703 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 21:24:41,703 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 21:24:41,703 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 21:24:41,703 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 21:24:41,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2019-11-28 21:24:41,746 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-11-28 21:24:41,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:24:41,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:24:41,754 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 21:24:41,755 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:24:41,755 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 21:24:41,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2019-11-28 21:24:41,758 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-11-28 21:24:41,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:24:41,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:24:41,760 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 21:24:41,760 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:24:41,768 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~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-11-28 21:24:41,769 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-11-28 21:24:41,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:41,776 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-11-28 21:24:41,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:41,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926188783] [2019-11-28 21:24:41,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:41,912 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:24:41,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:41,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1379, now seen corresponding path program 1 times [2019-11-28 21:24:41,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:41,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080436837] [2019-11-28 21:24:41,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:41,932 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:24:41,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:41,934 INFO L82 PathProgramCache]: Analyzing trace with hash 28693956, now seen corresponding path program 1 times [2019-11-28 21:24:41,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:41,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506353582] [2019-11-28 21:24:41,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:41,973 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:24:42,199 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-28 21:24:42,260 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:24:42,261 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:24:42,261 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:24:42,261 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:24:42,262 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:24:42,262 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:42,262 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:24:42,262 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:24:42,262 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration1_Lasso [2019-11-28 21:24:42,263 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:24:42,263 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:24:42,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:42,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:42,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:42,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:42,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:42,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:42,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:42,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:42,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:42,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:42,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:42,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:42,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:42,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:42,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:42,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:42,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:42,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:42,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:42,798 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:24:42,803 INFO L489 LassoAnalysis]: Using template 'affine'. 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-11-28 21:24:42,814 INFO L120 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-11-28 21:24:42,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:42,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:24:42,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:42,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:42,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:42,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:24:42,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:24:42,824 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. 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) [2019-11-28 21:24:42,841 INFO L120 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-11-28 21:24:42,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:42,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:24:42,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:42,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:42,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:42,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:24:42,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:42,851 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. 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) [2019-11-28 21:24:42,870 INFO L120 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-11-28 21:24:42,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:42,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:24:42,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:42,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:42,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:42,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:24:42,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:42,877 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:24:42,893 INFO L120 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-11-28 21:24:42,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:42,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:24:42,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:42,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:42,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:42,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:24:42,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:42,903 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:24:42,920 INFO L120 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-11-28 21:24:42,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:42,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:24:42,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:42,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:42,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:42,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:24:42,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:42,928 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:24:42,945 INFO L120 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-11-28 21:24:42,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:42,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:24:42,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:42,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:42,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:42,949 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:24:42,950 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:42,952 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:24:42,969 INFO L120 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-11-28 21:24:42,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:42,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:42,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:42,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:42,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:24:42,980 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:42,985 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:24:43,004 INFO L120 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-11-28 21:24:43,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:43,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:43,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:43,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:43,017 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:24:43,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:24:43,028 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:24:43,047 INFO L120 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-11-28 21:24:43,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:43,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:24:43,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:43,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:43,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:43,052 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:24:43,052 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:43,056 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:24:43,072 INFO L120 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 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:43,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:43,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:43,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:43,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:43,097 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:24:43,097 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:24:43,115 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:24:43,206 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-11-28 21:24:43,206 INFO L444 ModelExtractionUtils]: 11 out of 25 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:43,219 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:24:43,225 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 21:24:43,225 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:24:43,226 INFO L512 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-11-28 21:24:43,246 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-28 21:24:43,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:24:43,309 INFO L264 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 21:24:43,311 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:24:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:24:43,332 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:24:43,334 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:24:43,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:24:43,373 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-11-28 21:24:43,375 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states. Second operand 3 states. [2019-11-28 21:24:43,546 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-11-28 21:24:43,547 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-11-28 21:24:43,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 21:24:43,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2019-11-28 21:24:43,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-28 21:24:43,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:24:43,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-28 21:24:43,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:24:43,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 3 letters. Loop has 4 letters. [2019-11-28 21:24:43,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:24:43,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 130 transitions. [2019-11-28 21:24:43,581 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-28 21:24:43,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 23 states and 33 transitions. [2019-11-28 21:24:43,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-28 21:24:43,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-28 21:24:43,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 33 transitions. [2019-11-28 21:24:43,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:24:43,596 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2019-11-28 21:24:43,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 33 transitions. [2019-11-28 21:24:43,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-28 21:24:43,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 21:24:43,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2019-11-28 21:24:43,632 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2019-11-28 21:24:43,632 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2019-11-28 21:24:43,632 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 21:24:43,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 33 transitions. [2019-11-28 21:24:43,635 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-28 21:24:43,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:24:43,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:24:43,636 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 21:24:43,636 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 21:24:43,636 INFO L794 eck$LassoCheckResult]: Stem: 190#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~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-11-28 21:24:43,637 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-11-28 21:24:43,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:43,637 INFO L82 PathProgramCache]: Analyzing trace with hash 28693898, now seen corresponding path program 1 times [2019-11-28 21:24:43,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:43,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997236249] [2019-11-28 21:24:43,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:24:43,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:24:43,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997236249] [2019-11-28 21:24:43,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:24:43,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:24:43,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905654756] [2019-11-28 21:24:43,746 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:24:43,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:43,747 INFO L82 PathProgramCache]: Analyzing trace with hash 56764, now seen corresponding path program 1 times [2019-11-28 21:24:43,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:43,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4216043] [2019-11-28 21:24:43,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:43,766 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:24:43,790 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:24:43,790 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:24:43,790 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:24:43,791 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:24:43,791 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 21:24:43,791 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:43,791 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:24:43,791 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:24:43,791 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration2_Loop [2019-11-28 21:24:43,791 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:24:43,796 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:24:43,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:43,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:43,922 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:24:43,925 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:24:43,943 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:24:43,943 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:43,951 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:24:43,951 INFO L440 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:24:43,968 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:24:43,969 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:43,993 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 21:24:43,993 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:24:44,267 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 21:24:44,275 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:24:44,276 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:24:44,276 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:24:44,276 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:24:44,276 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:24:44,276 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:44,276 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:24:44,276 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:24:44,277 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration2_Loop [2019-11-28 21:24:44,277 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:24:44,277 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:24:44,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:44,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:44,471 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:24:44,474 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:44,484 INFO L120 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-11-28 21:24:44,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:44,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:24:44,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:44,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:44,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:44,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:24:44,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:24:44,490 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:44,503 INFO L120 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-11-28 21:24:44,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:44,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:24:44,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:44,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:44,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:44,511 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:24:44,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:24:44,515 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:24:44,520 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 21:24:44,521 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:44,554 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:24:44,555 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 21:24:44,555 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:24:44,555 INFO L512 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-11-28 21:24:44,559 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 21:24:44,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:24:44,591 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 21:24:44,592 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:24:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:24:44,597 WARN L262 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 21:24:44,598 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:24:44,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:24:44,645 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-11-28 21:24:44,645 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 33 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-11-28 21:24:44,693 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-11-28 21:24:44,694 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-11-28 21:24:44,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 21:24:44,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-11-28 21:24:44,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-28 21:24:44,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:24:44,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-28 21:24:44,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:24:44,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-28 21:24:44,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:24:44,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 53 transitions. [2019-11-28 21:24:44,698 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-28 21:24:44,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 46 transitions. [2019-11-28 21:24:44,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-28 21:24:44,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-28 21:24:44,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 46 transitions. [2019-11-28 21:24:44,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:24:44,702 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-11-28 21:24:44,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 46 transitions. [2019-11-28 21:24:44,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-11-28 21:24:44,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 21:24:44,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2019-11-28 21:24:44,706 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2019-11-28 21:24:44,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:24:44,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 21:24:44,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 21:24:44,712 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. Second operand 3 states. [2019-11-28 21:24:44,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:24:44,758 INFO L93 Difference]: Finished difference Result 30 states and 43 transitions. [2019-11-28 21:24:44,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 21:24:44,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 43 transitions. [2019-11-28 21:24:44,761 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-28 21:24:44,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 43 transitions. [2019-11-28 21:24:44,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-28 21:24:44,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-28 21:24:44,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 43 transitions. [2019-11-28 21:24:44,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:24:44,763 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2019-11-28 21:24:44,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 43 transitions. [2019-11-28 21:24:44,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-11-28 21:24:44,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 21:24:44,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2019-11-28 21:24:44,766 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2019-11-28 21:24:44,766 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2019-11-28 21:24:44,766 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 21:24:44,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 42 transitions. [2019-11-28 21:24:44,768 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-28 21:24:44,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:24:44,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:24:44,768 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:24:44,769 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 21:24:44,769 INFO L794 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~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-11-28 21:24:44,769 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-11-28 21:24:44,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:44,770 INFO L82 PathProgramCache]: Analyzing trace with hash 123162479, now seen corresponding path program 1 times [2019-11-28 21:24:44,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:44,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870262809] [2019-11-28 21:24:44,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:24:44,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:24:44,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870262809] [2019-11-28 21:24:44,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709901600] [2019-11-28 21:24:44,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:24:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:24:44,864 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:24:44,865 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:24:44,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:24:44,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:24:44,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-28 21:24:44,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433918938] [2019-11-28 21:24:44,897 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:24:44,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:44,898 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 1 times [2019-11-28 21:24:44,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:44,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939188246] [2019-11-28 21:24:44,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:44,915 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:24:44,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:24:44,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 21:24:44,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 21:24:44,971 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. cyclomatic complexity: 19 Second operand 6 states. [2019-11-28 21:24:45,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:24:45,040 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2019-11-28 21:24:45,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 21:24:45,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2019-11-28 21:24:45,041 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-28 21:24:45,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 45 transitions. [2019-11-28 21:24:45,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-28 21:24:45,042 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-28 21:24:45,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 45 transitions. [2019-11-28 21:24:45,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:24:45,043 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 45 transitions. [2019-11-28 21:24:45,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 45 transitions. [2019-11-28 21:24:45,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-11-28 21:24:45,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 21:24:45,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2019-11-28 21:24:45,047 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2019-11-28 21:24:45,047 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2019-11-28 21:24:45,047 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 21:24:45,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. [2019-11-28 21:24:45,048 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-28 21:24:45,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:24:45,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:24:45,049 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 21:24:45,049 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 21:24:45,049 INFO L794 eck$LassoCheckResult]: Stem: 453#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~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-11-28 21:24:45,049 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-11-28 21:24:45,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:45,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1898228851, now seen corresponding path program 2 times [2019-11-28 21:24:45,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:45,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346366938] [2019-11-28 21:24:45,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:45,081 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:24:45,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:45,082 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 2 times [2019-11-28 21:24:45,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:45,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435870114] [2019-11-28 21:24:45,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:45,104 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:24:45,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:45,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1698716202, now seen corresponding path program 1 times [2019-11-28 21:24:45,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:45,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019056261] [2019-11-28 21:24:45,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:24:45,221 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:24:45,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019056261] [2019-11-28 21:24:45,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702080653] [2019-11-28 21:24:45,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:24:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:24:45,269 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 21:24:45,271 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:24:45,301 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 21:24:45,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 21:24:45,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2019-11-28 21:24:45,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705487113] [2019-11-28 21:24:45,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:24:45,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 21:24:45,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-28 21:24:45,357 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. cyclomatic complexity: 19 Second operand 4 states. [2019-11-28 21:24:45,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:24:45,427 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-11-28 21:24:45,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 21:24:45,428 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2019-11-28 21:24:45,429 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-28 21:24:45,429 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 50 transitions. [2019-11-28 21:24:45,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-28 21:24:45,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-28 21:24:45,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. [2019-11-28 21:24:45,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:24:45,431 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-11-28 21:24:45,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. [2019-11-28 21:24:45,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-11-28 21:24:45,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 21:24:45,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2019-11-28 21:24:45,434 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2019-11-28 21:24:45,434 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2019-11-28 21:24:45,434 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 21:24:45,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 47 transitions. [2019-11-28 21:24:45,436 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-28 21:24:45,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:24:45,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:24:45,439 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:24:45,439 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 21:24:45,440 INFO L794 eck$LassoCheckResult]: Stem: 577#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 573#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; 574#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; 580#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; 558#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 559#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; 582#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 583#L7-3 assume !(init_nondet_~i~0 < ~N~0); 560#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; 550#L18-3 assume !!(rangesum_~i~1 < ~N~0); 551#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 571#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 584#L18-3 assume !!(rangesum_~i~1 < ~N~0); 570#L19 [2019-11-28 21:24:45,440 INFO L796 eck$LassoCheckResult]: Loop: 570#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; 563#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 564#L18-3 assume !!(rangesum_~i~1 < ~N~0); 570#L19 [2019-11-28 21:24:45,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:45,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1698718124, now seen corresponding path program 1 times [2019-11-28 21:24:45,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:45,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680640669] [2019-11-28 21:24:45,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:45,502 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:24:45,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:45,503 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 3 times [2019-11-28 21:24:45,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:45,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475985653] [2019-11-28 21:24:45,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:45,524 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:24:45,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:45,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1087986773, now seen corresponding path program 1 times [2019-11-28 21:24:45,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:45,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771841981] [2019-11-28 21:24:45,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:24:45,622 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 21:24:45,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771841981] [2019-11-28 21:24:45,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768715364] [2019-11-28 21:24:45,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:24:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:24:45,673 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 21:24:45,675 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:24:45,742 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:24:45,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:24:45,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2019-11-28 21:24:45,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930193637] [2019-11-28 21:24:45,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:24:45,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 21:24:45,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-11-28 21:24:45,790 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. cyclomatic complexity: 17 Second operand 12 states. [2019-11-28 21:24:46,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:24:46,147 INFO L93 Difference]: Finished difference Result 91 states and 115 transitions. [2019-11-28 21:24:46,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 21:24:46,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 115 transitions. [2019-11-28 21:24:46,150 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 17 [2019-11-28 21:24:46,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 77 states and 99 transitions. [2019-11-28 21:24:46,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2019-11-28 21:24:46,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2019-11-28 21:24:46,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 99 transitions. [2019-11-28 21:24:46,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:24:46,152 INFO L688 BuchiCegarLoop]: Abstraction has 77 states and 99 transitions. [2019-11-28 21:24:46,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 99 transitions. [2019-11-28 21:24:46,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2019-11-28 21:24:46,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-28 21:24:46,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2019-11-28 21:24:46,157 INFO L711 BuchiCegarLoop]: Abstraction has 60 states and 78 transitions. [2019-11-28 21:24:46,157 INFO L591 BuchiCegarLoop]: Abstraction has 60 states and 78 transitions. [2019-11-28 21:24:46,157 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 21:24:46,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 78 transitions. [2019-11-28 21:24:46,158 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-11-28 21:24:46,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:24:46,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:24:46,159 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:24:46,159 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 21:24:46,160 INFO L794 eck$LassoCheckResult]: Stem: 780#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 775#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; 776#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; 782#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; 759#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 760#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; 783#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 801#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; 800#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 798#L7-3 assume !(init_nondet_~i~0 < ~N~0); 799#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; 806#L18-3 assume !!(rangesum_~i~1 < ~N~0); 773#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 766#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 767#L18-3 assume !!(rangesum_~i~1 < ~N~0); 796#L19 [2019-11-28 21:24:46,160 INFO L796 eck$LassoCheckResult]: Loop: 796#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; 797#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 795#L18-3 assume !!(rangesum_~i~1 < ~N~0); 796#L19 [2019-11-28 21:24:46,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:46,160 INFO L82 PathProgramCache]: Analyzing trace with hash -154124210, now seen corresponding path program 2 times [2019-11-28 21:24:46,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:46,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433523762] [2019-11-28 21:24:46,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:46,211 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:24:46,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:46,214 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 4 times [2019-11-28 21:24:46,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:46,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153951260] [2019-11-28 21:24:46,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:46,238 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:24:46,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:46,239 INFO L82 PathProgramCache]: Analyzing trace with hash -194270775, now seen corresponding path program 2 times [2019-11-28 21:24:46,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:46,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724890529] [2019-11-28 21:24:46,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:24:46,376 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:24:46,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724890529] [2019-11-28 21:24:46,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470379678] [2019-11-28 21:24:46,376 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:24:46,427 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 21:24:46,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 21:24:46,428 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 21:24:46,430 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:24:46,649 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:24:46,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:24:46,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2019-11-28 21:24:46,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352821863] [2019-11-28 21:24:46,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:24:46,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 21:24:46,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-11-28 21:24:46,710 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. cyclomatic complexity: 25 Second operand 16 states. [2019-11-28 21:24:47,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:24:47,587 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2019-11-28 21:24:47,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 21:24:47,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 148 transitions. [2019-11-28 21:24:47,590 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 21 [2019-11-28 21:24:47,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 116 states and 142 transitions. [2019-11-28 21:24:47,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2019-11-28 21:24:47,592 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2019-11-28 21:24:47,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 142 transitions. [2019-11-28 21:24:47,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:24:47,593 INFO L688 BuchiCegarLoop]: Abstraction has 116 states and 142 transitions. [2019-11-28 21:24:47,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 142 transitions. [2019-11-28 21:24:47,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 102. [2019-11-28 21:24:47,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-28 21:24:47,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 128 transitions. [2019-11-28 21:24:47,601 INFO L711 BuchiCegarLoop]: Abstraction has 102 states and 128 transitions. [2019-11-28 21:24:47,601 INFO L591 BuchiCegarLoop]: Abstraction has 102 states and 128 transitions. [2019-11-28 21:24:47,601 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 21:24:47,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 128 transitions. [2019-11-28 21:24:47,603 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 21 [2019-11-28 21:24:47,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:24:47,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:24:47,604 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1] [2019-11-28 21:24:47,604 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 21:24:47,604 INFO L794 eck$LassoCheckResult]: Stem: 1068#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 1064#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; 1065#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; 1073#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; 1076#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1077#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; 1048#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1049#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; 1116#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1115#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; 1087#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1085#L7-3 assume !(init_nondet_~i~0 < ~N~0); 1086#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; 1117#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1060#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1061#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1043#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1044#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1109#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1098#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1101#L19 [2019-11-28 21:24:47,604 INFO L796 eck$LassoCheckResult]: Loop: 1101#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; 1102#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1103#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1101#L19 [2019-11-28 21:24:47,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:47,605 INFO L82 PathProgramCache]: Analyzing trace with hash -326653975, now seen corresponding path program 3 times [2019-11-28 21:24:47,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:47,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505798144] [2019-11-28 21:24:47,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:47,636 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:24:47,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:47,637 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 5 times [2019-11-28 21:24:47,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:47,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012782263] [2019-11-28 21:24:47,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:47,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:47,645 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:24:47,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:47,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1047353422, now seen corresponding path program 3 times [2019-11-28 21:24:47,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:47,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000118358] [2019-11-28 21:24:47,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:24:47,725 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 21:24:47,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000118358] [2019-11-28 21:24:47,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251715048] [2019-11-28 21:24:47,727 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:24:47,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 21:24:47,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 21:24:47,776 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 21:24:47,778 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:24:47,902 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 21:24:47,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:24:47,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2019-11-28 21:24:47,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446022547] [2019-11-28 21:24:47,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:24:47,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 21:24:47,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-11-28 21:24:47,959 INFO L87 Difference]: Start difference. First operand 102 states and 128 transitions. cyclomatic complexity: 37 Second operand 16 states. [2019-11-28 21:24:49,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:24:49,118 INFO L93 Difference]: Finished difference Result 278 states and 345 transitions. [2019-11-28 21:24:49,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-11-28 21:24:49,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 278 states and 345 transitions. [2019-11-28 21:24:49,122 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 49 [2019-11-28 21:24:49,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 278 states to 263 states and 329 transitions. [2019-11-28 21:24:49,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 219 [2019-11-28 21:24:49,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 219 [2019-11-28 21:24:49,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 263 states and 329 transitions. [2019-11-28 21:24:49,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:24:49,126 INFO L688 BuchiCegarLoop]: Abstraction has 263 states and 329 transitions. [2019-11-28 21:24:49,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states and 329 transitions. [2019-11-28 21:24:49,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 112. [2019-11-28 21:24:49,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-28 21:24:49,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2019-11-28 21:24:49,137 INFO L711 BuchiCegarLoop]: Abstraction has 112 states and 139 transitions. [2019-11-28 21:24:49,137 INFO L591 BuchiCegarLoop]: Abstraction has 112 states and 139 transitions. [2019-11-28 21:24:49,137 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 21:24:49,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 139 transitions. [2019-11-28 21:24:49,138 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 21 [2019-11-28 21:24:49,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:24:49,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:24:49,139 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:24:49,139 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 21:24:49,140 INFO L794 eck$LassoCheckResult]: Stem: 1604#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 1600#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; 1601#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; 1608#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; 1610#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1611#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; 1612#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1622#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; 1587#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1588#L7-3 assume !(init_nondet_~i~0 < ~N~0); 1589#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; 1590#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1644#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1642#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1582#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1583#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1592#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1593#L18-3 assume !(rangesum_~i~1 < ~N~0); 1581#L18-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 1594#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; 1595#L18-8 assume !!(rangesum_~i~1 < ~N~0); 1688#L19-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1687#L18-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1603#L18-8 assume !!(rangesum_~i~1 < ~N~0); 1596#L19-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1597#L18-7 [2019-11-28 21:24:49,140 INFO L796 eck$LassoCheckResult]: Loop: 1597#L18-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1605#L18-8 assume !!(rangesum_~i~1 < ~N~0); 1689#L19-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1597#L18-7 [2019-11-28 21:24:49,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:49,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1740406288, now seen corresponding path program 1 times [2019-11-28 21:24:49,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:49,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765104635] [2019-11-28 21:24:49,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:24:49,279 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 21:24:49,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765104635] [2019-11-28 21:24:49,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769815680] [2019-11-28 21:24:49,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:24:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:24:49,342 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 21:24:49,345 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:24:49,440 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 21:24:49,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:24:49,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-11-28 21:24:49,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148995473] [2019-11-28 21:24:49,442 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:24:49,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:49,443 INFO L82 PathProgramCache]: Analyzing trace with hash 88159, now seen corresponding path program 1 times [2019-11-28 21:24:49,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:49,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340173652] [2019-11-28 21:24:49,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:49,456 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:24:49,476 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:24:49,477 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:24:49,477 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:24:49,477 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:24:49,477 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 21:24:49,477 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:49,477 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:24:49,477 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:24:49,477 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration8_Loop [2019-11-28 21:24:49,477 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:24:49,477 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:24:49,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:49,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:49,565 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:24:49,565 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:24:49,574 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:24:49,574 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:49,579 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 21:24:49,580 INFO L440 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:24:49,591 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:24:49,591 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:24:49,608 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 21:24:49,609 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:50,145 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 21:24:50,148 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:24:50,148 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:24:50,149 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:24:50,149 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:24:50,149 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:24:50,149 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:50,149 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:24:50,149 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:24:50,149 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration8_Loop [2019-11-28 21:24:50,149 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:24:50,149 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:24:50,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:50,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:50,244 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:24:50,244 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:24:50,257 INFO L120 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-11-28 21:24:50,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:50,259 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:24:50,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:50,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:50,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:50,260 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:24:50,260 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:50,262 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:50,267 INFO L120 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-11-28 21:24:50,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:50,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:24:50,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:50,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:50,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:50,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:24:50,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:24:50,273 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:24:50,277 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-28 21:24:50,277 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:50,281 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:24:50,281 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 21:24:50,281 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:24:50,282 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, ULTIMATE.start_rangesum_~i~1) = 1*~N~0 - 2*ULTIMATE.start_rangesum_~i~1 Supporting invariants [] [2019-11-28 21:24:50,283 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 21:24:50,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:50,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:24:50,315 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 21:24:50,316 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:24:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:24:50,321 WARN L262 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 21:24:50,322 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:24:50,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:24:50,342 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-11-28 21:24:50,342 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 139 transitions. cyclomatic complexity: 38 Second operand 4 states. [2019-11-28 21:24:50,397 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 139 transitions. cyclomatic complexity: 38. Second operand 4 states. Result 144 states and 182 transitions. Complement of second has 7 states. [2019-11-28 21:24:50,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 21:24:50,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 21:24:50,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2019-11-28 21:24:50,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-28 21:24:50,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:24:50,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 28 letters. Loop has 3 letters. [2019-11-28 21:24:50,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:24:50,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 25 letters. Loop has 6 letters. [2019-11-28 21:24:50,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:24:50,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 182 transitions. [2019-11-28 21:24:50,401 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 18 [2019-11-28 21:24:50,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 121 states and 150 transitions. [2019-11-28 21:24:50,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2019-11-28 21:24:50,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2019-11-28 21:24:50,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 150 transitions. [2019-11-28 21:24:50,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:24:50,403 INFO L688 BuchiCegarLoop]: Abstraction has 121 states and 150 transitions. [2019-11-28 21:24:50,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 150 transitions. [2019-11-28 21:24:50,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116. [2019-11-28 21:24:50,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-28 21:24:50,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2019-11-28 21:24:50,409 INFO L711 BuchiCegarLoop]: Abstraction has 116 states and 143 transitions. [2019-11-28 21:24:50,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:24:50,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 21:24:50,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-11-28 21:24:50,410 INFO L87 Difference]: Start difference. First operand 116 states and 143 transitions. Second operand 15 states. [2019-11-28 21:24:50,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:24:50,795 INFO L93 Difference]: Finished difference Result 148 states and 175 transitions. [2019-11-28 21:24:50,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 21:24:50,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 175 transitions. [2019-11-28 21:24:50,797 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 20 [2019-11-28 21:24:50,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 148 states and 175 transitions. [2019-11-28 21:24:50,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2019-11-28 21:24:50,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2019-11-28 21:24:50,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 175 transitions. [2019-11-28 21:24:50,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:24:50,799 INFO L688 BuchiCegarLoop]: Abstraction has 148 states and 175 transitions. [2019-11-28 21:24:50,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 175 transitions. [2019-11-28 21:24:50,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 117. [2019-11-28 21:24:50,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-28 21:24:50,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 140 transitions. [2019-11-28 21:24:50,808 INFO L711 BuchiCegarLoop]: Abstraction has 117 states and 140 transitions. [2019-11-28 21:24:50,808 INFO L591 BuchiCegarLoop]: Abstraction has 117 states and 140 transitions. [2019-11-28 21:24:50,808 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 21:24:50,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 140 transitions. [2019-11-28 21:24:50,809 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 18 [2019-11-28 21:24:50,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:24:50,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:24:50,810 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 3, 1, 1, 1, 1, 1] [2019-11-28 21:24:50,810 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 21:24:50,811 INFO L794 eck$LassoCheckResult]: Stem: 2340#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 2335#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; 2336#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; 2345#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; 2347#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2382#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; 2381#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2379#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; 2380#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2412#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; 2317#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2318#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; 2350#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2348#L7-3 assume !(init_nondet_~i~0 < ~N~0); 2349#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; 2310#L18-3 assume !!(rangesum_~i~1 < ~N~0); 2311#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2410#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2408#L18-3 assume !!(rangesum_~i~1 < ~N~0); 2407#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2405#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2403#L18-3 assume !!(rangesum_~i~1 < ~N~0); 2402#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2401#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2399#L18-3 assume !!(rangesum_~i~1 < ~N~0); 2385#L19 [2019-11-28 21:24:50,811 INFO L796 eck$LassoCheckResult]: Loop: 2385#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; 2321#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2322#L18-3 assume !!(rangesum_~i~1 < ~N~0); 2385#L19 [2019-11-28 21:24:50,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:50,811 INFO L82 PathProgramCache]: Analyzing trace with hash -185017358, now seen corresponding path program 4 times [2019-11-28 21:24:50,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:50,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191417467] [2019-11-28 21:24:50,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:50,835 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:24:50,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:50,836 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 6 times [2019-11-28 21:24:50,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:50,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804387252] [2019-11-28 21:24:50,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:50,843 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:24:50,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:50,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1409041499, now seen corresponding path program 4 times [2019-11-28 21:24:50,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:50,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041536539] [2019-11-28 21:24:50,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:50,910 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:24:51,713 WARN L192 SmtUtils]: Spent 755.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 130 [2019-11-28 21:24:51,842 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-28 21:24:51,846 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:24:51,846 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:24:51,847 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:24:51,847 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:24:51,847 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:24:51,847 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:51,847 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:24:51,847 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:24:51,847 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration9_Lasso [2019-11-28 21:24:51,848 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:24:51,848 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:24:51,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:51,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:52,035 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-28 21:24:52,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:52,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:52,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:52,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:52,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:52,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:52,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:52,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:52,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:52,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:52,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:52,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:52,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:52,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:52,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:52,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:52,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:52,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:52,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:52,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:52,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:52,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:52,574 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:24:52,574 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:52,578 INFO L120 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-11-28 21:24:52,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:52,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:24:52,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:52,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:52,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:52,582 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:24:52,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:24:52,583 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:52,589 INFO L120 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-11-28 21:24:52,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:52,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:52,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:52,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:52,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:24:52,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:24:52,598 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:52,603 INFO L120 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-11-28 21:24:52,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:52,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:52,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:52,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:52,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:24:52,619 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:24:52,629 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:24:52,641 INFO L120 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-11-28 21:24:52,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:52,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:52,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:52,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:52,644 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:24:52,645 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:52,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:24:52,657 INFO L120 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-11-28 21:24:52,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:52,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:52,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:52,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:52,663 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:24:52,664 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:24:52,675 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:24:52,690 INFO L120 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 Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:52,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:24:52,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:24:52,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:24:52,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:24:52,700 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:24:52,700 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:24:52,725 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:24:52,795 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2019-11-28 21:24:52,795 INFO L444 ModelExtractionUtils]: 5 out of 37 variables were initially zero. Simplification set additionally 28 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:24:52,802 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:52,805 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 21:24:52,806 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:24:52,806 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1, ULTIMATE.start_rangesum_~x.offset, v_rep(select #length ULTIMATE.start_init_nondet_~x.base)_2) = -4*ULTIMATE.start_rangesum_~i~1 - 1*ULTIMATE.start_rangesum_~x.offset + 1*v_rep(select #length ULTIMATE.start_init_nondet_~x.base)_2 Supporting invariants [] [2019-11-28 21:24:52,823 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2019-11-28 21:24:52,826 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 21:24:52,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:24:52,876 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 21:24:52,879 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:24:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:24:52,902 INFO L264 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 21:24:52,903 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:24:52,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:24:52,950 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-11-28 21:24:52,950 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 140 transitions. cyclomatic complexity: 35 Second operand 6 states. [2019-11-28 21:24:53,032 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 117 states and 140 transitions. cyclomatic complexity: 35. Second operand 6 states. Result 149 states and 180 transitions. Complement of second has 9 states. [2019-11-28 21:24:53,036 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-11-28 21:24:53,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 21:24:53,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2019-11-28 21:24:53,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-28 21:24:53,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:24:53,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 28 letters. Loop has 3 letters. [2019-11-28 21:24:53,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:24:53,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 25 letters. Loop has 6 letters. [2019-11-28 21:24:53,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:24:53,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 180 transitions. [2019-11-28 21:24:53,042 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 15 [2019-11-28 21:24:53,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 118 states and 141 transitions. [2019-11-28 21:24:53,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2019-11-28 21:24:53,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2019-11-28 21:24:53,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 141 transitions. [2019-11-28 21:24:53,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:24:53,047 INFO L688 BuchiCegarLoop]: Abstraction has 118 states and 141 transitions. [2019-11-28 21:24:53,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 141 transitions. [2019-11-28 21:24:53,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-11-28 21:24:53,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-28 21:24:53,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 141 transitions. [2019-11-28 21:24:53,061 INFO L711 BuchiCegarLoop]: Abstraction has 118 states and 141 transitions. [2019-11-28 21:24:53,061 INFO L591 BuchiCegarLoop]: Abstraction has 118 states and 141 transitions. [2019-11-28 21:24:53,061 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 21:24:53,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 141 transitions. [2019-11-28 21:24:53,062 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 15 [2019-11-28 21:24:53,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:24:53,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:24:53,066 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:24:53,066 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:24:53,066 INFO L794 eck$LassoCheckResult]: Stem: 2747#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 2740#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; 2741#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; 2751#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; 2754#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2755#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; 2724#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2725#L7-3 assume !(init_nondet_~i~0 < ~N~0); 2758#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; 2770#L18-3 assume !!(rangesum_~i~1 < ~N~0); 2779#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2769#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2765#L18-3 assume !!(rangesum_~i~1 < ~N~0); 2760#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2761#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2781#L18-3 assume !(rangesum_~i~1 < ~N~0); 2780#L18-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 2778#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; 2777#L18-8 assume !!(rangesum_~i~1 < ~N~0); 2776#L19-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2775#L18-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2771#L18-8 assume !!(rangesum_~i~1 < ~N~0); 2768#L19-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2764#L18-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2763#L18-8 assume !(rangesum_~i~1 < ~N~0); 2739#L18-9 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 2720#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; 2721#L46-3 [2019-11-28 21:24:53,068 INFO L796 eck$LassoCheckResult]: Loop: 2721#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; 2750#L46-2 main_#t~post10 := main_~i~2;main_~i~2 := 1 + main_#t~post10;havoc main_#t~post10; 2721#L46-3 [2019-11-28 21:24:53,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:53,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1751120697, now seen corresponding path program 1 times [2019-11-28 21:24:53,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:53,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594345698] [2019-11-28 21:24:53,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:53,123 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:24:53,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:53,127 INFO L82 PathProgramCache]: Analyzing trace with hash 3427, now seen corresponding path program 1 times [2019-11-28 21:24:53,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:53,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339772552] [2019-11-28 21:24:53,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:53,138 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:24:53,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:24:53,138 INFO L82 PathProgramCache]: Analyzing trace with hash 800192681, now seen corresponding path program 1 times [2019-11-28 21:24:53,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:24:53,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808564444] [2019-11-28 21:24:53,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:24:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:24:53,180 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:24:53,829 WARN L192 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 150 [2019-11-28 21:24:54,089 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-11-28 21:24:54,327 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-11-28 21:24:54,542 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-11-28 21:24:54,650 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-28 21:24:54,652 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:24:54,652 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:24:54,652 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:24:54,652 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:24:54,652 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:24:54,652 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:24:54,652 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:24:54,652 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:24:54,652 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration10_Lasso [2019-11-28 21:24:54,653 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:24:54,653 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:24:54,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:54,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:54,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:54,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:54,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:54,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:54,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:54,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:54,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:54,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:54,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:24:54,725 FATAL L? ?]: 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.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.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:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) 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:957) 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:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) 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-11-28 21:24:54,730 INFO L168 Benchmark]: Toolchain (without parser) took 14039.17 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 309.9 MB). Free memory was 957.7 MB in the beginning and 852.8 MB in the end (delta: 104.9 MB). Peak memory consumption was 414.8 MB. Max. memory is 11.5 GB. [2019-11-28 21:24:54,731 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:24:54,731 INFO L168 Benchmark]: CACSL2BoogieTranslator took 440.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -155.5 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-11-28 21:24:54,732 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:24:54,732 INFO L168 Benchmark]: Boogie Preprocessor took 39.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:24:54,733 INFO L168 Benchmark]: RCFGBuilder took 412.90 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: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-11-28 21:24:54,733 INFO L168 Benchmark]: BuchiAutomizer took 13094.02 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 852.8 MB in the end (delta: 236.1 MB). Peak memory consumption was 416.5 MB. Max. memory is 11.5 GB. [2019-11-28 21:24:54,737 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 440.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -155.5 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 412.90 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: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13094.02 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 852.8 MB in the end (delta: 236.1 MB). Peak memory consumption was 416.5 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.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...