./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/run_dir_363a6a7c-6bd4-4d0b-a27a-bf5c4e0aab14/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_363a6a7c-6bd4-4d0b-a27a-bf5c4e0aab14/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_363a6a7c-6bd4-4d0b-a27a-bf5c4e0aab14/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_363a6a7c-6bd4-4d0b-a27a-bf5c4e0aab14/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/insertion_sort-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_363a6a7c-6bd4-4d0b-a27a-bf5c4e0aab14/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_363a6a7c-6bd4-4d0b-a27a-bf5c4e0aab14/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-11-15 20:01:41,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:01:41,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:01:41,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:01:41,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:01:41,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:01:41,349 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:01:41,359 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:01:41,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:01:41,366 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:01:41,367 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:01:41,368 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:01:41,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:01:41,369 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:01:41,369 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:01:41,370 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:01:41,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:01:41,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:01:41,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:01:41,374 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:01:41,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:01:41,378 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:01:41,381 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:01:41,382 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:01:41,385 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:01:41,386 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:01:41,386 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:01:41,387 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:01:41,388 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:01:41,390 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:01:41,390 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:01:41,390 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:01:41,391 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:01:41,391 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:01:41,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:01:41,395 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:01:41,395 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:01:41,395 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:01:41,396 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:01:41,396 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:01:41,397 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:01:41,398 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_363a6a7c-6bd4-4d0b-a27a-bf5c4e0aab14/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 20:01:41,424 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:01:41,425 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:01:41,426 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:01:41,426 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:01:41,426 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:01:41,426 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 20:01:41,427 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 20:01:41,427 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 20:01:41,427 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 20:01:41,427 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 20:01:41,427 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 20:01:41,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:01:41,428 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:01:41,428 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:01:41,428 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:01:41,428 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:01:41,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:01:41,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 20:01:41,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 20:01:41,429 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 20:01:41,429 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:01:41,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:01:41,430 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 20:01:41,430 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:01:41,430 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 20:01:41,430 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:01:41,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:01:41,431 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 20:01:41,431 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:01:41,431 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:01:41,433 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 20:01:41,436 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 20:01:41,436 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/run_dir_363a6a7c-6bd4-4d0b-a27a-bf5c4e0aab14/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-11-15 20:01:41,471 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:01:41,486 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:01:41,490 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:01:41,491 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:01:41,491 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:01:41,492 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_363a6a7c-6bd4-4d0b-a27a-bf5c4e0aab14/bin/uautomizer/../../sv-benchmarks/c/loops/insertion_sort-1.c [2019-11-15 20:01:41,551 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_363a6a7c-6bd4-4d0b-a27a-bf5c4e0aab14/bin/uautomizer/data/3ec35c8e8/a9b9a03e5fb842b39edf5a98db92b282/FLAG4cbd8ec96 [2019-11-15 20:01:41,925 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:01:41,925 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_363a6a7c-6bd4-4d0b-a27a-bf5c4e0aab14/sv-benchmarks/c/loops/insertion_sort-1.c [2019-11-15 20:01:41,930 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_363a6a7c-6bd4-4d0b-a27a-bf5c4e0aab14/bin/uautomizer/data/3ec35c8e8/a9b9a03e5fb842b39edf5a98db92b282/FLAG4cbd8ec96 [2019-11-15 20:01:42,359 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_363a6a7c-6bd4-4d0b-a27a-bf5c4e0aab14/bin/uautomizer/data/3ec35c8e8/a9b9a03e5fb842b39edf5a98db92b282 [2019-11-15 20:01:42,362 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:01:42,364 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:01:42,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:01:42,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:01:42,372 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:01:42,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:01:42" (1/1) ... [2019-11-15 20:01:42,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@250ff41f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:01:42, skipping insertion in model container [2019-11-15 20:01:42,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:01:42" (1/1) ... [2019-11-15 20:01:42,381 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:01:42,395 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:01:42,585 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:01:42,590 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:01:42,611 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:01:42,628 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:01:42,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:01:42 WrapperNode [2019-11-15 20:01:42,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:01:42,630 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:01:42,630 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:01:42,630 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:01:42,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:01:42" (1/1) ... [2019-11-15 20:01:42,645 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:01:42" (1/1) ... [2019-11-15 20:01:42,662 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:01:42,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:01:42,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:01:42,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:01:42,671 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:01:42" (1/1) ... [2019-11-15 20:01:42,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:01:42" (1/1) ... [2019-11-15 20:01:42,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:01:42" (1/1) ... [2019-11-15 20:01:42,674 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:01:42" (1/1) ... [2019-11-15 20:01:42,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:01:42" (1/1) ... [2019-11-15 20:01:42,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:01:42" (1/1) ... [2019-11-15 20:01:42,687 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:01:42" (1/1) ... [2019-11-15 20:01:42,689 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:01:42,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:01:42,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:01:42,690 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:01:42,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:01:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_363a6a7c-6bd4-4d0b-a27a-bf5c4e0aab14/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-11-15 20:01:42,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:01:42,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:01:42,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:01:42,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:01:42,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:01:42,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:01:43,075 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:01:43,075 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 20:01:43,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:01:43 BoogieIcfgContainer [2019-11-15 20:01:43,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:01:43,077 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 20:01:43,077 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 20:01:43,080 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 20:01:43,082 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:01:43,082 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 08:01:42" (1/3) ... [2019-11-15 20:01:43,083 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@339e51e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:01:43, skipping insertion in model container [2019-11-15 20:01:43,083 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:01:43,083 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:01:42" (2/3) ... [2019-11-15 20:01:43,084 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@339e51e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:01:43, skipping insertion in model container [2019-11-15 20:01:43,084 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:01:43,084 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:01:43" (3/3) ... [2019-11-15 20:01:43,086 INFO L371 chiAutomizerObserver]: Analyzing ICFG insertion_sort-1.c [2019-11-15 20:01:43,123 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 20:01:43,123 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 20:01:43,124 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 20:01:43,124 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:01:43,124 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:01:43,124 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 20:01:43,124 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:01:43,124 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 20:01:43,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-15 20:01:43,154 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-11-15 20:01:43,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:01:43,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:01:43,159 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:01:43,159 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 20:01:43,159 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 20:01:43,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-15 20:01:43,161 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-11-15 20:01:43,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:01:43,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:01:43,162 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:01:43,162 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 20:01:43,167 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-11-15 20:01:43,167 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-11-15 20:01:43,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:43,172 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 20:01:43,177 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:43,177 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006524767] [2019-11-15 20:01:43,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:43,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:43,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:43,287 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:43,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:43,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1256252, now seen corresponding path program 1 times [2019-11-15 20:01:43,289 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:43,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016915447] [2019-11-15 20:01:43,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:43,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:43,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:01:43,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:01:43,322 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016915447] [2019-11-15 20:01:43,323 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:01:43,323 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:01:43,323 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633134034] [2019-11-15 20:01:43,328 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:01:43,329 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:01:43,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 20:01:43,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 20:01:43,344 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-11-15 20:01:43,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:01:43,350 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-11-15 20:01:43,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 20:01:43,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2019-11-15 20:01:43,353 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-11-15 20:01:43,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 19 transitions. [2019-11-15 20:01:43,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-15 20:01:43,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-15 20:01:43,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-11-15 20:01:43,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:01:43,358 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-15 20:01:43,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-11-15 20:01:43,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-15 20:01:43,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 20:01:43,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-11-15 20:01:43,384 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-15 20:01:43,384 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-15 20:01:43,384 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 20:01:43,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-11-15 20:01:43,385 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-11-15 20:01:43,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:01:43,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:01:43,386 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:01:43,386 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 20:01:43,387 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-11-15 20:01:43,387 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~short4;havoc main_#t~mem3; 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-11-15 20:01:43,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:43,387 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-15 20:01:43,388 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:43,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170772697] [2019-11-15 20:01:43,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:43,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:43,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:43,411 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:43,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:43,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1188208494, now seen corresponding path program 1 times [2019-11-15 20:01:43,412 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:43,412 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411139275] [2019-11-15 20:01:43,412 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:43,412 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:43,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:43,462 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:43,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:43,463 INFO L82 PathProgramCache]: Analyzing trace with hash 268257712, now seen corresponding path program 1 times [2019-11-15 20:01:43,463 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:43,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818458740] [2019-11-15 20:01:43,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:43,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:43,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:43,528 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:43,737 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-11-15 20:01:43,962 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-11-15 20:01:43,973 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:01:43,974 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:01:43,975 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:01:43,982 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:01:43,984 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:01:43,984 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:01:43,984 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:01:43,984 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:01:43,984 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration2_Lasso [2019-11-15 20:01:43,984 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:01:43,985 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:01:44,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:44,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-11-15 20:01:44,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:44,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:44,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:44,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:44,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-11-15 20:01:44,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-11-15 20:01:44,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:44,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:44,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:44,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:44,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:44,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:44,483 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-11-15 20:01:44,772 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-11-15 20:01:44,857 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:01:44,862 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:01:44,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:44,865 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:44,866 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:44,866 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:44,867 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:44,867 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:44,869 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:44,869 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:44,871 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:44,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:44,872 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:44,872 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:44,873 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:44,873 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:44,873 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:44,874 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:44,874 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:44,875 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:44,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:44,876 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:44,877 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:44,877 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:44,877 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:44,877 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:44,878 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:44,878 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:44,879 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:44,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:44,880 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:44,880 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:44,881 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:44,881 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:44,881 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:44,881 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:44,882 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:44,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:44,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:44,884 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:44,884 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:44,884 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:44,884 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:44,885 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:44,885 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:44,885 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:44,886 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:44,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:44,887 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:44,888 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:44,888 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:44,888 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:44,888 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:44,889 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:44,889 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:44,890 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:44,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:44,891 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:44,891 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:44,892 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:44,892 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:44,892 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:44,893 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:44,893 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:44,894 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:44,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:44,895 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:44,895 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:44,895 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:44,895 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:44,898 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:01:44,898 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:01:44,901 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:44,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:44,917 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:44,917 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:44,917 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:44,917 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:44,917 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:44,918 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:44,918 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:44,921 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:44,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:44,923 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:44,923 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:44,923 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:44,923 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:44,923 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:44,924 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:44,924 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:44,925 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:44,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:44,926 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:44,926 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:44,926 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:44,927 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:44,929 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:01:44,929 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:01:44,940 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:44,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:44,941 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:44,942 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 20:01:44,942 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:44,942 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:44,970 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 20:01:44,971 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:01:45,127 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:01:45,223 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 20:01:45,223 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 20:01:45,226 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:01:45,229 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:01:45,229 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:01:45,230 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-11-15 20:01:45,247 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-11-15 20:01:45,255 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 20:01:45,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:01:45,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:01:45,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:01:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:01:45,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:01:45,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:01:45,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:01:45,338 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 20:01:45,339 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-15 20:01:45,403 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-11-15 20:01:45,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 20:01:45,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:01:45,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-11-15 20:01:45,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 2 letters. Loop has 6 letters. [2019-11-15 20:01:45,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:01:45,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 8 letters. Loop has 6 letters. [2019-11-15 20:01:45,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:01:45,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 2 letters. Loop has 12 letters. [2019-11-15 20:01:45,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:01:45,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 40 transitions. [2019-11-15 20:01:45,412 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 20:01:45,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 22 states and 31 transitions. [2019-11-15 20:01:45,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 20:01:45,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 20:01:45,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2019-11-15 20:01:45,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:01:45,414 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-11-15 20:01:45,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2019-11-15 20:01:45,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-11-15 20:01:45,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-15 20:01:45,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2019-11-15 20:01:45,417 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-11-15 20:01:45,417 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-11-15 20:01:45,418 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 20:01:45,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2019-11-15 20:01:45,419 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 20:01:45,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:01:45,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:01:45,419 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 20:01:45,420 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 20:01:45,420 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-11-15 20:01:45,420 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~short4;havoc main_#t~mem3; 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-11-15 20:01:45,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:45,421 INFO L82 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2019-11-15 20:01:45,421 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:45,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131162797] [2019-11-15 20:01:45,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:45,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:45,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:45,446 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:45,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:45,448 INFO L82 PathProgramCache]: Analyzing trace with hash 43044122, now seen corresponding path program 1 times [2019-11-15 20:01:45,448 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:45,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920335121] [2019-11-15 20:01:45,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:45,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:45,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:45,473 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:45,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:45,475 INFO L82 PathProgramCache]: Analyzing trace with hash 268259380, now seen corresponding path program 1 times [2019-11-15 20:01:45,475 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:45,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359126783] [2019-11-15 20:01:45,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:45,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:45,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:45,529 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:45,804 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-11-15 20:01:45,941 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-11-15 20:01:45,943 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:01:45,943 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:01:45,943 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:01:45,943 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:01:45,943 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:01:45,943 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:01:45,943 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:01:45,944 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:01:45,944 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration3_Lasso [2019-11-15 20:01:45,944 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:01:45,944 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:01:45,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:45,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:45,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:45,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:45,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:45,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:45,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:46,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:46,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:46,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:46,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:46,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:46,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:46,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:46,333 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:01:46,333 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:01:46,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:46,334 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:46,334 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:46,334 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:46,334 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:46,334 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:46,335 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:46,335 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:46,335 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:46,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-11-15 20:01:46,336 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:46,336 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:46,336 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:46,337 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:46,337 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:46,337 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:46,337 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:46,338 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:46,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:46,338 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:46,338 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:46,339 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:46,339 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:46,339 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:46,339 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:46,339 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:46,340 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:46,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-11-15 20:01:46,341 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:46,342 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:46,342 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:46,342 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:46,342 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:46,343 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:46,343 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:46,343 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:46,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-11-15 20:01:46,344 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:46,345 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:46,345 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:46,345 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:46,346 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:01:46,346 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:01:46,348 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:46,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:46,349 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:46,349 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:46,349 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:46,349 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:46,350 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:46,350 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:46,350 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:46,351 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:46,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-11-15 20:01:46,351 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:46,352 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:46,352 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:46,352 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:46,353 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:01:46,353 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:01:46,357 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:46,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-11-15 20:01:46,358 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:46,359 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 20:01:46,359 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:46,359 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:46,360 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 20:01:46,361 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:01:46,364 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:46,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-11-15 20:01:46,365 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:46,366 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:46,366 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:46,366 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:46,367 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:01:46,367 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:01:46,369 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:46,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-11-15 20:01:46,370 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:46,370 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:46,370 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:46,370 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:46,372 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:01:46,372 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:01:46,378 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:46,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:46,379 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:46,379 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:46,380 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:46,380 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:46,382 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:01:46,382 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:01:46,417 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:01:46,430 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:01:46,434 INFO L444 ModelExtractionUtils]: 16 out of 19 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 20:01:46,435 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:01:46,436 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:01:46,436 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:01:46,436 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-11-15 20:01:46,445 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-11-15 20:01:46,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:01:46,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:01:46,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:01:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:01:46,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 20:01:46,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:01:46,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:01:46,533 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 20:01:46,533 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-15 20:01:46,600 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-11-15 20:01:46,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 20:01:46,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 20:01:46,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2019-11-15 20:01:46,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 3 letters. Loop has 5 letters. [2019-11-15 20:01:46,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:01:46,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 8 letters. Loop has 5 letters. [2019-11-15 20:01:46,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:01:46,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 3 letters. Loop has 10 letters. [2019-11-15 20:01:46,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:01:46,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 107 transitions. [2019-11-15 20:01:46,611 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 21 [2019-11-15 20:01:46,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 51 states and 67 transitions. [2019-11-15 20:01:46,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-15 20:01:46,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-15 20:01:46,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 67 transitions. [2019-11-15 20:01:46,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:01:46,617 INFO L688 BuchiCegarLoop]: Abstraction has 51 states and 67 transitions. [2019-11-15 20:01:46,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 67 transitions. [2019-11-15 20:01:46,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 28. [2019-11-15 20:01:46,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 20:01:46,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2019-11-15 20:01:46,627 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 40 transitions. [2019-11-15 20:01:46,627 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 40 transitions. [2019-11-15 20:01:46,627 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 20:01:46,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 40 transitions. [2019-11-15 20:01:46,629 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 20:01:46,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:01:46,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:01:46,629 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 20:01:46,630 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 20:01:46,630 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-11-15 20:01:46,630 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~mem7;havoc main_#t~mem8; 330#L24-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 323#L24-3 [2019-11-15 20:01:46,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:46,632 INFO L82 PathProgramCache]: Analyzing trace with hash 925734, now seen corresponding path program 1 times [2019-11-15 20:01:46,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:46,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86241615] [2019-11-15 20:01:46,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:46,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:46,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:46,654 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:46,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:46,656 INFO L82 PathProgramCache]: Analyzing trace with hash 2500554, now seen corresponding path program 1 times [2019-11-15 20:01:46,657 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:46,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968880757] [2019-11-15 20:01:46,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:46,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:46,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:46,678 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:46,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:46,680 INFO L82 PathProgramCache]: Analyzing trace with hash 237874543, now seen corresponding path program 1 times [2019-11-15 20:01:46,680 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:46,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213785472] [2019-11-15 20:01:46,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:46,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:46,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:46,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:01:46,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:01:46,880 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213785472] [2019-11-15 20:01:46,880 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:01:46,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:01:46,880 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881676839] [2019-11-15 20:01:47,022 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:01:47,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:01:47,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:01:47,022 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. cyclomatic complexity: 16 Second operand 4 states. [2019-11-15 20:01:47,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:01:47,129 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2019-11-15 20:01:47,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:01:47,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 43 transitions. [2019-11-15 20:01:47,130 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 20:01:47,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 30 states and 41 transitions. [2019-11-15 20:01:47,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 20:01:47,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 20:01:47,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 41 transitions. [2019-11-15 20:01:47,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:01:47,131 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2019-11-15 20:01:47,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 41 transitions. [2019-11-15 20:01:47,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-11-15 20:01:47,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 20:01:47,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2019-11-15 20:01:47,134 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-11-15 20:01:47,134 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-11-15 20:01:47,134 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 20:01:47,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2019-11-15 20:01:47,135 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 20:01:47,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:01:47,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:01:47,135 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:01:47,135 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 20:01:47,135 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~short4;havoc main_#t~mem3; 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-11-15 20:01:47,136 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~short4;havoc main_#t~mem3; 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-11-15 20:01:47,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:47,136 INFO L82 PathProgramCache]: Analyzing trace with hash -272098468, now seen corresponding path program 1 times [2019-11-15 20:01:47,136 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:47,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361434568] [2019-11-15 20:01:47,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:47,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:47,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:01:47,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:01:47,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361434568] [2019-11-15 20:01:47,163 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:01:47,163 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:01:47,163 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812178588] [2019-11-15 20:01:47,164 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:01:47,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:47,164 INFO L82 PathProgramCache]: Analyzing trace with hash 43044122, now seen corresponding path program 2 times [2019-11-15 20:01:47,164 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:47,164 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19618244] [2019-11-15 20:01:47,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:47,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:47,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:47,172 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:47,286 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:01:47,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:01:47,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:01:47,286 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-11-15 20:01:47,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:01:47,351 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2019-11-15 20:01:47,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:01:47,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 71 transitions. [2019-11-15 20:01:47,352 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2019-11-15 20:01:47,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 71 transitions. [2019-11-15 20:01:47,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-15 20:01:47,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-15 20:01:47,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 71 transitions. [2019-11-15 20:01:47,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:01:47,353 INFO L688 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-11-15 20:01:47,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 71 transitions. [2019-11-15 20:01:47,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2019-11-15 20:01:47,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-15 20:01:47,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2019-11-15 20:01:47,356 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2019-11-15 20:01:47,357 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2019-11-15 20:01:47,357 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 20:01:47,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 47 transitions. [2019-11-15 20:01:47,357 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 20:01:47,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:01:47,357 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:01:47,358 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:01:47,358 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 20:01:47,358 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~short4;havoc main_#t~mem3; 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-11-15 20:01:47,358 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~mem7;havoc main_#t~mem8; 495#L24-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 486#L24-3 [2019-11-15 20:01:47,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:47,358 INFO L82 PathProgramCache]: Analyzing trace with hash 97623763, now seen corresponding path program 1 times [2019-11-15 20:01:47,359 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:47,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737495893] [2019-11-15 20:01:47,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:47,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:47,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:47,379 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:47,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:47,380 INFO L82 PathProgramCache]: Analyzing trace with hash 2500554, now seen corresponding path program 2 times [2019-11-15 20:01:47,380 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:47,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447707520] [2019-11-15 20:01:47,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:47,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:47,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:47,390 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:47,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:47,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1938296220, now seen corresponding path program 1 times [2019-11-15 20:01:47,391 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:47,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791644296] [2019-11-15 20:01:47,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:47,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:47,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:47,421 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:47,769 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 79 [2019-11-15 20:01:47,955 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-11-15 20:01:47,957 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:01:47,957 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:01:47,957 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:01:47,957 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:01:47,957 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:01:47,957 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:01:47,958 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:01:47,958 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:01:47,958 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration6_Lasso [2019-11-15 20:01:47,958 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:01:47,958 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:01:47,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:47,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:47,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:47,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:47,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:47,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:47,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:47,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:47,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:47,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:47,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:47,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:48,179 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-11-15 20:01:48,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:48,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:48,578 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:01:48,578 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:01:48,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:48,579 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:48,579 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:48,580 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:48,580 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:48,580 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:48,580 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:48,580 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:48,581 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:48,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:48,581 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:48,581 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:48,581 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:48,582 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:48,582 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:48,582 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:48,582 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:48,582 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:48,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:48,583 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:48,583 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:48,583 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:48,583 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:48,584 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:48,584 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:48,584 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:48,584 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:48,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:48,586 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:48,586 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:48,586 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:48,586 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:48,587 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:01:48,587 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:01:48,589 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:48,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:48,590 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:48,590 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:48,590 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:48,590 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:48,590 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:48,591 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:48,591 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:48,591 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:48,592 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:48,592 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:48,592 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:48,592 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:48,593 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:48,593 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:48,593 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:48,593 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:48,594 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:48,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:48,594 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:48,595 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:48,595 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:48,595 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:48,595 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:48,595 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:48,595 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:48,596 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:48,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:48,597 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:48,597 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:48,597 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:48,597 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:48,597 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:48,598 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:48,598 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:48,599 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:48,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:48,600 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:48,600 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:48,600 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:48,601 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:48,601 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:48,601 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:48,601 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:48,602 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:48,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:48,602 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:48,603 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:48,603 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:48,603 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:48,603 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:48,603 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:48,603 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:48,604 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:48,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:48,605 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:48,605 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:48,605 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:48,605 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:48,605 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:48,606 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:48,606 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:48,606 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:48,607 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:48,607 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:48,607 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:48,607 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:48,608 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:48,609 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:01:48,609 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:01:48,613 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:48,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:48,614 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:48,614 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:48,615 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:48,615 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:48,616 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:01:48,616 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:01:48,619 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:48,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:48,619 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:48,620 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:48,620 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:48,620 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:48,623 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:01:48,623 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:01:48,651 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:01:48,685 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 20:01:48,685 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 20:01:48,685 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:01:48,686 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:01:48,686 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:01:48,687 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-11-15 20:01:48,708 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-11-15 20:01:48,709 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 20:01:48,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:01:48,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:01:48,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:01:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:01:48,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:01:48,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:01:48,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:01:48,754 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 20:01:48,754 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 47 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-11-15 20:01:48,765 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-11-15 20:01:48,765 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-11-15 20:01:48,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:01:48,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2019-11-15 20:01:48,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-15 20:01:48,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:01:48,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 14 letters. Loop has 4 letters. [2019-11-15 20:01:48,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:01:48,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 10 letters. Loop has 8 letters. [2019-11-15 20:01:48,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:01:48,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 52 transitions. [2019-11-15 20:01:48,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:01:48,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 30 states and 41 transitions. [2019-11-15 20:01:48,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 20:01:48,769 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 20:01:48,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 41 transitions. [2019-11-15 20:01:48,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:01:48,769 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2019-11-15 20:01:48,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 41 transitions. [2019-11-15 20:01:48,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-15 20:01:48,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-15 20:01:48,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2019-11-15 20:01:48,771 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2019-11-15 20:01:48,771 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2019-11-15 20:01:48,771 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 20:01:48,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 41 transitions. [2019-11-15 20:01:48,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:01:48,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:01:48,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:01:48,772 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-11-15 20:01:48,772 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 20:01:48,773 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~short4;havoc main_#t~mem3; 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-11-15 20:01:48,773 INFO L793 eck$LassoCheckResult]: Loop: 633#L17-3 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 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-11-15 20:01:48,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:48,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1268629571, now seen corresponding path program 2 times [2019-11-15 20:01:48,773 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:48,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371865517] [2019-11-15 20:01:48,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:48,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:48,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:48,796 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:48,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:48,797 INFO L82 PathProgramCache]: Analyzing trace with hash 53536832, now seen corresponding path program 3 times [2019-11-15 20:01:48,797 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:48,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858380691] [2019-11-15 20:01:48,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:48,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:48,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:48,804 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:48,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:48,805 INFO L82 PathProgramCache]: Analyzing trace with hash 2116886020, now seen corresponding path program 1 times [2019-11-15 20:01:48,805 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:48,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075904190] [2019-11-15 20:01:48,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:48,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:48,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:48,830 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:48,938 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-11-15 20:01:49,289 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 98 [2019-11-15 20:01:49,556 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-11-15 20:01:49,557 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:01:49,557 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:01:49,557 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:01:49,558 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:01:49,558 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:01:49,558 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:01:49,558 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:01:49,558 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:01:49,558 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration7_Lasso [2019-11-15 20:01:49,558 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:01:49,558 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:01:49,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:49,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:49,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:49,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:49,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:49,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:49,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:49,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:49,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:49,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:49,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:49,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:49,927 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-11-15 20:01:50,164 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-11-15 20:01:50,561 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-11-15 20:01:50,761 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-11-15 20:01:50,807 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:01:50,807 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:01:50,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:50,808 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:50,808 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:50,808 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:50,808 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:50,809 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:50,809 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:50,809 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:50,810 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:50,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:50,811 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:50,811 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:50,811 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:50,811 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:50,811 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:50,812 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:50,812 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:50,812 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:50,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:50,813 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:50,813 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:50,813 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:50,813 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:50,814 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:01:50,814 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:01:50,815 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:50,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:50,816 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:50,816 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:50,816 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:50,817 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:50,817 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:50,817 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:50,817 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:50,818 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:50,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:50,818 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:50,819 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:50,819 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:50,819 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:50,819 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:50,819 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:50,819 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:50,820 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:50,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:50,821 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:50,821 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:50,821 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:50,821 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:50,822 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:01:50,822 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:01:50,823 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:50,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:50,824 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:50,824 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:50,824 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:50,824 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:50,824 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:50,825 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:50,825 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:50,825 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:50,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:50,826 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:50,826 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:50,826 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:50,826 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:50,826 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:50,827 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:50,827 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:50,827 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:50,828 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:50,828 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:50,828 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:50,828 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:50,828 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:50,829 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:50,829 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:50,829 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:50,829 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:50,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:50,830 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:50,830 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:50,830 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:50,831 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:50,831 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:50,831 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:50,831 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:50,831 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:50,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:50,832 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:50,832 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:50,833 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:50,833 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:50,833 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:50,833 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:50,833 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:50,834 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:50,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:50,834 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:50,835 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:50,835 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:50,835 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:50,836 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:01:50,836 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:01:50,838 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:50,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:50,839 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:50,839 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 20:01:50,839 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:01:50,840 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:50,847 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-15 20:01:50,848 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:01:50,894 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:50,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:50,895 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:50,895 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:50,895 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:50,896 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:50,897 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:01:50,897 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:01:50,922 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:01:50,932 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 20:01:50,932 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-15 20:01:50,933 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:01:50,933 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:01:50,934 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:01:50,934 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-15 20:01:50,969 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2019-11-15 20:01:50,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:01:51,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:01:51,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:01:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:01:51,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 20:01:51,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:01:51,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:01:51,041 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 20:01:51,042 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-11-15 20:01:51,107 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-11-15 20:01:51,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 20:01:51,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 20:01:51,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2019-11-15 20:01:51,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 11 letters. Loop has 5 letters. [2019-11-15 20:01:51,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:01:51,109 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:01:51,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:01:51,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:01:51,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:01:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:01:51,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 20:01:51,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:01:51,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:01:51,201 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-11-15 20:01:51,202 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-11-15 20:01:51,268 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-11-15 20:01:51,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 20:01:51,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 20:01:51,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2019-11-15 20:01:51,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 11 letters. Loop has 5 letters. [2019-11-15 20:01:51,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:01:51,270 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:01:51,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:01:51,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:01:51,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:01:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:01:51,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 20:01:51,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:01:51,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:01:51,340 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-11-15 20:01:51,340 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-11-15 20:01:51,414 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-11-15 20:01:51,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 20:01:51,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 20:01:51,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2019-11-15 20:01:51,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 11 letters. Loop has 5 letters. [2019-11-15 20:01:51,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:01:51,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 16 letters. Loop has 5 letters. [2019-11-15 20:01:51,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:01:51,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 11 letters. Loop has 10 letters. [2019-11-15 20:01:51,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:01:51,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 93 transitions. [2019-11-15 20:01:51,419 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:01:51,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 0 states and 0 transitions. [2019-11-15 20:01:51,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 20:01:51,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 20:01:51,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 20:01:51,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:01:51,419 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:01:51,419 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:01:51,419 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:01:51,419 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 20:01:51,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:01:51,420 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:01:51,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 20:01:51,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 08:01:51 BoogieIcfgContainer [2019-11-15 20:01:51,426 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 20:01:51,426 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:01:51,426 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:01:51,426 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:01:51,427 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:01:43" (3/4) ... [2019-11-15 20:01:51,429 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 20:01:51,429 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:01:51,431 INFO L168 Benchmark]: Toolchain (without parser) took 9067.29 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 242.7 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -247.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:01:51,431 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:01:51,432 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -196.0 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:01:51,432 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:01:51,433 INFO L168 Benchmark]: Boogie Preprocessor took 27.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:01:51,433 INFO L168 Benchmark]: RCFGBuilder took 386.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:01:51,434 INFO L168 Benchmark]: BuchiAutomizer took 8348.56 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 90.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -73.8 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:01:51,434 INFO L168 Benchmark]: Witness Printer took 3.46 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:01:51,438 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 264.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -196.0 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.60 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 27.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 386.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8348.56 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 90.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -73.8 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.46 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. 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 8.3s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 7.1s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. 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: 55ms 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...