./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/insertion_sort-1.c --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_5269e124-4d7c-48d4-8a15-555041b3c4a6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5269e124-4d7c-48d4-8a15-555041b3c4a6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5269e124-4d7c-48d4-8a15-555041b3c4a6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5269e124-4d7c-48d4-8a15-555041b3c4a6/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/insertion_sort-1.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5269e124-4d7c-48d4-8a15-555041b3c4a6/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5269e124-4d7c-48d4-8a15-555041b3c4a6/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 5e4c5ca624cdf20709f1f0e007d5ebfc90b8f799 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:00:30,269 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:00:30,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:00:30,280 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:00:30,280 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:00:30,281 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:00:30,282 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:00:30,283 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:00:30,284 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:00:30,285 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:00:30,286 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:00:30,287 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:00:30,287 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:00:30,288 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:00:30,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:00:30,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:00:30,290 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:00:30,291 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:00:30,292 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:00:30,293 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:00:30,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:00:30,295 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:00:30,296 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:00:30,297 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:00:30,303 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:00:30,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:00:30,304 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:00:30,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:00:30,305 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:00:30,305 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:00:30,305 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:00:30,306 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:00:30,309 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:00:30,310 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:00:30,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:00:30,311 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:00:30,311 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:00:30,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:00:30,312 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:00:30,312 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:00:30,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:00:30,313 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5269e124-4d7c-48d4-8a15-555041b3c4a6/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:00:30,330 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:00:30,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:00:30,335 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:00:30,337 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:00:30,337 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:00:30,337 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:00:30,337 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:00:30,338 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:00:30,338 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:00:30,338 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:00:30,338 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:00:30,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:00:30,339 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:00:30,339 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:00:30,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:00:30,339 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:00:30,339 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:00:30,339 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:00:30,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:00:30,340 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:00:30,340 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:00:30,340 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:00:30,340 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:00:30,340 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:00:30,341 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:00:30,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:00:30,341 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:00:30,341 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:00:30,341 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:00:30,341 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:00:30,342 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:00:30,342 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:00:30,344 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_5269e124-4d7c-48d4-8a15-555041b3c4a6/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 -> 5e4c5ca624cdf20709f1f0e007d5ebfc90b8f799 [2019-10-22 09:00:30,371 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:00:30,380 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:00:30,386 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:00:30,388 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:00:30,388 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:00:30,389 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5269e124-4d7c-48d4-8a15-555041b3c4a6/bin/uautomizer/../../sv-benchmarks/c/loops/insertion_sort-1.c [2019-10-22 09:00:30,436 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5269e124-4d7c-48d4-8a15-555041b3c4a6/bin/uautomizer/data/a51ddb34c/98e5043a73234b05bb1f2a85aee99b6a/FLAG882ceff4a [2019-10-22 09:00:30,816 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:00:30,817 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5269e124-4d7c-48d4-8a15-555041b3c4a6/sv-benchmarks/c/loops/insertion_sort-1.c [2019-10-22 09:00:30,822 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5269e124-4d7c-48d4-8a15-555041b3c4a6/bin/uautomizer/data/a51ddb34c/98e5043a73234b05bb1f2a85aee99b6a/FLAG882ceff4a [2019-10-22 09:00:30,832 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5269e124-4d7c-48d4-8a15-555041b3c4a6/bin/uautomizer/data/a51ddb34c/98e5043a73234b05bb1f2a85aee99b6a [2019-10-22 09:00:30,833 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:00:30,834 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:00:30,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:30,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:00:30,838 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:00:30,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:30" (1/1) ... [2019-10-22 09:00:30,841 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4da91b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:30, skipping insertion in model container [2019-10-22 09:00:30,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:30" (1/1) ... [2019-10-22 09:00:30,848 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:00:30,861 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:00:30,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:30,996 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:00:31,080 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:31,098 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:00:31,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31 WrapperNode [2019-10-22 09:00:31,099 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:31,100 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:31,100 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:00:31,100 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:00:31,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,115 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:31,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:00:31,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:00:31,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:00:31,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,172 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:00:31,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:00:31,173 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:00:31,173 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:00:31,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5269e124-4d7c-48d4-8a15-555041b3c4a6/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 09:00:31,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:00:31,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:00:31,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:00:31,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:00:31,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:00:31,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:00:31,506 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:00:31,507 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-22 09:00:31,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:31 BoogieIcfgContainer [2019-10-22 09:00:31,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:00:31,508 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:00:31,508 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:00:31,512 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:00:31,513 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:31,513 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:00:30" (1/3) ... [2019-10-22 09:00:31,514 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@597840d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:31, skipping insertion in model container [2019-10-22 09:00:31,514 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:31,514 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (2/3) ... [2019-10-22 09:00:31,514 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@597840d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:31, skipping insertion in model container [2019-10-22 09:00:31,514 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:31,515 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:31" (3/3) ... [2019-10-22 09:00:31,516 INFO L371 chiAutomizerObserver]: Analyzing ICFG insertion_sort-1.c [2019-10-22 09:00:31,570 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:00:31,570 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:00:31,570 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:00:31,570 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:00:31,570 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:00:31,570 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:00:31,570 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:00:31,571 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:00:31,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-10-22 09:00:31,610 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-10-22 09:00:31,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:31,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:31,619 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:31,619 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:00:31,620 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:00:31,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-10-22 09:00:31,621 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-10-22 09:00:31,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:31,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:31,621 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:31,621 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:00:31,629 INFO L791 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 13#L14-3true [2019-10-22 09:00:31,629 INFO L793 eck$LassoCheckResult]: Loop: 13#L14-3true assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 16#L17-5true assume !true; 14#L17-6true call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 17#L14-2true main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 13#L14-3true [2019-10-22 09:00:31,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:31,635 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 09:00:31,643 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:31,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745228299] [2019-10-22 09:00:31,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:31,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:31,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:31,782 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:31,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:31,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1256252, now seen corresponding path program 1 times [2019-10-22 09:00:31,784 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:31,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823952105] [2019-10-22 09:00:31,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:31,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:31,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:31,827 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 09:00:31,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823952105] [2019-10-22 09:00:31,828 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:31,828 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:00:31,829 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528337072] [2019-10-22 09:00:31,834 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:31,835 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:31,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 09:00:31,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 09:00:31,852 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-10-22 09:00:31,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:31,857 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-10-22 09:00:31,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 09:00:31,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2019-10-22 09:00:31,860 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-10-22 09:00:31,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 19 transitions. [2019-10-22 09:00:31,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-10-22 09:00:31,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-10-22 09:00:31,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-10-22 09:00:31,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:31,866 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-10-22 09:00:31,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-10-22 09:00:31,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-10-22 09:00:31,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 09:00:31,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-10-22 09:00:31,891 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-10-22 09:00:31,891 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-10-22 09:00:31,891 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:00:31,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-10-22 09:00:31,892 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-10-22 09:00:31,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:31,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:31,892 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:31,892 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:00:31,892 INFO L791 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 53#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 54#L14-3 [2019-10-22 09:00:31,893 INFO L793 eck$LassoCheckResult]: Loop: 54#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 51#L17-5 main_#t~short4 := main_~i~0 >= 0; 48#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 49#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 59#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 60#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 54#L14-3 [2019-10-22 09:00:31,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:31,893 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-10-22 09:00:31,893 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:31,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699152238] [2019-10-22 09:00:31,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:31,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:31,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:31,922 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:31,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:31,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1188208494, now seen corresponding path program 1 times [2019-10-22 09:00:31,925 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:31,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520023066] [2019-10-22 09:00:31,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:31,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:31,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:31,962 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:31,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:31,963 INFO L82 PathProgramCache]: Analyzing trace with hash 268257712, now seen corresponding path program 1 times [2019-10-22 09:00:31,963 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:31,963 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96762018] [2019-10-22 09:00:31,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:31,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:31,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:32,035 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:32,242 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-10-22 09:00:32,371 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-10-22 09:00:32,511 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:32,512 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:32,513 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:32,514 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:32,514 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:32,514 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:32,514 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:32,514 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:32,514 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration2_Lasso [2019-10-22 09:00:32,515 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:32,515 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:32,537 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 09:00:32,544 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 09:00:32,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 09:00:32,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 09:00:32,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 09:00:32,555 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 09:00:32,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 09:00:32,561 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 09:00:32,568 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 09:00:32,732 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 09:00:32,734 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 09:00:32,736 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 09:00:32,738 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 09:00:32,741 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 09:00:33,102 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-10-22 09:00:33,171 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:33,175 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:33,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 09:00:33,178 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,179 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,179 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,180 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,180 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,181 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,182 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,183 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,184 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 09:00:33,185 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,185 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,185 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,185 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,185 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,186 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,186 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,187 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,187 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 09:00:33,188 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,188 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,188 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,189 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,189 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,189 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,189 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,190 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,191 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 09:00:33,192 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,192 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,192 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,192 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,192 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,193 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,193 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,194 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,194 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 09:00:33,195 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,195 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,195 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,195 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,195 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,196 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,196 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,197 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,197 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 09:00:33,198 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,198 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,198 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,198 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,198 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,199 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,199 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,200 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,200 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 09:00:33,201 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,201 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,201 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,201 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,202 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,202 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,202 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,203 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,203 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 09:00:33,204 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,204 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,205 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,205 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,207 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:33,207 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:33,210 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,211 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 09:00:33,211 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,212 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,212 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,212 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,212 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,213 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,213 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,215 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,216 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 09:00:33,216 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,216 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,217 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,217 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,217 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,217 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,217 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,219 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,219 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 09:00:33,220 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,220 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,220 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,220 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,222 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:33,222 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:33,230 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,231 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 09:00:33,231 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,232 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:00:33,232 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,232 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,242 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:33,243 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:33,367 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:33,407 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 09:00:33,407 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 09:00:33,410 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:33,411 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:33,411 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:33,412 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#v~0.base)_1, ULTIMATE.start_main_~#v~0.offset, ULTIMATE.start_main_~j~0) = 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_1 - 1*ULTIMATE.start_main_~#v~0.offset - 4*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-10-22 09:00:33,427 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-10-22 09:00:33,436 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:00:33,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:33,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:33,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:33,507 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 09:00:33,512 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 09:00:33,513 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-10-22 09:00:33,585 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 29 states and 40 transitions. Complement of second has 6 states. [2019-10-22 09:00:33,586 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 09:00:33,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:33,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-10-22 09:00:33,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 2 letters. Loop has 6 letters. [2019-10-22 09:00:33,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:33,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 8 letters. Loop has 6 letters. [2019-10-22 09:00:33,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:33,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 2 letters. Loop has 12 letters. [2019-10-22 09:00:33,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:33,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 40 transitions. [2019-10-22 09:00:33,595 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-10-22 09:00:33,596 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 22 states and 31 transitions. [2019-10-22 09:00:33,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 09:00:33,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 09:00:33,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2019-10-22 09:00:33,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:33,598 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-10-22 09:00:33,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2019-10-22 09:00:33,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-10-22 09:00:33,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-22 09:00:33,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2019-10-22 09:00:33,603 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-10-22 09:00:33,603 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-10-22 09:00:33,603 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:00:33,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2019-10-22 09:00:33,604 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-10-22 09:00:33,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:33,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:33,607 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 09:00:33,607 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:33,607 INFO L791 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 157#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 158#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 152#L17-5 [2019-10-22 09:00:33,607 INFO L793 eck$LassoCheckResult]: Loop: 152#L17-5 main_#t~short4 := main_~i~0 >= 0; 147#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 148#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 155#L18 assume main_~i~0 < 2;call main_#t~mem5 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem5; 151#L18-2 main_~i~0 := main_~i~0 - 1; 152#L17-5 [2019-10-22 09:00:33,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:33,607 INFO L82 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2019-10-22 09:00:33,608 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:33,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854137211] [2019-10-22 09:00:33,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:33,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:33,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:33,643 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:33,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:33,647 INFO L82 PathProgramCache]: Analyzing trace with hash 43044122, now seen corresponding path program 1 times [2019-10-22 09:00:33,647 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:33,648 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805091043] [2019-10-22 09:00:33,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:33,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:33,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:33,665 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:33,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:33,669 INFO L82 PathProgramCache]: Analyzing trace with hash 268259380, now seen corresponding path program 1 times [2019-10-22 09:00:33,669 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:33,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425650615] [2019-10-22 09:00:33,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:33,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:33,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:33,709 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:34,006 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:34,006 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:34,006 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:34,006 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:34,006 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:34,006 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:34,006 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:34,007 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:34,007 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration3_Lasso [2019-10-22 09:00:34,007 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:34,007 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:34,009 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 09:00:34,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:34,016 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 09:00:34,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:34,021 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 09:00:34,024 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 09:00:34,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:34,131 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 09:00:34,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:34,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:34,138 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 09:00:34,140 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 09:00:34,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:34,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:34,377 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:34,377 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:34,377 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 09:00:34,378 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,378 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:34,381 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,381 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,381 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,382 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:34,382 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:34,382 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,383 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 09:00:34,383 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,383 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:34,384 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,384 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,384 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,384 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:34,384 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:34,385 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,385 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 09:00:34,385 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,386 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:34,386 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,386 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,386 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,386 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:34,386 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:34,391 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,392 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 09:00:34,394 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,394 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:34,395 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,395 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,395 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,395 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:34,395 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:34,396 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,396 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 09:00:34,397 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,397 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,397 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,397 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,398 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:34,398 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:34,404 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,408 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 09:00:34,409 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,409 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:34,410 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,410 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,410 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,410 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:34,410 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:34,411 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,411 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 09:00:34,412 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,412 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,412 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,412 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,413 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:34,413 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:34,419 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,421 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 09:00:34,423 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,423 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:00:34,423 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,423 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,424 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:34,424 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:34,432 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,435 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 09:00:34,436 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,436 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,436 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,436 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,437 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:34,437 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:34,439 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,439 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 09:00:34,440 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,440 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,440 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,440 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,441 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:34,442 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:34,453 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,458 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 09:00:34,458 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,459 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,459 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,459 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,462 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:34,463 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:34,501 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:34,509 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:00:34,511 INFO L444 ModelExtractionUtils]: 16 out of 19 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 09:00:34,511 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:34,512 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:34,513 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:34,514 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2019-10-22 09:00:34,518 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-10-22 09:00:34,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:34,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:34,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:34,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:00:34,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:34,589 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 09:00:34,590 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 09:00:34,590 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-10-22 09:00:34,652 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 81 states and 107 transitions. Complement of second has 9 states. [2019-10-22 09:00:34,655 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 09:00:34,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:00:34,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2019-10-22 09:00:34,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 3 letters. Loop has 5 letters. [2019-10-22 09:00:34,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:34,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 8 letters. Loop has 5 letters. [2019-10-22 09:00:34,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:34,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 3 letters. Loop has 10 letters. [2019-10-22 09:00:34,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:34,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 107 transitions. [2019-10-22 09:00:34,660 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 21 [2019-10-22 09:00:34,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 51 states and 67 transitions. [2019-10-22 09:00:34,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-10-22 09:00:34,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-10-22 09:00:34,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 67 transitions. [2019-10-22 09:00:34,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:34,667 INFO L688 BuchiCegarLoop]: Abstraction has 51 states and 67 transitions. [2019-10-22 09:00:34,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 67 transitions. [2019-10-22 09:00:34,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 28. [2019-10-22 09:00:34,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-22 09:00:34,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2019-10-22 09:00:34,672 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 40 transitions. [2019-10-22 09:00:34,672 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 40 transitions. [2019-10-22 09:00:34,673 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:00:34,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 40 transitions. [2019-10-22 09:00:34,673 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-10-22 09:00:34,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:34,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:34,674 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 09:00:34,674 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:00:34,674 INFO L791 eck$LassoCheckResult]: Stem: 325#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 320#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 321#L14-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 322#L14-4 main_~k~0 := 1; 323#L24-3 [2019-10-22 09:00:34,674 INFO L793 eck$LassoCheckResult]: Loop: 323#L24-3 assume !!(main_~k~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem7 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * (main_~k~0 - 1), 4);call main_#t~mem8 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~k~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem7 <= main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 324#L4 assume !(0 == __VERIFIER_assert_~cond); 332#L4-2 havoc main_#t~mem8;havoc main_#t~mem7; 330#L24-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 323#L24-3 [2019-10-22 09:00:34,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:34,675 INFO L82 PathProgramCache]: Analyzing trace with hash 925734, now seen corresponding path program 1 times [2019-10-22 09:00:34,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:34,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147232758] [2019-10-22 09:00:34,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:34,692 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:34,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:34,693 INFO L82 PathProgramCache]: Analyzing trace with hash 2500554, now seen corresponding path program 1 times [2019-10-22 09:00:34,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:34,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760863156] [2019-10-22 09:00:34,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:34,715 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:34,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:34,717 INFO L82 PathProgramCache]: Analyzing trace with hash 237874543, now seen corresponding path program 1 times [2019-10-22 09:00:34,717 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:34,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116617965] [2019-10-22 09:00:34,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:34,897 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 09:00:34,897 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116617965] [2019-10-22 09:00:34,897 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:34,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:00:34,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737563388] [2019-10-22 09:00:35,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:35,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:00:35,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:00:35,007 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. cyclomatic complexity: 16 Second operand 4 states. [2019-10-22 09:00:35,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:35,092 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2019-10-22 09:00:35,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:00:35,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 43 transitions. [2019-10-22 09:00:35,095 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-10-22 09:00:35,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 30 states and 41 transitions. [2019-10-22 09:00:35,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 09:00:35,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 09:00:35,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 41 transitions. [2019-10-22 09:00:35,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:35,097 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2019-10-22 09:00:35,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 41 transitions. [2019-10-22 09:00:35,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-10-22 09:00:35,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-22 09:00:35,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2019-10-22 09:00:35,099 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-10-22 09:00:35,099 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-10-22 09:00:35,099 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:00:35,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2019-10-22 09:00:35,100 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-10-22 09:00:35,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:35,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:35,100 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:35,100 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:35,101 INFO L791 eck$LassoCheckResult]: Stem: 395#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 390#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 391#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 396#L17-5 main_#t~short4 := main_~i~0 >= 0; 382#L17-1 assume !main_#t~short4; 383#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 398#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 399#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 397#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 385#L17-5 [2019-10-22 09:00:35,101 INFO L793 eck$LassoCheckResult]: Loop: 385#L17-5 main_#t~short4 := main_~i~0 >= 0; 380#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 381#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 388#L18 assume main_~i~0 < 2;call main_#t~mem5 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem5; 384#L18-2 main_~i~0 := main_~i~0 - 1; 385#L17-5 [2019-10-22 09:00:35,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:35,101 INFO L82 PathProgramCache]: Analyzing trace with hash -272098468, now seen corresponding path program 1 times [2019-10-22 09:00:35,101 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:35,101 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544004475] [2019-10-22 09:00:35,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,102 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:35,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:35,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544004475] [2019-10-22 09:00:35,124 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:35,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:00:35,125 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310762139] [2019-10-22 09:00:35,125 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:35,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:35,125 INFO L82 PathProgramCache]: Analyzing trace with hash 43044122, now seen corresponding path program 2 times [2019-10-22 09:00:35,125 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:35,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564386412] [2019-10-22 09:00:35,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:35,133 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:35,226 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:35,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:00:35,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:00:35,227 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-10-22 09:00:35,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:35,290 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2019-10-22 09:00:35,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:00:35,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 71 transitions. [2019-10-22 09:00:35,293 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2019-10-22 09:00:35,293 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 71 transitions. [2019-10-22 09:00:35,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-10-22 09:00:35,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-10-22 09:00:35,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 71 transitions. [2019-10-22 09:00:35,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:35,294 INFO L688 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-10-22 09:00:35,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 71 transitions. [2019-10-22 09:00:35,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2019-10-22 09:00:35,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-22 09:00:35,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2019-10-22 09:00:35,296 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2019-10-22 09:00:35,296 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2019-10-22 09:00:35,296 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:00:35,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 47 transitions. [2019-10-22 09:00:35,297 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-10-22 09:00:35,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:35,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:35,298 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:35,298 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:00:35,298 INFO L791 eck$LassoCheckResult]: Stem: 488#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 483#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 484#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 489#L17-5 main_#t~short4 := main_~i~0 >= 0; 504#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 501#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 493#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 494#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 490#L14-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 485#L14-4 main_~k~0 := 1; 486#L24-3 [2019-10-22 09:00:35,298 INFO L793 eck$LassoCheckResult]: Loop: 486#L24-3 assume !!(main_~k~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem7 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * (main_~k~0 - 1), 4);call main_#t~mem8 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~k~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem7 <= main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 487#L4 assume !(0 == __VERIFIER_assert_~cond); 497#L4-2 havoc main_#t~mem8;havoc main_#t~mem7; 495#L24-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 486#L24-3 [2019-10-22 09:00:35,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:35,298 INFO L82 PathProgramCache]: Analyzing trace with hash 97623763, now seen corresponding path program 1 times [2019-10-22 09:00:35,300 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:35,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564751795] [2019-10-22 09:00:35,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:35,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:35,330 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:35,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:35,335 INFO L82 PathProgramCache]: Analyzing trace with hash 2500554, now seen corresponding path program 2 times [2019-10-22 09:00:35,335 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:35,335 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378701615] [2019-10-22 09:00:35,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:35,358 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:35,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:35,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1938296220, now seen corresponding path program 1 times [2019-10-22 09:00:35,359 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:35,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672226495] [2019-10-22 09:00:35,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:35,399 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:35,670 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 79 [2019-10-22 09:00:35,824 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-10-22 09:00:35,825 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:35,826 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:35,826 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:35,826 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:35,826 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:35,826 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:35,826 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:35,826 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:35,826 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration6_Lasso [2019-10-22 09:00:35,826 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:35,827 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:35,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,835 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 09:00:35,837 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 09:00:35,839 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 09:00:35,841 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 09:00:35,843 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 09:00:35,845 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 09:00:35,846 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 09:00:35,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,035 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 09:00:36,340 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:36,340 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:36,341 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 09:00:36,341 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,341 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,342 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,342 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,342 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,342 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,342 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,343 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,343 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 09:00:36,344 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,344 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,344 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,344 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,344 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,345 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,345 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,345 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,351 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 09:00:36,351 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,351 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,351 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,351 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,352 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,352 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,352 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,352 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,352 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 09:00:36,353 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,353 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,353 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,353 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,354 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:36,354 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:36,356 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,356 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 09:00:36,357 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,357 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,357 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,357 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,357 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,357 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,357 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,358 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,358 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 09:00:36,358 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,359 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,359 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,359 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,359 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,359 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,359 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,359 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,360 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 09:00:36,360 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,360 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,360 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,360 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,360 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,360 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,360 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,361 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,361 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 09:00:36,361 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,361 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,361 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,361 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,361 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,362 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,362 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,363 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,363 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 09:00:36,363 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,364 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,364 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,364 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,364 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,364 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,364 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,365 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 09:00:36,365 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,365 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,365 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,366 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,366 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,366 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,366 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,367 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,367 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 09:00:36,367 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,368 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,368 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,368 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,368 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,368 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,368 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,369 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,369 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 09:00:36,369 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,369 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,369 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,369 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,371 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:36,371 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:36,375 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,375 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 09:00:36,376 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,376 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,376 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,376 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,377 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:36,377 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:36,380 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,380 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 09:00:36,380 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,381 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,381 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,381 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,383 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:36,383 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:36,411 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:36,443 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:00:36,443 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 09:00:36,444 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:36,444 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:36,445 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:36,445 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#v~0.base)_3, ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~#v~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_3 - 4*ULTIMATE.start_main_~k~0 - 1*ULTIMATE.start_main_~#v~0.offset Supporting invariants [] [2019-10-22 09:00:36,457 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-10-22 09:00:36,459 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:00:36,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:36,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:36,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:36,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:36,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:36,502 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 09:00:36,503 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 09:00:36,503 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 47 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-10-22 09:00:36,512 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 47 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 39 states and 52 transitions. Complement of second has 4 states. [2019-10-22 09:00:36,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:36,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:36,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2019-10-22 09:00:36,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 10 letters. Loop has 4 letters. [2019-10-22 09:00:36,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:36,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 14 letters. Loop has 4 letters. [2019-10-22 09:00:36,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:36,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 10 letters. Loop has 8 letters. [2019-10-22 09:00:36,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:36,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 52 transitions. [2019-10-22 09:00:36,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:00:36,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 30 states and 41 transitions. [2019-10-22 09:00:36,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 09:00:36,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 09:00:36,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 41 transitions. [2019-10-22 09:00:36,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:36,517 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2019-10-22 09:00:36,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 41 transitions. [2019-10-22 09:00:36,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-22 09:00:36,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-22 09:00:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2019-10-22 09:00:36,519 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2019-10-22 09:00:36,519 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2019-10-22 09:00:36,519 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:00:36,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 41 transitions. [2019-10-22 09:00:36,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:00:36,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:36,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:36,521 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-10-22 09:00:36,521 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:36,521 INFO L791 eck$LassoCheckResult]: Stem: 631#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 629#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 630#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 640#L17-5 main_#t~short4 := main_~i~0 >= 0; 657#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 650#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 644#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 645#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 641#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 642#L17-5 main_#t~short4 := main_~i~0 >= 0; 632#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 633#L17-3 [2019-10-22 09:00:36,521 INFO L793 eck$LassoCheckResult]: Loop: 633#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 647#L18 assume main_~i~0 < 2;call main_#t~mem5 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem5; 636#L18-2 main_~i~0 := main_~i~0 - 1; 637#L17-5 main_#t~short4 := main_~i~0 >= 0; 651#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 633#L17-3 [2019-10-22 09:00:36,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:36,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1268629571, now seen corresponding path program 2 times [2019-10-22 09:00:36,522 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:36,522 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710667820] [2019-10-22 09:00:36,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:36,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:36,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:36,545 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:36,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:36,545 INFO L82 PathProgramCache]: Analyzing trace with hash 53536832, now seen corresponding path program 3 times [2019-10-22 09:00:36,545 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:36,546 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727521657] [2019-10-22 09:00:36,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:36,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:36,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:36,557 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:36,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:36,557 INFO L82 PathProgramCache]: Analyzing trace with hash 2116886020, now seen corresponding path program 1 times [2019-10-22 09:00:36,558 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:36,558 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724057491] [2019-10-22 09:00:36,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:36,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:36,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:36,584 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:37,049 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 98 [2019-10-22 09:00:37,316 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-10-22 09:00:37,318 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:37,318 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:37,318 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:37,318 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:37,318 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:37,318 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:37,318 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:37,318 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:37,318 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration7_Lasso [2019-10-22 09:00:37,318 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:37,318 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:37,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,337 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 09:00:37,340 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 09:00:37,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,343 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 09:00:37,347 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 09:00:37,348 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 09:00:37,350 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 09:00:37,352 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 09:00:37,355 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 09:00:37,356 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 09:00:37,632 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-10-22 09:00:37,831 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-10-22 09:00:38,281 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-10-22 09:00:38,317 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:38,317 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:38,318 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 09:00:38,318 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:38,318 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:38,318 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:38,318 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:38,319 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:38,319 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:38,319 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:38,319 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:38,320 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 09:00:38,320 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:38,320 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:38,320 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:38,320 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:38,321 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:38,321 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:38,321 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:38,321 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:38,321 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 09:00:38,322 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:38,322 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:38,322 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:38,322 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:38,323 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:38,323 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:38,328 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:38,328 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 09:00:38,329 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:38,329 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:38,329 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:38,329 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:38,329 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:38,329 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:38,330 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:38,330 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:38,331 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 09:00:38,331 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:38,331 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:38,331 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:38,331 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:38,332 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:38,332 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:38,332 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:38,332 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:38,332 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 09:00:38,333 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:38,333 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:38,333 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:38,333 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:38,334 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:38,334 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:38,335 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:38,336 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 09:00:38,336 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:38,336 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:38,336 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:38,336 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:38,336 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:38,337 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:38,337 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:38,337 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:38,337 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 09:00:38,338 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:38,338 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:38,338 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:38,338 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:38,338 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:38,339 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:38,339 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:38,339 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:38,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:38,340 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:38,340 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:38,340 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:38,340 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:38,340 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:38,341 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:38,341 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:38,342 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:38,342 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 09:00:38,342 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:38,342 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:38,343 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:38,343 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:38,343 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:38,343 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:38,343 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:38,343 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:38,344 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 09:00:38,344 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:38,344 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:38,344 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:38,344 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:38,344 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:38,345 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:38,345 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:38,345 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:38,345 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 09:00:38,346 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:38,346 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:38,346 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:38,346 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:38,347 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:38,348 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:38,350 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:38,350 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 09:00:38,351 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:38,351 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:00:38,351 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:38,351 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:38,359 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-10-22 09:00:38,359 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 09:00:38,399 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:38,399 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 09:00:38,399 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:38,400 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:38,400 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:38,400 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:38,401 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:38,401 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:38,424 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:38,436 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:00:38,436 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-10-22 09:00:38,436 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:38,437 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:38,437 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:38,437 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-10-22 09:00:38,459 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2019-10-22 09:00:38,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:38,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:38,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:38,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:00:38,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:38,510 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 09:00:38,511 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 09:00:38,511 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-10-22 09:00:38,554 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 52 states and 69 transitions. Complement of second has 9 states. [2019-10-22 09:00:38,555 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 09:00:38,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:00:38,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2019-10-22 09:00:38,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 11 letters. Loop has 5 letters. [2019-10-22 09:00:38,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:38,555 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:00:38,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:38,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:38,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:38,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:00:38,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:38,611 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 09:00:38,611 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 09:00:38,611 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-10-22 09:00:38,667 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 55 states and 72 transitions. Complement of second has 9 states. [2019-10-22 09:00:38,667 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 09:00:38,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:00:38,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2019-10-22 09:00:38,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 11 letters. Loop has 5 letters. [2019-10-22 09:00:38,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:38,668 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:00:38,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:38,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:38,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:38,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:00:38,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:38,731 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 09:00:38,731 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 09:00:38,732 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-10-22 09:00:38,793 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 65 states and 93 transitions. Complement of second has 8 states. [2019-10-22 09:00:38,794 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 09:00:38,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:00:38,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2019-10-22 09:00:38,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 11 letters. Loop has 5 letters. [2019-10-22 09:00:38,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:38,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 16 letters. Loop has 5 letters. [2019-10-22 09:00:38,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:38,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 11 letters. Loop has 10 letters. [2019-10-22 09:00:38,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:38,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 93 transitions. [2019-10-22 09:00:38,797 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:38,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 0 states and 0 transitions. [2019-10-22 09:00:38,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:00:38,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:00:38,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:00:38,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:38,798 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:38,798 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:38,802 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:38,802 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 09:00:38,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:00:38,803 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:38,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:00:38,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:00:38 BoogieIcfgContainer [2019-10-22 09:00:38,810 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:00:38,810 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:00:38,810 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:00:38,811 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:00:38,811 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:31" (3/4) ... [2019-10-22 09:00:38,815 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:00:38,816 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:00:38,818 INFO L168 Benchmark]: Toolchain (without parser) took 7983.13 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 313.5 MB). Free memory was 939.7 MB in the beginning and 866.8 MB in the end (delta: 72.8 MB). Peak memory consumption was 386.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:38,819 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:38,819 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -191.3 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:38,820 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.57 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 09:00:38,820 INFO L168 Benchmark]: Boogie Preprocessor took 34.05 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:38,820 INFO L168 Benchmark]: RCFGBuilder took 335.06 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.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:38,821 INFO L168 Benchmark]: BuchiAutomizer took 7301.91 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.7 MB). Free memory was 1.1 GB in the beginning and 866.8 MB in the end (delta: 236.8 MB). Peak memory consumption was 413.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:38,821 INFO L168 Benchmark]: Witness Printer took 5.83 ms. Allocated memory is still 1.3 GB. Free memory is still 866.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:38,825 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 264.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -191.3 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.57 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 34.05 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 335.06 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.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7301.91 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.7 MB). Free memory was 1.1 GB in the beginning and 866.8 MB in the end (delta: 236.8 MB). Peak memory consumption was 413.5 MB. Max. memory is 11.5 GB. * Witness Printer took 5.83 ms. Allocated memory is still 1.3 GB. Free memory is still 866.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[v] + -1 * v + -4 * j and consists of 4 locations. One deterministic module has affine ranking function 2 * i + 1 and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[v] + -4 * k + -1 * v and consists of 3 locations. One nondeterministic module has affine ranking function i and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.2s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 6.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 44 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 136 SDtfs, 194 SDslu, 98 SDs, 0 SdLazy, 194 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital227 mio100 ax100 hnf99 lsp84 ukn82 mio100 lsp65 div193 bol100 ite100 ukn100 eq150 hnf61 smp88 dnf180 smp78 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 48ms VariablesStem: 8 VariablesLoop: 13 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...