./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 30f4e4ab 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.24-30f4e4a [2019-11-28 03:52:12,588 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:52:12,591 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:52:12,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:52:12,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:52:12,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:52:12,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:52:12,609 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:52:12,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:52:12,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:52:12,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:52:12,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:52:12,615 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:52:12,616 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:52:12,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:52:12,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:52:12,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:52:12,620 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:52:12,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:52:12,624 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:52:12,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:52:12,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:52:12,628 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:52:12,629 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:52:12,632 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:52:12,632 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:52:12,632 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:52:12,633 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:52:12,634 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:52:12,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:52:12,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:52:12,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:52:12,637 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:52:12,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:52:12,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:52:12,639 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:52:12,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:52:12,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:52:12,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:52:12,642 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:52:12,642 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:52:12,643 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:52:12,661 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:52:12,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:52:12,664 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:52:12,665 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:52:12,665 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:52:12,666 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:52:12,666 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:52:12,666 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:52:12,666 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:52:12,667 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:52:12,668 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:52:12,668 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:52:12,668 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:52:12,669 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:52:12,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:52:12,669 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:52:12,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:52:12,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:52:12,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:52:12,671 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:52:12,671 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:52:12,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:52:12,671 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:52:12,672 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:52:12,672 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:52:12,672 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:52:12,673 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:52:12,673 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:52:12,673 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:52:12,673 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:52:12,674 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:52:12,676 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:52:12,676 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 03:52:12,996 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:52:13,013 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:52:13,018 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:52:13,020 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:52:13,020 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:52:13,021 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 03:52:13,102 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e4fed17d/0c762f7f42b3435ba84598dd75aff694/FLAG8e148e464 [2019-11-28 03:52:13,615 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:52:13,616 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum.i [2019-11-28 03:52:13,623 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e4fed17d/0c762f7f42b3435ba84598dd75aff694/FLAG8e148e464 [2019-11-28 03:52:13,970 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e4fed17d/0c762f7f42b3435ba84598dd75aff694 [2019-11-28 03:52:13,973 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:52:13,974 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:52:13,975 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:52:13,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:52:13,979 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:52:13,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:52:13" (1/1) ... [2019-11-28 03:52:13,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d50e01b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:13, skipping insertion in model container [2019-11-28 03:52:13,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:52:13" (1/1) ... [2019-11-28 03:52:13,991 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:52:14,020 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:52:14,220 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:52:14,230 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:52:14,252 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:52:14,267 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:52:14,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:14 WrapperNode [2019-11-28 03:52:14,267 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:52:14,268 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:52:14,269 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:52:14,269 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:52:14,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:14" (1/1) ... [2019-11-28 03:52:14,363 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:14" (1/1) ... [2019-11-28 03:52:14,411 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:52:14,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:52:14,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:52:14,412 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:52:14,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:14" (1/1) ... [2019-11-28 03:52:14,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:14" (1/1) ... [2019-11-28 03:52:14,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:14" (1/1) ... [2019-11-28 03:52:14,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:14" (1/1) ... [2019-11-28 03:52:14,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:14" (1/1) ... [2019-11-28 03:52:14,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:14" (1/1) ... [2019-11-28 03:52:14,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:14" (1/1) ... [2019-11-28 03:52:14,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:52:14,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:52:14,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:52:14,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:52:14,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:14" (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 03:52:14,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:52:14,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:52:14,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:52:14,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:52:14,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:52:14,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:52:14,927 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:52:14,928 INFO L297 CfgBuilder]: Removed 17 assume(true) statements. [2019-11-28 03:52:14,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:52:14 BoogieIcfgContainer [2019-11-28 03:52:14,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:52:14,930 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:52:14,931 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:52:14,934 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:52:14,935 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:52:14,935 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:52:13" (1/3) ... [2019-11-28 03:52:14,937 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3aacdd07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:52:14, skipping insertion in model container [2019-11-28 03:52:14,937 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:52:14,937 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:14" (2/3) ... [2019-11-28 03:52:14,937 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3aacdd07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:52:14, skipping insertion in model container [2019-11-28 03:52:14,938 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:52:14,938 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:52:14" (3/3) ... [2019-11-28 03:52:14,940 INFO L371 chiAutomizerObserver]: Analyzing ICFG rangesum.i [2019-11-28 03:52:14,989 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:52:14,990 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:52:14,990 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:52:14,990 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:52:14,991 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:52:14,991 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:52:14,991 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:52:14,991 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:52:15,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2019-11-28 03:52:15,033 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-11-28 03:52:15,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:15,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:15,042 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 03:52:15,042 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:15,043 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:52:15,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2019-11-28 03:52:15,046 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-11-28 03:52:15,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:15,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:15,047 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 03:52:15,047 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:15,056 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 03:52:15,057 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 03:52:15,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:15,064 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-11-28 03:52:15,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:15,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25440896] [2019-11-28 03:52:15,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:15,216 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:15,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:15,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1379, now seen corresponding path program 1 times [2019-11-28 03:52:15,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:15,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449074508] [2019-11-28 03:52:15,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:15,235 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:15,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:15,238 INFO L82 PathProgramCache]: Analyzing trace with hash 28693956, now seen corresponding path program 1 times [2019-11-28 03:52:15,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:15,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253978063] [2019-11-28 03:52:15,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:15,297 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:15,499 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-28 03:52:15,579 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:52:15,580 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:52:15,581 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:52:15,581 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:52:15,581 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:52:15,581 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:15,581 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:52:15,581 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:52:15,582 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration1_Lasso [2019-11-28 03:52:15,582 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:52:15,582 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:52:15,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:15,629 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 03:52:15,631 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 03:52:15,635 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 03:52:15,637 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 03:52:15,640 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 03:52:15,643 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 03:52:15,649 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 03:52:15,803 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 03:52:15,806 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 03:52:15,808 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 03:52:15,810 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 03:52:15,814 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 03:52:15,817 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 03:52:15,820 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 03:52:15,823 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 03:52:15,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:15,829 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 03:52:15,833 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 03:52:16,175 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:52:16,181 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) [2019-11-28 03:52:16,192 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 03:52:16,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:16,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:16,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:16,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:16,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:16,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:16,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:16,209 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 03:52:16,225 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 03:52:16,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:16,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:16,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:16,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:16,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:16,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:16,232 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 03:52:16,236 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 03:52:16,250 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 03:52:16,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:16,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:16,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:16,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:16,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:16,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:16,256 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 03:52:16,260 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 03:52:16,272 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 03:52:16,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:16,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:16,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:16,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:16,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:16,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:16,277 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 03:52:16,279 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 03:52:16,298 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 03:52:16,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:16,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:16,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:16,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:16,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:16,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:16,303 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 03:52:16,306 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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:16,316 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 03:52:16,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:16,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:16,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:16,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:16,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:16,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:16,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:16,323 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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:16,340 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 03:52:16,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:16,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:16,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:16,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:16,348 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:16,348 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:16,353 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 03:52:16,370 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 03:52:16,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:16,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:16,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:16,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:16,379 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:16,380 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:16,389 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:16,404 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 03:52:16,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:16,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:16,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:16,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:16,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:16,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:16,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:16,415 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 03:52:16,429 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 03:52:16,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:16,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:16,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:16,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:16,442 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:16,443 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:16,460 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:52:16,532 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-11-28 03:52:16,533 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) [2019-11-28 03:52:16,551 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:16,556 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:52:16,557 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:52:16,558 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 03:52:16,583 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-28 03:52:16,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:16,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:52:16,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:16,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:52:16,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:16,692 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 03:52:16,713 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 03:52:16,715 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states. Second operand 3 states. [2019-11-28 03:52:16,858 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 03:52:16,859 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 03:52:16,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:52:16,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2019-11-28 03:52:16,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-28 03:52:16,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:16,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-28 03:52:16,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:16,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 3 letters. Loop has 4 letters. [2019-11-28 03:52:16,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:16,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 130 transitions. [2019-11-28 03:52:16,887 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-28 03:52:16,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 23 states and 33 transitions. [2019-11-28 03:52:16,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-28 03:52:16,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-28 03:52:16,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 33 transitions. [2019-11-28 03:52:16,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:16,900 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2019-11-28 03:52:16,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 33 transitions. [2019-11-28 03:52:16,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-28 03:52:16,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 03:52:16,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2019-11-28 03:52:16,934 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2019-11-28 03:52:16,934 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2019-11-28 03:52:16,935 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:52:16,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 33 transitions. [2019-11-28 03:52:16,937 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-28 03:52:16,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:16,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:16,938 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:52:16,938 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:52:16,939 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 03:52:16,939 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 03:52:16,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:16,939 INFO L82 PathProgramCache]: Analyzing trace with hash 28693898, now seen corresponding path program 1 times [2019-11-28 03:52:16,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:16,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469189005] [2019-11-28 03:52:16,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:17,053 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 03:52:17,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469189005] [2019-11-28 03:52:17,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:52:17,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:52:17,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337302007] [2019-11-28 03:52:17,058 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:52:17,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:17,059 INFO L82 PathProgramCache]: Analyzing trace with hash 56764, now seen corresponding path program 1 times [2019-11-28 03:52:17,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:17,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296954438] [2019-11-28 03:52:17,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:17,095 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:17,118 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:52:17,118 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:52:17,119 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:52:17,119 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:52:17,119 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:52:17,119 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:17,119 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:52:17,120 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:52:17,123 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration2_Loop [2019-11-28 03:52:17,123 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:52:17,123 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:52:17,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 03:52:17,134 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 03:52:17,244 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:52:17,245 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 03:52:17,252 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:52:17,253 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 03:52:17,264 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:52:17,264 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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:17,334 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:52:17,334 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) [2019-11-28 03:52:17,381 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:52:17,381 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:17,609 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:52:17,612 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:52:17,612 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:52:17,612 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:52:17,612 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:52:17,612 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:52:17,613 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:17,613 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:52:17,613 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:52:17,613 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration2_Loop [2019-11-28 03:52:17,613 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:52:17,613 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:52:17,614 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 03:52:17,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:17,732 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:52:17,732 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) [2019-11-28 03:52:17,742 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 03:52:17,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:17,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:17,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:17,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:17,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:17,746 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:17,746 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:17,748 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) [2019-11-28 03:52:17,767 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 03:52:17,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:17,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:17,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:17,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:17,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:17,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:17,776 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:17,780 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:52:17,786 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 03:52:17,786 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) [2019-11-28 03:52:17,800 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:52:17,800 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:52:17,801 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:52:17,801 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 03:52:17,804 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:17,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:17,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:52:17,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:17,884 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:52:17,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:17,941 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 03:52:17,941 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 03:52:17,941 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 33 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-11-28 03:52:17,992 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 03:52:17,993 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 03:52:17,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:52:17,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-11-28 03:52:17,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-28 03:52:17,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:17,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-28 03:52:17,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:17,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-28 03:52:17,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:17,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 53 transitions. [2019-11-28 03:52:17,996 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-28 03:52:18,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 46 transitions. [2019-11-28 03:52:18,002 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-28 03:52:18,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-28 03:52:18,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 46 transitions. [2019-11-28 03:52:18,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:52:18,004 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-11-28 03:52:18,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 46 transitions. [2019-11-28 03:52:18,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-11-28 03:52:18,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 03:52:18,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2019-11-28 03:52:18,011 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2019-11-28 03:52:18,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:18,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:52:18,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:52:18,018 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. Second operand 3 states. [2019-11-28 03:52:18,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:18,075 INFO L93 Difference]: Finished difference Result 30 states and 43 transitions. [2019-11-28 03:52:18,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:52:18,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 43 transitions. [2019-11-28 03:52:18,077 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-28 03:52:18,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 43 transitions. [2019-11-28 03:52:18,079 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-28 03:52:18,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-28 03:52:18,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 43 transitions. [2019-11-28 03:52:18,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:52:18,080 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2019-11-28 03:52:18,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 43 transitions. [2019-11-28 03:52:18,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-11-28 03:52:18,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 03:52:18,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2019-11-28 03:52:18,085 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2019-11-28 03:52:18,085 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2019-11-28 03:52:18,086 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:52:18,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 42 transitions. [2019-11-28 03:52:18,087 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-28 03:52:18,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:18,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:18,091 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:18,092 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:52:18,092 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 03:52:18,092 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 03:52:18,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:18,093 INFO L82 PathProgramCache]: Analyzing trace with hash 123162479, now seen corresponding path program 1 times [2019-11-28 03:52:18,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:18,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181467200] [2019-11-28 03:52:18,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:18,145 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 03:52:18,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181467200] [2019-11-28 03:52:18,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736095184] [2019-11-28 03:52:18,146 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 03:52:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:18,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:52:18,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:18,230 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 03:52:18,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:52:18,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-28 03:52:18,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147142529] [2019-11-28 03:52:18,232 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:52:18,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:18,233 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 1 times [2019-11-28 03:52:18,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:18,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707950484] [2019-11-28 03:52:18,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:18,266 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:18,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:18,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 03:52:18,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 03:52:18,319 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. cyclomatic complexity: 19 Second operand 6 states. [2019-11-28 03:52:18,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:18,382 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2019-11-28 03:52:18,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:52:18,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2019-11-28 03:52:18,384 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-28 03:52:18,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 45 transitions. [2019-11-28 03:52:18,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-28 03:52:18,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-28 03:52:18,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 45 transitions. [2019-11-28 03:52:18,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:52:18,386 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 45 transitions. [2019-11-28 03:52:18,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 45 transitions. [2019-11-28 03:52:18,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-11-28 03:52:18,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 03:52:18,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2019-11-28 03:52:18,391 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2019-11-28 03:52:18,391 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2019-11-28 03:52:18,391 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:52:18,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. [2019-11-28 03:52:18,392 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-28 03:52:18,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:18,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:18,393 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:18,393 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:52:18,394 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 03:52:18,394 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 03:52:18,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:18,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1898228851, now seen corresponding path program 2 times [2019-11-28 03:52:18,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:18,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648725275] [2019-11-28 03:52:18,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:18,456 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:18,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:18,459 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 2 times [2019-11-28 03:52:18,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:18,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437317167] [2019-11-28 03:52:18,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:18,475 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:18,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:18,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1698716202, now seen corresponding path program 1 times [2019-11-28 03:52:18,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:18,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776054113] [2019-11-28 03:52:18,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:18,550 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 03:52:18,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776054113] [2019-11-28 03:52:18,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32330695] [2019-11-28 03:52:18,551 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 03:52:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:18,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 03:52:18,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:18,627 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 03:52:18,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 03:52:18,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2019-11-28 03:52:18,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635112933] [2019-11-28 03:52:18,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:18,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:52:18,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-28 03:52:18,674 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. cyclomatic complexity: 19 Second operand 4 states. [2019-11-28 03:52:18,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:18,741 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-11-28 03:52:18,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:52:18,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2019-11-28 03:52:18,743 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-28 03:52:18,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 50 transitions. [2019-11-28 03:52:18,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-28 03:52:18,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-28 03:52:18,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. [2019-11-28 03:52:18,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:52:18,745 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-11-28 03:52:18,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. [2019-11-28 03:52:18,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-11-28 03:52:18,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 03:52:18,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2019-11-28 03:52:18,749 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2019-11-28 03:52:18,749 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2019-11-28 03:52:18,749 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:52:18,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 47 transitions. [2019-11-28 03:52:18,751 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-28 03:52:18,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:18,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:18,753 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:18,754 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:52:18,754 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 03:52:18,754 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 03:52:18,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:18,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1698718124, now seen corresponding path program 1 times [2019-11-28 03:52:18,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:18,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600028475] [2019-11-28 03:52:18,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:18,829 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:18,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:18,829 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 3 times [2019-11-28 03:52:18,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:18,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955674673] [2019-11-28 03:52:18,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:18,850 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:18,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:18,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1087986773, now seen corresponding path program 1 times [2019-11-28 03:52:18,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:18,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183786410] [2019-11-28 03:52:18,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:18,919 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 03:52:18,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183786410] [2019-11-28 03:52:18,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018121514] [2019-11-28 03:52:18,919 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 03:52:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:18,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 03:52:18,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:19,047 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 03:52:19,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:52:19,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2019-11-28 03:52:19,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045529274] [2019-11-28 03:52:19,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:19,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 03:52:19,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-11-28 03:52:19,094 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. cyclomatic complexity: 17 Second operand 12 states. [2019-11-28 03:52:19,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:19,434 INFO L93 Difference]: Finished difference Result 91 states and 115 transitions. [2019-11-28 03:52:19,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 03:52:19,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 115 transitions. [2019-11-28 03:52:19,436 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 17 [2019-11-28 03:52:19,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 77 states and 99 transitions. [2019-11-28 03:52:19,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2019-11-28 03:52:19,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2019-11-28 03:52:19,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 99 transitions. [2019-11-28 03:52:19,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:52:19,438 INFO L688 BuchiCegarLoop]: Abstraction has 77 states and 99 transitions. [2019-11-28 03:52:19,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 99 transitions. [2019-11-28 03:52:19,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2019-11-28 03:52:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-28 03:52:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2019-11-28 03:52:19,443 INFO L711 BuchiCegarLoop]: Abstraction has 60 states and 78 transitions. [2019-11-28 03:52:19,443 INFO L591 BuchiCegarLoop]: Abstraction has 60 states and 78 transitions. [2019-11-28 03:52:19,443 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:52:19,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 78 transitions. [2019-11-28 03:52:19,444 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-11-28 03:52:19,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:19,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:19,445 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:19,445 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:52:19,445 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 03:52:19,445 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 03:52:19,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:19,446 INFO L82 PathProgramCache]: Analyzing trace with hash -154124210, now seen corresponding path program 2 times [2019-11-28 03:52:19,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:19,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228165904] [2019-11-28 03:52:19,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:19,469 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:19,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:19,470 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 4 times [2019-11-28 03:52:19,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:19,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39911385] [2019-11-28 03:52:19,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:19,478 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:19,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:19,479 INFO L82 PathProgramCache]: Analyzing trace with hash -194270775, now seen corresponding path program 2 times [2019-11-28 03:52:19,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:19,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358958955] [2019-11-28 03:52:19,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:19,560 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 03:52:19,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358958955] [2019-11-28 03:52:19,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221971529] [2019-11-28 03:52:19,561 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 03:52:19,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 03:52:19,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:52:19,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 03:52:19,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:19,734 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 03:52:19,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:52:19,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2019-11-28 03:52:19,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967521096] [2019-11-28 03:52:19,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:19,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 03:52:19,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-11-28 03:52:19,786 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. cyclomatic complexity: 25 Second operand 16 states. [2019-11-28 03:52:20,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:20,532 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2019-11-28 03:52:20,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 03:52:20,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 148 transitions. [2019-11-28 03:52:20,534 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 21 [2019-11-28 03:52:20,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 116 states and 142 transitions. [2019-11-28 03:52:20,536 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2019-11-28 03:52:20,536 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2019-11-28 03:52:20,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 142 transitions. [2019-11-28 03:52:20,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:52:20,537 INFO L688 BuchiCegarLoop]: Abstraction has 116 states and 142 transitions. [2019-11-28 03:52:20,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 142 transitions. [2019-11-28 03:52:20,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 102. [2019-11-28 03:52:20,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-28 03:52:20,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 128 transitions. [2019-11-28 03:52:20,544 INFO L711 BuchiCegarLoop]: Abstraction has 102 states and 128 transitions. [2019-11-28 03:52:20,545 INFO L591 BuchiCegarLoop]: Abstraction has 102 states and 128 transitions. [2019-11-28 03:52:20,545 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:52:20,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 128 transitions. [2019-11-28 03:52:20,546 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 21 [2019-11-28 03:52:20,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:20,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:20,547 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1] [2019-11-28 03:52:20,547 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:52:20,547 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 03:52:20,547 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 03:52:20,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:20,548 INFO L82 PathProgramCache]: Analyzing trace with hash -326653975, now seen corresponding path program 3 times [2019-11-28 03:52:20,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:20,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688248555] [2019-11-28 03:52:20,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:20,605 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:20,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:20,606 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 5 times [2019-11-28 03:52:20,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:20,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095134262] [2019-11-28 03:52:20,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:20,617 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:20,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:20,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1047353422, now seen corresponding path program 3 times [2019-11-28 03:52:20,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:20,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556340131] [2019-11-28 03:52:20,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:20,731 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 03:52:20,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556340131] [2019-11-28 03:52:20,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347751348] [2019-11-28 03:52:20,732 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 03:52:20,781 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 03:52:20,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:52:20,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 03:52:20,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:20,909 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 03:52:20,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:52:20,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2019-11-28 03:52:20,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020187339] [2019-11-28 03:52:20,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:20,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 03:52:20,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-11-28 03:52:20,965 INFO L87 Difference]: Start difference. First operand 102 states and 128 transitions. cyclomatic complexity: 37 Second operand 16 states. [2019-11-28 03:52:22,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:22,159 INFO L93 Difference]: Finished difference Result 278 states and 345 transitions. [2019-11-28 03:52:22,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-11-28 03:52:22,160 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 278 states and 345 transitions. [2019-11-28 03:52:22,163 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 49 [2019-11-28 03:52:22,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 278 states to 263 states and 329 transitions. [2019-11-28 03:52:22,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 219 [2019-11-28 03:52:22,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 219 [2019-11-28 03:52:22,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 263 states and 329 transitions. [2019-11-28 03:52:22,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:52:22,167 INFO L688 BuchiCegarLoop]: Abstraction has 263 states and 329 transitions. [2019-11-28 03:52:22,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states and 329 transitions. [2019-11-28 03:52:22,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 112. [2019-11-28 03:52:22,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-28 03:52:22,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2019-11-28 03:52:22,176 INFO L711 BuchiCegarLoop]: Abstraction has 112 states and 139 transitions. [2019-11-28 03:52:22,176 INFO L591 BuchiCegarLoop]: Abstraction has 112 states and 139 transitions. [2019-11-28 03:52:22,176 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 03:52:22,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 139 transitions. [2019-11-28 03:52:22,177 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 21 [2019-11-28 03:52:22,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:22,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:22,179 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 03:52:22,179 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:52:22,179 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 03:52:22,180 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 03:52:22,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:22,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1740406288, now seen corresponding path program 1 times [2019-11-28 03:52:22,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:22,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815700345] [2019-11-28 03:52:22,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:22,316 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 03:52:22,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815700345] [2019-11-28 03:52:22,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836183903] [2019-11-28 03:52:22,317 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 03:52:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:22,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 03:52:22,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:22,472 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 03:52:22,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:52:22,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-11-28 03:52:22,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786300772] [2019-11-28 03:52:22,473 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:52:22,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:22,473 INFO L82 PathProgramCache]: Analyzing trace with hash 88159, now seen corresponding path program 1 times [2019-11-28 03:52:22,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:22,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385511747] [2019-11-28 03:52:22,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:22,485 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:22,503 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:52:22,503 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:52:22,503 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:52:22,503 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:52:22,503 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:52:22,504 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:22,504 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:52:22,504 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:52:22,504 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration8_Loop [2019-11-28 03:52:22,504 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:52:22,504 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:52:22,505 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 03:52:22,510 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 03:52:22,598 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:52:22,598 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 03:52:22,618 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:52:22,618 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 03:52:22,624 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:52:22,625 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) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:22,634 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:52:22,635 INFO L160 nArgumentSynthesizer]: Using integer mode. 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 03:52:22,648 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:52:22,649 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 03:52:23,179 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:52:23,182 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:52:23,182 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:52:23,182 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:52:23,182 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:52:23,182 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:52:23,182 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:23,183 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:52:23,183 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:52:23,183 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration8_Loop [2019-11-28 03:52:23,183 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:52:23,183 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:52:23,184 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 03:52:23,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:23,280 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:52:23,280 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) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:23,285 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 03:52:23,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:23,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:23,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:23,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:23,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:23,287 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:23,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:23,289 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 03:52:23,294 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 03:52:23,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:23,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:23,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:23,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:23,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:23,297 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:23,297 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:23,300 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:52:23,304 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-28 03:52:23,304 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 03:52:23,309 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:52:23,309 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:52:23,309 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:52:23,309 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 03:52:23,311 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 03:52:23,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:23,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:52:23,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:23,352 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:52:23,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:23,371 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 03:52:23,372 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 03:52:23,372 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 139 transitions. cyclomatic complexity: 38 Second operand 4 states. [2019-11-28 03:52:23,423 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 03:52:23,424 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 03:52:23,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:52:23,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2019-11-28 03:52:23,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-28 03:52:23,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:23,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 28 letters. Loop has 3 letters. [2019-11-28 03:52:23,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:23,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 25 letters. Loop has 6 letters. [2019-11-28 03:52:23,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:23,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 182 transitions. [2019-11-28 03:52:23,427 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 18 [2019-11-28 03:52:23,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 121 states and 150 transitions. [2019-11-28 03:52:23,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2019-11-28 03:52:23,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2019-11-28 03:52:23,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 150 transitions. [2019-11-28 03:52:23,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:52:23,429 INFO L688 BuchiCegarLoop]: Abstraction has 121 states and 150 transitions. [2019-11-28 03:52:23,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 150 transitions. [2019-11-28 03:52:23,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116. [2019-11-28 03:52:23,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-28 03:52:23,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2019-11-28 03:52:23,434 INFO L711 BuchiCegarLoop]: Abstraction has 116 states and 143 transitions. [2019-11-28 03:52:23,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:23,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 03:52:23,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-11-28 03:52:23,435 INFO L87 Difference]: Start difference. First operand 116 states and 143 transitions. Second operand 15 states. [2019-11-28 03:52:23,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:23,781 INFO L93 Difference]: Finished difference Result 148 states and 175 transitions. [2019-11-28 03:52:23,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 03:52:23,782 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 175 transitions. [2019-11-28 03:52:23,783 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 20 [2019-11-28 03:52:23,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 148 states and 175 transitions. [2019-11-28 03:52:23,785 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2019-11-28 03:52:23,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2019-11-28 03:52:23,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 175 transitions. [2019-11-28 03:52:23,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:52:23,785 INFO L688 BuchiCegarLoop]: Abstraction has 148 states and 175 transitions. [2019-11-28 03:52:23,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 175 transitions. [2019-11-28 03:52:23,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 117. [2019-11-28 03:52:23,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-28 03:52:23,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 140 transitions. [2019-11-28 03:52:23,790 INFO L711 BuchiCegarLoop]: Abstraction has 117 states and 140 transitions. [2019-11-28 03:52:23,791 INFO L591 BuchiCegarLoop]: Abstraction has 117 states and 140 transitions. [2019-11-28 03:52:23,791 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 03:52:23,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 140 transitions. [2019-11-28 03:52:23,792 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 18 [2019-11-28 03:52:23,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:23,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:23,793 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 3, 1, 1, 1, 1, 1] [2019-11-28 03:52:23,793 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:52:23,793 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 03:52:23,793 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 03:52:23,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:23,793 INFO L82 PathProgramCache]: Analyzing trace with hash -185017358, now seen corresponding path program 4 times [2019-11-28 03:52:23,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:23,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225093502] [2019-11-28 03:52:23,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:23,817 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:23,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:23,817 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 6 times [2019-11-28 03:52:23,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:23,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978642743] [2019-11-28 03:52:23,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:23,824 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:23,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:23,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1409041499, now seen corresponding path program 4 times [2019-11-28 03:52:23,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:23,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930611975] [2019-11-28 03:52:23,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:23,857 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:24,684 WARN L192 SmtUtils]: Spent 768.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 130 [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 03:52:24,814 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-28 03:52:24,818 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:52:24,818 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:52:24,818 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:52:24,818 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:52:24,819 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:52:24,819 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:24,819 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:52:24,819 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:52:24,819 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration9_Lasso [2019-11-28 03:52:24,819 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:52:24,820 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:52:24,823 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 03:52:24,829 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 03:52:24,981 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-28 03:52:25,053 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 03:52:25,055 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 03:52:25,057 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 03:52:25,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:25,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:25,074 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 03:52:25,076 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 03:52:25,077 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 03:52:25,079 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 03:52:25,081 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 03:52:25,084 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 03:52:25,086 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 03:52:25,087 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 03:52:25,089 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 03:52:25,091 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 03:52:25,094 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 03:52:25,096 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 03:52:25,098 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 03:52:25,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 03:52:25,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 03:52:25,107 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 03:52:25,109 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 03:52:25,551 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:52:25,551 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) [2019-11-28 03:52:25,565 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 03:52:25,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:25,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:25,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:25,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:25,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:25,568 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:25,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:25,569 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) [2019-11-28 03:52:25,575 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:25,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:25,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:25,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:25,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:25,581 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:25,581 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:25,587 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:25,599 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 03:52:25,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:25,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:25,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:25,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:25,609 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:25,609 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:25,619 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) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:25,623 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 03:52:25,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:25,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:25,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:25,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:25,626 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:25,626 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:25,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 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:25,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 03:52:25,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:25,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:25,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:25,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:25,645 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:25,645 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:25,650 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:25,658 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 03:52:25,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:25,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:25,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:25,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:25,671 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:25,671 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:25,697 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:52:25,758 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2019-11-28 03:52:25,758 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) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:25,763 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:52:25,771 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:52:25,771 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:52:25,771 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1, v_rep(select #length ULTIMATE.start_init_nondet_~x.base)_2, ULTIMATE.start_rangesum_~x.offset) = -4*ULTIMATE.start_rangesum_~i~1 + 1*v_rep(select #length ULTIMATE.start_init_nondet_~x.base)_2 - 1*ULTIMATE.start_rangesum_~x.offset Supporting invariants [] [2019-11-28 03:52:25,791 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2019-11-28 03:52:25,793 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:52:25,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:25,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 03:52:25,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:25,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:52:25,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:25,909 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 03:52:25,909 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 03:52:25,909 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 140 transitions. cyclomatic complexity: 35 Second operand 6 states. [2019-11-28 03:52:25,984 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 03:52:25,987 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 03:52:25,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 03:52:25,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2019-11-28 03:52:25,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-28 03:52:25,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:25,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 28 letters. Loop has 3 letters. [2019-11-28 03:52:25,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:25,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 25 letters. Loop has 6 letters. [2019-11-28 03:52:25,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:25,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 180 transitions. [2019-11-28 03:52:25,992 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 15 [2019-11-28 03:52:25,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 118 states and 141 transitions. [2019-11-28 03:52:25,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2019-11-28 03:52:25,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2019-11-28 03:52:25,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 141 transitions. [2019-11-28 03:52:25,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:52:25,994 INFO L688 BuchiCegarLoop]: Abstraction has 118 states and 141 transitions. [2019-11-28 03:52:25,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 141 transitions. [2019-11-28 03:52:25,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-11-28 03:52:25,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-28 03:52:25,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 141 transitions. [2019-11-28 03:52:25,998 INFO L711 BuchiCegarLoop]: Abstraction has 118 states and 141 transitions. [2019-11-28 03:52:25,998 INFO L591 BuchiCegarLoop]: Abstraction has 118 states and 141 transitions. [2019-11-28 03:52:25,999 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 03:52:25,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 141 transitions. [2019-11-28 03:52:26,000 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 15 [2019-11-28 03:52:26,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:26,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:26,001 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 03:52:26,001 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:26,002 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 03:52:26,002 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 03:52:26,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:26,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1751120697, now seen corresponding path program 1 times [2019-11-28 03:52:26,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:26,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245361779] [2019-11-28 03:52:26,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:26,030 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:26,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:26,031 INFO L82 PathProgramCache]: Analyzing trace with hash 3427, now seen corresponding path program 1 times [2019-11-28 03:52:26,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:26,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341983192] [2019-11-28 03:52:26,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:26,037 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:26,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:26,038 INFO L82 PathProgramCache]: Analyzing trace with hash 800192681, now seen corresponding path program 1 times [2019-11-28 03:52:26,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:26,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600276078] [2019-11-28 03:52:26,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:26,065 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:26,747 WARN L192 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 150 [2019-11-28 03:52:26,992 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-11-28 03:52:27,230 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-11-28 03:52:27,446 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-11-28 03:52:27,553 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-28 03:52:27,555 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:52:27,555 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:52:27,555 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:52:27,555 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:52:27,555 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:52:27,555 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:27,555 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:52:27,555 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:52:27,555 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration10_Lasso [2019-11-28 03:52:27,556 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:52:27,556 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:52:27,559 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 03:52:27,577 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 03:52:27,582 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 03:52:27,584 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 03:52:27,585 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 03:52:27,590 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 03:52:27,591 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 03:52:27,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:27,599 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 03:52:27,601 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 03:52:27,605 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 03:52:27,649 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 03:52:27,653 INFO L168 Benchmark]: Toolchain (without parser) took 13678.47 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 358.1 MB). Free memory was 949.6 MB in the beginning and 1.3 GB in the end (delta: -387.5 MB). Peak memory consumption was 404.2 MB. Max. memory is 11.5 GB. [2019-11-28 03:52:27,654 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:52:27,655 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.49 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 938.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:52:27,656 INFO L168 Benchmark]: Boogie Procedure Inliner took 142.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 938.9 MB in the beginning and 1.1 GB in the end (delta: -201.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 03:52:27,656 INFO L168 Benchmark]: Boogie Preprocessor took 31.78 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 03:52:27,657 INFO L168 Benchmark]: RCFGBuilder took 486.17 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: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2019-11-28 03:52:27,658 INFO L168 Benchmark]: BuchiAutomizer took 12720.83 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 207.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -227.2 MB). Peak memory consumption was 414.0 MB. Max. memory is 11.5 GB. [2019-11-28 03:52:27,661 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 292.49 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 938.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 142.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 938.9 MB in the beginning and 1.1 GB in the end (delta: -201.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.78 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 486.17 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: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12720.83 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 207.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -227.2 MB). Peak memory consumption was 414.0 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...