./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c4a47de3-20a4-4dd1-890f-bd6628329f69/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c4a47de3-20a4-4dd1-890f-bd6628329f69/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c4a47de3-20a4-4dd1-890f-bd6628329f69/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c4a47de3-20a4-4dd1-890f-bd6628329f69/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/rangesum.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c4a47de3-20a4-4dd1-890f-bd6628329f69/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c4a47de3-20a4-4dd1-890f-bd6628329f69/bin/uautomizer --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 /tmp/vcloud-vcloud-master/worker/working_dir_c4a47de3-20a4-4dd1-890f-bd6628329f69/bin/uautomizer/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-cad4683 [2019-10-22 08:57:18,881 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:57:18,882 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:57:18,894 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:57:18,895 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:57:18,895 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:57:18,896 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:57:18,898 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:57:18,899 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:57:18,899 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:57:18,900 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:57:18,901 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:57:18,901 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:57:18,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:57:18,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:57:18,903 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:57:18,904 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:57:18,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:57:18,906 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:57:18,908 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:57:18,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:57:18,910 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:57:18,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:57:18,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:57:18,913 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:57:18,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:57:18,914 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:57:18,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:57:18,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:57:18,915 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:57:18,916 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:57:18,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:57:18,917 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:57:18,918 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:57:18,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:57:18,926 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:57:18,927 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:57:18,927 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:57:18,928 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:57:18,928 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:57:18,929 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:57:18,929 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c4a47de3-20a4-4dd1-890f-bd6628329f69/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:57:18,943 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:57:18,944 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:57:18,945 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:57:18,945 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:57:18,945 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:57:18,945 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:57:18,945 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:57:18,946 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:57:18,946 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:57:18,946 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:57:18,946 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:57:18,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:57:18,946 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:57:18,946 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:57:18,947 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:57:18,947 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:57:18,947 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:57:18,947 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:57:18,947 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:57:18,947 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:57:18,948 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:57:18,948 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:57:18,948 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:57:18,948 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:57:18,948 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:57:18,948 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:57:18,948 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:57:18,949 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:57:18,949 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:57:18,949 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:57:18,949 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:57:18,950 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:57:18,950 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_c4a47de3-20a4-4dd1-890f-bd6628329f69/bin/uautomizer 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-10-22 08:57:18,975 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:57:18,987 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:57:18,990 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:57:18,991 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:57:18,991 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:57:18,992 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c4a47de3-20a4-4dd1-890f-bd6628329f69/bin/uautomizer/../../sv-benchmarks/c/reducercommutativity/rangesum.i [2019-10-22 08:57:19,042 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c4a47de3-20a4-4dd1-890f-bd6628329f69/bin/uautomizer/data/37414e658/0b72519ea5ca4adeb33184aaddefdab0/FLAGced6cc4ed [2019-10-22 08:57:19,421 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:57:19,421 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c4a47de3-20a4-4dd1-890f-bd6628329f69/sv-benchmarks/c/reducercommutativity/rangesum.i [2019-10-22 08:57:19,426 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c4a47de3-20a4-4dd1-890f-bd6628329f69/bin/uautomizer/data/37414e658/0b72519ea5ca4adeb33184aaddefdab0/FLAGced6cc4ed [2019-10-22 08:57:19,438 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c4a47de3-20a4-4dd1-890f-bd6628329f69/bin/uautomizer/data/37414e658/0b72519ea5ca4adeb33184aaddefdab0 [2019-10-22 08:57:19,440 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:57:19,441 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:57:19,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:19,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:57:19,445 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:57:19,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:19" (1/1) ... [2019-10-22 08:57:19,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fb5fa4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:19, skipping insertion in model container [2019-10-22 08:57:19,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:19" (1/1) ... [2019-10-22 08:57:19,455 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:57:19,471 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:57:19,653 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:19,730 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:57:19,756 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:19,772 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:57:19,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:19 WrapperNode [2019-10-22 08:57:19,773 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:19,773 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:19,773 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:57:19,773 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:57:19,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:19" (1/1) ... [2019-10-22 08:57:19,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:19" (1/1) ... [2019-10-22 08:57:19,821 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:19,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:57:19,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:57:19,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:57:19,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:19" (1/1) ... [2019-10-22 08:57:19,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:19" (1/1) ... [2019-10-22 08:57:19,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:19" (1/1) ... [2019-10-22 08:57:19,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:19" (1/1) ... [2019-10-22 08:57:19,863 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:19" (1/1) ... [2019-10-22 08:57:19,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:19" (1/1) ... [2019-10-22 08:57:19,869 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:19" (1/1) ... [2019-10-22 08:57:19,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:57:19,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:57:19,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:57:19,877 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:57:19,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4a47de3-20a4-4dd1-890f-bd6628329f69/bin/uautomizer/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-10-22 08:57:19,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:57:19,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:57:19,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:57:19,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:57:19,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:57:19,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:57:20,300 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:57:20,301 INFO L284 CfgBuilder]: Removed 17 assume(true) statements. [2019-10-22 08:57:20,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:20 BoogieIcfgContainer [2019-10-22 08:57:20,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:57:20,303 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:57:20,303 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:57:20,306 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:57:20,307 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:20,307 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:57:19" (1/3) ... [2019-10-22 08:57:20,308 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9cdc5af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:20, skipping insertion in model container [2019-10-22 08:57:20,308 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:20,308 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:19" (2/3) ... [2019-10-22 08:57:20,308 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9cdc5af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:20, skipping insertion in model container [2019-10-22 08:57:20,308 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:20,309 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:20" (3/3) ... [2019-10-22 08:57:20,310 INFO L371 chiAutomizerObserver]: Analyzing ICFG rangesum.i [2019-10-22 08:57:20,347 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:57:20,347 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:57:20,347 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:57:20,348 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:57:20,348 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:57:20,348 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:57:20,348 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:57:20,348 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:57:20,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2019-10-22 08:57:20,382 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-10-22 08:57:20,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:20,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:20,387 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:57:20,388 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:57:20,388 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:57:20,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2019-10-22 08:57:20,390 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-10-22 08:57:20,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:20,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:20,390 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:57:20,390 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:57:20,396 INFO L791 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 9#L-1true havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 30#L33true assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 17#L7-3true [2019-10-22 08:57:20,396 INFO L793 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-10-22 08:57:20,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:20,402 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-10-22 08:57:20,409 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:20,410 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887265230] [2019-10-22 08:57:20,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:20,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:20,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:20,518 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:20,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:20,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1379, now seen corresponding path program 1 times [2019-10-22 08:57:20,520 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:20,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595955919] [2019-10-22 08:57:20,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:20,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:20,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:20,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:20,532 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:20,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:20,534 INFO L82 PathProgramCache]: Analyzing trace with hash 28693956, now seen corresponding path program 1 times [2019-10-22 08:57:20,534 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:20,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736787947] [2019-10-22 08:57:20,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:20,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:20,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:20,567 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:20,723 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:20,724 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:20,724 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:20,724 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:20,724 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:20,724 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:20,724 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:20,724 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:20,725 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration1_Lasso [2019-10-22 08:57:20,725 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:20,725 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:20,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:20,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:20,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:20,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:20,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:20,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:20,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:20,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:20,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:20,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:20,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:20,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:20,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:20,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:20,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:20,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:20,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:20,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:20,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:21,145 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:21,153 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:21,155 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-10-22 08:57:21,159 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:21,164 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:21,165 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:21,165 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:21,165 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:21,167 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:21,167 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:21,173 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:21,174 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-10-22 08:57:21,175 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:21,175 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:21,175 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:21,175 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:21,175 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:21,176 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:21,176 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:21,177 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:21,177 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-10-22 08:57:21,178 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:21,178 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:21,178 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:21,178 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:21,178 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:21,179 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:21,183 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:21,184 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:21,185 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-10-22 08:57:21,186 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:21,186 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:21,186 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:21,187 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:21,187 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:21,187 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:21,188 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:21,189 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:21,190 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-10-22 08:57:21,191 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:21,203 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:21,203 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:21,203 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:21,203 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:21,204 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:21,204 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:21,205 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:21,205 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-10-22 08:57:21,206 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:21,206 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:21,206 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:21,206 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:21,206 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:21,206 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:21,207 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:21,207 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:21,208 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-10-22 08:57:21,208 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:21,209 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:21,209 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:21,209 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:21,211 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:21,216 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:21,221 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:21,221 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-10-22 08:57:21,222 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:21,222 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:57:21,222 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:21,222 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:21,226 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:57:21,228 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:21,250 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:21,253 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-10-22 08:57:21,254 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:21,258 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:21,258 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:21,258 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:21,258 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:21,259 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:21,259 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:21,260 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:21,260 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-10-22 08:57:21,261 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:21,261 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:21,261 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:21,261 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:21,266 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:21,268 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:21,311 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:21,356 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-10-22 08:57:21,365 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:57:21,367 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:21,369 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:21,369 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:21,370 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-10-22 08:57:21,384 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:57:21,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:21,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:21,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:21,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:57:21,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:21,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:21,472 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-10-22 08:57:21,474 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states. Second operand 3 states. [2019-10-22 08:57:21,577 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-10-22 08:57:21,577 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-10-22 08:57:21,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:57:21,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2019-10-22 08:57:21,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 3 letters. Loop has 2 letters. [2019-10-22 08:57:21,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:21,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 08:57:21,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:21,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 3 letters. Loop has 4 letters. [2019-10-22 08:57:21,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:21,585 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 130 transitions. [2019-10-22 08:57:21,589 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-10-22 08:57:21,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 23 states and 33 transitions. [2019-10-22 08:57:21,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-10-22 08:57:21,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-10-22 08:57:21,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 33 transitions. [2019-10-22 08:57:21,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:21,596 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2019-10-22 08:57:21,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 33 transitions. [2019-10-22 08:57:21,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-22 08:57:21,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-22 08:57:21,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2019-10-22 08:57:21,621 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2019-10-22 08:57:21,621 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2019-10-22 08:57:21,622 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:57:21,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 33 transitions. [2019-10-22 08:57:21,622 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-10-22 08:57:21,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:21,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:21,623 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:57:21,623 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:21,624 INFO L791 eck$LassoCheckResult]: Stem: 190#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 187#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 188#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 192#L7-3 assume !(init_nondet_~i~0 < ~N~0); 178#L5 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 170#L18-3 [2019-10-22 08:57:21,624 INFO L793 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-10-22 08:57:21,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:21,624 INFO L82 PathProgramCache]: Analyzing trace with hash 28693898, now seen corresponding path program 1 times [2019-10-22 08:57:21,624 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:21,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525424004] [2019-10-22 08:57:21,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:21,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:21,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:21,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:21,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525424004] [2019-10-22 08:57:21,665 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:21,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:21,666 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151853611] [2019-10-22 08:57:21,668 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:57:21,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:21,669 INFO L82 PathProgramCache]: Analyzing trace with hash 56764, now seen corresponding path program 1 times [2019-10-22 08:57:21,669 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:21,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133361775] [2019-10-22 08:57:21,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:21,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:21,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:21,680 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:21,696 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:21,696 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:21,696 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:21,697 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:21,697 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:57:21,697 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:21,697 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:21,697 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:21,697 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration2_Loop [2019-10-22 08:57:21,697 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:21,698 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:21,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:21,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:21,791 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:21,792 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4a47de3-20a4-4dd1-890f-bd6628329f69/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:21,803 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:57:21,803 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:57:21,809 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:57:21,809 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 /tmp/vcloud-vcloud-master/worker/working_dir_c4a47de3-20a4-4dd1-890f-bd6628329f69/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:57:21,872 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:57:21,872 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4a47de3-20a4-4dd1-890f-bd6628329f69/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:57:21,884 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:57:21,884 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:22,053 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:57:22,055 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:22,055 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:22,055 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:22,055 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:22,055 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:22,056 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:22,056 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:22,056 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:22,056 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration2_Loop [2019-10-22 08:57:22,056 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:22,056 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:22,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-10-22 08:57:22,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-10-22 08:57:22,165 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:22,165 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:22,166 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-10-22 08:57:22,166 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:22,167 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:22,167 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:22,167 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:22,167 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:22,167 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:22,168 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:22,168 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:22,169 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-10-22 08:57:22,169 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:22,169 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:22,169 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:22,170 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:22,170 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:22,170 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:22,170 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:22,175 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:22,178 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:57:22,178 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:57:22,179 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:22,179 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:57:22,179 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:22,179 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-10-22 08:57:22,180 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:57:22,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:22,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:22,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:22,210 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:57:22,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:22,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:22,250 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-10-22 08:57:22,250 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 33 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-10-22 08:57:22,282 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-10-22 08:57:22,282 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-10-22 08:57:22,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:57:22,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-10-22 08:57:22,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 5 letters. Loop has 3 letters. [2019-10-22 08:57:22,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:22,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 8 letters. Loop has 3 letters. [2019-10-22 08:57:22,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:22,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 5 letters. Loop has 6 letters. [2019-10-22 08:57:22,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:22,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 53 transitions. [2019-10-22 08:57:22,286 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-10-22 08:57:22,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 46 transitions. [2019-10-22 08:57:22,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-10-22 08:57:22,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-10-22 08:57:22,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 46 transitions. [2019-10-22 08:57:22,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:22,289 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-10-22 08:57:22,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 46 transitions. [2019-10-22 08:57:22,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-10-22 08:57:22,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-22 08:57:22,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2019-10-22 08:57:22,292 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2019-10-22 08:57:22,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:22,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:22,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:22,296 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. Second operand 3 states. [2019-10-22 08:57:22,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:22,333 INFO L93 Difference]: Finished difference Result 30 states and 43 transitions. [2019-10-22 08:57:22,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:22,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 43 transitions. [2019-10-22 08:57:22,334 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-10-22 08:57:22,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 43 transitions. [2019-10-22 08:57:22,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-10-22 08:57:22,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-10-22 08:57:22,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 43 transitions. [2019-10-22 08:57:22,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:22,336 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2019-10-22 08:57:22,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 43 transitions. [2019-10-22 08:57:22,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-22 08:57:22,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-22 08:57:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2019-10-22 08:57:22,339 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2019-10-22 08:57:22,339 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2019-10-22 08:57:22,339 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:57:22,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 42 transitions. [2019-10-22 08:57:22,340 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-10-22 08:57:22,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:22,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:22,340 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:22,340 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:22,341 INFO L791 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 359#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 360#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 364#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 347#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 348#L7-3 assume !(init_nondet_~i~0 < ~N~0); 349#L5 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 350#L18-3 assume !!(rangesum_~i~1 < ~N~0); 339#L19 [2019-10-22 08:57:22,341 INFO L793 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-10-22 08:57:22,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:22,341 INFO L82 PathProgramCache]: Analyzing trace with hash 123162479, now seen corresponding path program 1 times [2019-10-22 08:57:22,341 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:22,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742668818] [2019-10-22 08:57:22,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:22,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:22,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742668818] [2019-10-22 08:57:22,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379089595] [2019-10-22 08:57:22,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4a47de3-20a4-4dd1-890f-bd6628329f69/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:22,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:57:22,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:22,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:22,459 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:57:22,459 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-10-22 08:57:22,460 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523742245] [2019-10-22 08:57:22,460 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:57:22,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:22,460 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 1 times [2019-10-22 08:57:22,460 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:22,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141892473] [2019-10-22 08:57:22,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:22,472 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:22,521 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:22,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:57:22,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:57:22,521 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. cyclomatic complexity: 19 Second operand 6 states. [2019-10-22 08:57:22,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:22,574 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2019-10-22 08:57:22,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:22,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2019-10-22 08:57:22,576 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-10-22 08:57:22,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 45 transitions. [2019-10-22 08:57:22,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-10-22 08:57:22,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-10-22 08:57:22,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 45 transitions. [2019-10-22 08:57:22,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:22,577 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 45 transitions. [2019-10-22 08:57:22,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 45 transitions. [2019-10-22 08:57:22,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-10-22 08:57:22,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-22 08:57:22,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2019-10-22 08:57:22,579 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2019-10-22 08:57:22,579 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2019-10-22 08:57:22,579 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:57:22,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. [2019-10-22 08:57:22,580 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-10-22 08:57:22,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:22,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:22,580 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:22,580 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:22,580 INFO L791 eck$LassoCheckResult]: Stem: 453#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 450#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 451#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 455#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 456#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 457#L7-3 assume !!(init_nondet_~i~0 < ~N~0);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 437#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 438#L7-3 assume !(init_nondet_~i~0 < ~N~0); 439#L5 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 440#L18-3 assume !!(rangesum_~i~1 < ~N~0); 430#L19 [2019-10-22 08:57:22,580 INFO L793 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-10-22 08:57:22,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:22,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1898228851, now seen corresponding path program 2 times [2019-10-22 08:57:22,581 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:22,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165658540] [2019-10-22 08:57:22,581 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,581 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:22,600 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:22,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:22,601 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 2 times [2019-10-22 08:57:22,601 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:22,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857492190] [2019-10-22 08:57:22,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:22,609 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:22,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:22,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1698716202, now seen corresponding path program 1 times [2019-10-22 08:57:22,610 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:22,610 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473098309] [2019-10-22 08:57:22,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:22,653 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:22,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473098309] [2019-10-22 08:57:22,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411740231] [2019-10-22 08:57:22,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4a47de3-20a4-4dd1-890f-bd6628329f69/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:22,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:57:22,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:22,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 08:57:22,727 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:57:22,727 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2019-10-22 08:57:22,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412223695] [2019-10-22 08:57:22,766 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:22,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:22,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:57:22,767 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. cyclomatic complexity: 19 Second operand 4 states. [2019-10-22 08:57:22,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:22,832 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-10-22 08:57:22,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:57:22,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2019-10-22 08:57:22,833 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-10-22 08:57:22,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 50 transitions. [2019-10-22 08:57:22,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-10-22 08:57:22,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-10-22 08:57:22,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. [2019-10-22 08:57:22,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:22,834 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-10-22 08:57:22,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. [2019-10-22 08:57:22,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-10-22 08:57:22,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-22 08:57:22,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2019-10-22 08:57:22,837 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2019-10-22 08:57:22,837 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2019-10-22 08:57:22,837 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:57:22,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 47 transitions. [2019-10-22 08:57:22,837 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-10-22 08:57:22,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:22,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:22,838 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:22,838 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:22,838 INFO L791 eck$LassoCheckResult]: Stem: 577#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~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-10-22 08:57:22,838 INFO L793 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-10-22 08:57:22,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:22,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1698718124, now seen corresponding path program 1 times [2019-10-22 08:57:22,842 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:22,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224024761] [2019-10-22 08:57:22,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:22,889 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:22,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:22,889 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 3 times [2019-10-22 08:57:22,890 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:22,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748180506] [2019-10-22 08:57:22,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:22,898 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:22,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:22,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1087986773, now seen corresponding path program 1 times [2019-10-22 08:57:22,898 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:22,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573152471] [2019-10-22 08:57:22,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:22,949 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:57:22,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573152471] [2019-10-22 08:57:22,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599282458] [2019-10-22 08:57:22,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4a47de3-20a4-4dd1-890f-bd6628329f69/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:22,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:57:22,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:23,029 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:23,029 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:57:23,029 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2019-10-22 08:57:23,030 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662028486] [2019-10-22 08:57:23,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:23,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 08:57:23,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:57:23,069 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. cyclomatic complexity: 17 Second operand 12 states. [2019-10-22 08:57:23,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:23,308 INFO L93 Difference]: Finished difference Result 91 states and 115 transitions. [2019-10-22 08:57:23,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 08:57:23,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 115 transitions. [2019-10-22 08:57:23,310 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 17 [2019-10-22 08:57:23,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 77 states and 99 transitions. [2019-10-22 08:57:23,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2019-10-22 08:57:23,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2019-10-22 08:57:23,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 99 transitions. [2019-10-22 08:57:23,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:23,312 INFO L688 BuchiCegarLoop]: Abstraction has 77 states and 99 transitions. [2019-10-22 08:57:23,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 99 transitions. [2019-10-22 08:57:23,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2019-10-22 08:57:23,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-22 08:57:23,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2019-10-22 08:57:23,316 INFO L711 BuchiCegarLoop]: Abstraction has 60 states and 78 transitions. [2019-10-22 08:57:23,316 INFO L591 BuchiCegarLoop]: Abstraction has 60 states and 78 transitions. [2019-10-22 08:57:23,316 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:57:23,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 78 transitions. [2019-10-22 08:57:23,317 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-10-22 08:57:23,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:23,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:23,317 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:23,317 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:23,317 INFO L791 eck$LassoCheckResult]: Stem: 780#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~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-10-22 08:57:23,317 INFO L793 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-10-22 08:57:23,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:23,318 INFO L82 PathProgramCache]: Analyzing trace with hash -154124210, now seen corresponding path program 2 times [2019-10-22 08:57:23,318 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:23,318 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357868197] [2019-10-22 08:57:23,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:23,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:23,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:23,337 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:23,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:23,337 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 4 times [2019-10-22 08:57:23,337 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:23,338 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042229865] [2019-10-22 08:57:23,338 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:23,338 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:23,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:23,345 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:23,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:23,346 INFO L82 PathProgramCache]: Analyzing trace with hash -194270775, now seen corresponding path program 2 times [2019-10-22 08:57:23,346 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:23,346 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395759860] [2019-10-22 08:57:23,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:23,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:23,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:23,414 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:23,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395759860] [2019-10-22 08:57:23,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911281564] [2019-10-22 08:57:23,414 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4a47de3-20a4-4dd1-890f-bd6628329f69/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:23,460 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:57:23,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:57:23,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:57:23,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:23,544 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:23,545 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:57:23,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2019-10-22 08:57:23,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999262784] [2019-10-22 08:57:23,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:23,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-22 08:57:23,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-10-22 08:57:23,583 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. cyclomatic complexity: 25 Second operand 16 states. [2019-10-22 08:57:24,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:24,198 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2019-10-22 08:57:24,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-22 08:57:24,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 148 transitions. [2019-10-22 08:57:24,200 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 21 [2019-10-22 08:57:24,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 116 states and 142 transitions. [2019-10-22 08:57:24,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2019-10-22 08:57:24,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2019-10-22 08:57:24,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 142 transitions. [2019-10-22 08:57:24,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:24,202 INFO L688 BuchiCegarLoop]: Abstraction has 116 states and 142 transitions. [2019-10-22 08:57:24,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 142 transitions. [2019-10-22 08:57:24,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 102. [2019-10-22 08:57:24,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-22 08:57:24,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 128 transitions. [2019-10-22 08:57:24,212 INFO L711 BuchiCegarLoop]: Abstraction has 102 states and 128 transitions. [2019-10-22 08:57:24,212 INFO L591 BuchiCegarLoop]: Abstraction has 102 states and 128 transitions. [2019-10-22 08:57:24,212 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:57:24,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 128 transitions. [2019-10-22 08:57:24,213 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 21 [2019-10-22 08:57:24,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:24,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:24,213 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1] [2019-10-22 08:57:24,214 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:24,214 INFO L791 eck$LassoCheckResult]: Stem: 1068#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~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-10-22 08:57:24,214 INFO L793 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-10-22 08:57:24,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:24,214 INFO L82 PathProgramCache]: Analyzing trace with hash -326653975, now seen corresponding path program 3 times [2019-10-22 08:57:24,214 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:24,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883627684] [2019-10-22 08:57:24,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:24,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:24,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:24,253 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:24,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:24,253 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 5 times [2019-10-22 08:57:24,253 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:24,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804012557] [2019-10-22 08:57:24,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:24,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:24,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:24,261 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:24,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:24,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1047353422, now seen corresponding path program 3 times [2019-10-22 08:57:24,262 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:24,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888883788] [2019-10-22 08:57:24,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:24,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:24,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:24,361 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-22 08:57:24,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888883788] [2019-10-22 08:57:24,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332704474] [2019-10-22 08:57:24,362 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4a47de3-20a4-4dd1-890f-bd6628329f69/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:24,414 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-22 08:57:24,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:57:24,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 08:57:24,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:24,520 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-22 08:57:24,521 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:57:24,521 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2019-10-22 08:57:24,521 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120098864] [2019-10-22 08:57:24,557 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:24,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-22 08:57:24,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-10-22 08:57:24,558 INFO L87 Difference]: Start difference. First operand 102 states and 128 transitions. cyclomatic complexity: 37 Second operand 16 states. [2019-10-22 08:57:25,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:25,374 INFO L93 Difference]: Finished difference Result 278 states and 345 transitions. [2019-10-22 08:57:25,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-22 08:57:25,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 278 states and 345 transitions. [2019-10-22 08:57:25,377 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 49 [2019-10-22 08:57:25,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 278 states to 263 states and 329 transitions. [2019-10-22 08:57:25,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 219 [2019-10-22 08:57:25,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 219 [2019-10-22 08:57:25,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 263 states and 329 transitions. [2019-10-22 08:57:25,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:25,386 INFO L688 BuchiCegarLoop]: Abstraction has 263 states and 329 transitions. [2019-10-22 08:57:25,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states and 329 transitions. [2019-10-22 08:57:25,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 112. [2019-10-22 08:57:25,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-22 08:57:25,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2019-10-22 08:57:25,399 INFO L711 BuchiCegarLoop]: Abstraction has 112 states and 139 transitions. [2019-10-22 08:57:25,399 INFO L591 BuchiCegarLoop]: Abstraction has 112 states and 139 transitions. [2019-10-22 08:57:25,399 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:57:25,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 139 transitions. [2019-10-22 08:57:25,402 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 21 [2019-10-22 08:57:25,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:25,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:25,402 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:25,403 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:25,403 INFO L791 eck$LassoCheckResult]: Stem: 1604#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~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-10-22 08:57:25,403 INFO L793 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-10-22 08:57:25,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:25,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1740406288, now seen corresponding path program 1 times [2019-10-22 08:57:25,403 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:25,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385192850] [2019-10-22 08:57:25,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:25,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:25,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:25,499 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 08:57:25,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385192850] [2019-10-22 08:57:25,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478407895] [2019-10-22 08:57:25,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4a47de3-20a4-4dd1-890f-bd6628329f69/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:25,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:57:25,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:25,604 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:57:25,605 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:57:25,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-10-22 08:57:25,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645489310] [2019-10-22 08:57:25,605 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:57:25,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:25,605 INFO L82 PathProgramCache]: Analyzing trace with hash 88159, now seen corresponding path program 1 times [2019-10-22 08:57:25,606 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:25,606 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57409334] [2019-10-22 08:57:25,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:25,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:25,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:25,612 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:25,625 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:25,625 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:25,625 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:25,625 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:25,625 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:57:25,626 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:25,626 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:25,626 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:25,626 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration8_Loop [2019-10-22 08:57:25,626 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:25,626 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:25,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:25,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-10-22 08:57:25,707 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:25,707 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4a47de3-20a4-4dd1-890f-bd6628329f69/bin/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:25,710 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:57:25,711 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:57:25,715 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:57:25,716 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 /tmp/vcloud-vcloud-master/worker/working_dir_c4a47de3-20a4-4dd1-890f-bd6628329f69/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:25,720 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:57:25,720 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4a47de3-20a4-4dd1-890f-bd6628329f69/bin/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:25,726 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:57:25,726 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:57:26,191 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:57:26,194 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:26,194 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:26,194 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:26,194 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:26,194 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:26,194 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:26,194 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:26,195 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:26,195 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration8_Loop [2019-10-22 08:57:26,195 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:26,195 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:26,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:26,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:26,260 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:26,261 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:26,261 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-10-22 08:57:26,261 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:26,261 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:26,262 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:26,262 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:26,262 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:26,262 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:26,262 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:26,263 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:26,263 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-10-22 08:57:26,263 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:26,263 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:26,264 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:26,264 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:26,264 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:26,264 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:26,264 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:26,266 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:26,268 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:57:26,268 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:57:26,268 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:26,268 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:57:26,269 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:26,269 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, ULTIMATE.start_rangesum_~i~1) = 1*~N~0 - 1*ULTIMATE.start_rangesum_~i~1 Supporting invariants [] [2019-10-22 08:57:26,269 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:57:26,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:26,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:26,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:26,317 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:57:26,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:26,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:26,334 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-10-22 08:57:26,334 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 139 transitions. cyclomatic complexity: 38 Second operand 4 states. [2019-10-22 08:57:26,365 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 139 transitions. cyclomatic complexity: 38. Second operand 4 states. Result 139 states and 178 transitions. Complement of second has 7 states. [2019-10-22 08:57:26,366 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-10-22 08:57:26,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:57:26,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2019-10-22 08:57:26,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 25 letters. Loop has 3 letters. [2019-10-22 08:57:26,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:26,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 28 letters. Loop has 3 letters. [2019-10-22 08:57:26,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:26,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 25 letters. Loop has 6 letters. [2019-10-22 08:57:26,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:26,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 178 transitions. [2019-10-22 08:57:26,369 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 15 [2019-10-22 08:57:26,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 118 states and 148 transitions. [2019-10-22 08:57:26,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2019-10-22 08:57:26,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2019-10-22 08:57:26,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 148 transitions. [2019-10-22 08:57:26,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:26,371 INFO L688 BuchiCegarLoop]: Abstraction has 118 states and 148 transitions. [2019-10-22 08:57:26,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 148 transitions. [2019-10-22 08:57:26,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2019-10-22 08:57:26,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-10-22 08:57:26,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 144 transitions. [2019-10-22 08:57:26,376 INFO L711 BuchiCegarLoop]: Abstraction has 114 states and 144 transitions. [2019-10-22 08:57:26,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:26,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 08:57:26,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-10-22 08:57:26,377 INFO L87 Difference]: Start difference. First operand 114 states and 144 transitions. Second operand 15 states. [2019-10-22 08:57:26,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:26,631 INFO L93 Difference]: Finished difference Result 150 states and 177 transitions. [2019-10-22 08:57:26,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 08:57:26,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 177 transitions. [2019-10-22 08:57:26,633 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 17 [2019-10-22 08:57:26,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 142 states and 166 transitions. [2019-10-22 08:57:26,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2019-10-22 08:57:26,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2019-10-22 08:57:26,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 166 transitions. [2019-10-22 08:57:26,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:26,634 INFO L688 BuchiCegarLoop]: Abstraction has 142 states and 166 transitions. [2019-10-22 08:57:26,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 166 transitions. [2019-10-22 08:57:26,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 114. [2019-10-22 08:57:26,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-10-22 08:57:26,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 136 transitions. [2019-10-22 08:57:26,638 INFO L711 BuchiCegarLoop]: Abstraction has 114 states and 136 transitions. [2019-10-22 08:57:26,638 INFO L591 BuchiCegarLoop]: Abstraction has 114 states and 136 transitions. [2019-10-22 08:57:26,639 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 08:57:26,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 136 transitions. [2019-10-22 08:57:26,640 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 15 [2019-10-22 08:57:26,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:26,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:26,640 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 3, 1, 1, 1, 1, 1] [2019-10-22 08:57:26,640 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:26,641 INFO L791 eck$LassoCheckResult]: Stem: 2337#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 2330#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; 2331#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; 2341#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; 2344#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2377#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; 2376#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2375#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; 2311#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2312#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; 2396#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2397#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; 2345#L7-3 assume !(init_nondet_~i~0 < ~N~0); 2346#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; 2303#L18-3 assume !!(rangesum_~i~1 < ~N~0); 2304#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2394#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2392#L18-3 assume !!(rangesum_~i~1 < ~N~0); 2391#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2390#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2388#L18-3 assume !!(rangesum_~i~1 < ~N~0); 2386#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2385#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2383#L18-3 assume !!(rangesum_~i~1 < ~N~0); 2382#L19 [2019-10-22 08:57:26,641 INFO L793 eck$LassoCheckResult]: Loop: 2382#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; 2316#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2317#L18-3 assume !!(rangesum_~i~1 < ~N~0); 2382#L19 [2019-10-22 08:57:26,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:26,641 INFO L82 PathProgramCache]: Analyzing trace with hash -185017358, now seen corresponding path program 4 times [2019-10-22 08:57:26,641 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:26,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138907370] [2019-10-22 08:57:26,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:26,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:26,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:26,671 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:26,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:26,671 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 6 times [2019-10-22 08:57:26,672 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:26,672 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645066309] [2019-10-22 08:57:26,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:26,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:26,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:26,678 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:26,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:26,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1409041499, now seen corresponding path program 4 times [2019-10-22 08:57:26,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:26,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413059373] [2019-10-22 08:57:26,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:26,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:26,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:26,709 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:27,304 WARN L191 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 131 [2019-10-22 08:57:27,388 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:27,388 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:27,388 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:27,388 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:27,388 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:27,388 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:27,388 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:27,388 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:27,389 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration9_Lasso [2019-10-22 08:57:27,389 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:27,389 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:27,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:27,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:27,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:27,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:27,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:27,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:27,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:27,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:27,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:27,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:27,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:27,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:27,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:27,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:27,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:27,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:27,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:27,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:27,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57: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-10-22 08:57:27,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:27,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:27,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:27,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:27,833 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:27,833 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:27,834 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-10-22 08:57:27,834 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:27,834 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:27,835 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:27,835 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:27,835 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:27,835 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:27,835 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:27,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:27,836 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-10-22 08:57:27,836 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:27,836 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:27,836 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:27,837 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:27,837 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:27,837 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:27,840 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:27,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:27,841 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:27,841 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:57:27,841 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:27,842 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:27,843 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:57:27,843 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:27,849 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:27,849 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-10-22 08:57:27,849 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:27,849 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:27,849 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:27,850 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:27,850 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:27,850 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:27,851 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:27,851 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-10-22 08:57:27,852 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:27,852 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:27,852 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:27,852 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:27,853 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:27,853 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:27,854 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:27,855 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-10-22 08:57:27,855 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:27,855 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:27,855 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:27,856 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:27,858 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:27,858 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:27,905 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:27,939 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:57:27,939 INFO L444 ModelExtractionUtils]: 31 out of 37 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:57:27,939 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:27,943 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:27,944 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:27,944 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1, ~N~0) = -1*ULTIMATE.start_rangesum_~i~1 + 1*~N~0 Supporting invariants [] [2019-10-22 08:57:27,954 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-10-22 08:57:27,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:27,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:27,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:27,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:57:27,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:27,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:27,997 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-10-22 08:57:27,997 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 114 states and 136 transitions. cyclomatic complexity: 33 Second operand 4 states. [2019-10-22 08:57:28,024 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 114 states and 136 transitions. cyclomatic complexity: 33. Second operand 4 states. Result 141 states and 168 transitions. Complement of second has 7 states. [2019-10-22 08:57:28,026 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-10-22 08:57:28,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:57:28,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-10-22 08:57:28,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 25 letters. Loop has 3 letters. [2019-10-22 08:57:28,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:28,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 28 letters. Loop has 3 letters. [2019-10-22 08:57:28,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:28,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 25 letters. Loop has 6 letters. [2019-10-22 08:57:28,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:28,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 168 transitions. [2019-10-22 08:57:28,028 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 12 [2019-10-22 08:57:28,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 117 states and 140 transitions. [2019-10-22 08:57:28,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2019-10-22 08:57:28,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2019-10-22 08:57:28,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 140 transitions. [2019-10-22 08:57:28,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:28,030 INFO L688 BuchiCegarLoop]: Abstraction has 117 states and 140 transitions. [2019-10-22 08:57:28,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 140 transitions. [2019-10-22 08:57:28,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-10-22 08:57:28,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-10-22 08:57:28,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 140 transitions. [2019-10-22 08:57:28,033 INFO L711 BuchiCegarLoop]: Abstraction has 117 states and 140 transitions. [2019-10-22 08:57:28,033 INFO L591 BuchiCegarLoop]: Abstraction has 117 states and 140 transitions. [2019-10-22 08:57:28,033 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 08:57:28,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 140 transitions. [2019-10-22 08:57:28,034 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 12 [2019-10-22 08:57:28,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:28,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:28,035 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-10-22 08:57:28,035 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:57:28,035 INFO L791 eck$LassoCheckResult]: Stem: 2719#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 2712#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; 2713#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; 2723#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; 2726#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2756#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; 2755#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2753#L7-3 assume !(init_nondet_~i~0 < ~N~0); 2752#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; 2751#L18-3 assume !!(rangesum_~i~1 < ~N~0); 2750#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2749#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2748#L18-3 assume !!(rangesum_~i~1 < ~N~0); 2747#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2746#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2745#L18-3 assume !(rangesum_~i~1 < ~N~0); 2742#L18-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 2740#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; 2739#L18-8 assume !!(rangesum_~i~1 < ~N~0); 2738#L19-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2737#L18-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2736#L18-8 assume !!(rangesum_~i~1 < ~N~0); 2735#L19-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2734#L18-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2733#L18-8 assume !(rangesum_~i~1 < ~N~0); 2732#L18-9 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 2692#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; 2693#L46-3 [2019-10-22 08:57:28,036 INFO L793 eck$LassoCheckResult]: Loop: 2693#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; 2722#L46-2 main_#t~post10 := main_~i~2;main_~i~2 := 1 + main_#t~post10;havoc main_#t~post10; 2693#L46-3 [2019-10-22 08:57:28,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:28,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1751120697, now seen corresponding path program 1 times [2019-10-22 08:57:28,036 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:28,036 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561917703] [2019-10-22 08:57:28,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:28,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:28,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:28,067 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:28,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:28,067 INFO L82 PathProgramCache]: Analyzing trace with hash 3427, now seen corresponding path program 1 times [2019-10-22 08:57:28,067 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:28,067 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772960829] [2019-10-22 08:57:28,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:28,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:28,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:28,072 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:28,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:28,072 INFO L82 PathProgramCache]: Analyzing trace with hash 800192681, now seen corresponding path program 1 times [2019-10-22 08:57:28,073 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:28,073 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267684549] [2019-10-22 08:57:28,073 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:28,073 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:28,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:28,093 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:28,677 WARN L191 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 151 [2019-10-22 08:57:28,839 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 92 [2019-10-22 08:57:28,960 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 92 [2019-10-22 08:57:29,084 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 92 [2019-10-22 08:57:29,150 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:29,150 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:29,150 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:29,150 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:29,150 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:29,150 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:29,150 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:29,151 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:29,151 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration10_Lasso [2019-10-22 08:57:29,151 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:29,151 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:29,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:29,200 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:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:536) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:951) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:248) 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-10-22 08:57:29,203 INFO L168 Benchmark]: Toolchain (without parser) took 9761.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.3 MB). Free memory was 944.5 MB in the beginning and 862.2 MB in the end (delta: 82.3 MB). Peak memory consumption was 293.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:29,203 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:29,204 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:29,204 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.84 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-10-22 08:57:29,205 INFO L168 Benchmark]: Boogie Preprocessor took 55.36 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:29,205 INFO L168 Benchmark]: RCFGBuilder took 425.32 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:29,206 INFO L168 Benchmark]: BuchiAutomizer took 8899.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 87.0 MB). Free memory was 1.1 GB in the beginning and 862.2 MB in the end (delta: 227.7 MB). Peak memory consumption was 314.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:29,209 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 330.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.36 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 425.32 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8899.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 87.0 MB). Free memory was 1.1 GB in the beginning and 862.2 MB in the end (delta: 227.7 MB). Peak memory consumption was 314.7 MB. Max. memory is 11.5 GB. * 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...