./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_275eb0f5-721c-45de-a037-fb6e10f19130/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_275eb0f5-721c-45de-a037-fb6e10f19130/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_275eb0f5-721c-45de-a037-fb6e10f19130/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_275eb0f5-721c-45de-a037-fb6e10f19130/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i -s /tmp/vcloud-vcloud-master/worker/working_dir_275eb0f5-721c-45de-a037-fb6e10f19130/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_275eb0f5-721c-45de-a037-fb6e10f19130/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 64bit --witnessprinter.graph.data.programhash 647da5540d24322bf98da85423c1800dc68ed16f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:02:26,763 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:02:26,764 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:02:26,774 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:02:26,775 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:02:26,776 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:02:26,777 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:02:26,778 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:02:26,780 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:02:26,781 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:02:26,781 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:02:26,782 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:02:26,783 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:02:26,783 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:02:26,784 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:02:26,785 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:02:26,786 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:02:26,787 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:02:26,788 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:02:26,790 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:02:26,791 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:02:26,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:02:26,793 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:02:26,794 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:02:26,796 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:02:26,796 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:02:26,796 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:02:26,797 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:02:26,798 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:02:26,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:02:26,798 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:02:26,799 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:02:26,800 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:02:26,800 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:02:26,801 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:02:26,801 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:02:26,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:02:26,802 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:02:26,802 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:02:26,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:02:26,804 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:02:26,804 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_275eb0f5-721c-45de-a037-fb6e10f19130/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 09:02:26,817 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:02:26,818 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:02:26,819 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:02:26,819 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:02:26,819 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:02:26,820 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:02:26,820 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:02:26,820 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:02:26,820 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:02:26,820 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:02:26,820 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:02:26,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:02:26,821 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:02:26,821 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:02:26,821 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:02:26,821 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:02:26,822 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:02:26,822 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:02:26,822 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:02:26,822 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:02:26,822 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:02:26,823 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:02:26,823 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:02:26,823 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:02:26,823 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:02:26,824 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:02:26,824 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:02:26,824 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:02:26,825 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:02:26,825 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_275eb0f5-721c-45de-a037-fb6e10f19130/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 647da5540d24322bf98da85423c1800dc68ed16f [2019-10-22 09:02:26,852 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:02:26,868 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:02:26,873 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:02:26,875 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:02:26,876 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:02:26,877 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_275eb0f5-721c-45de-a037-fb6e10f19130/bin/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2019-10-22 09:02:26,930 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_275eb0f5-721c-45de-a037-fb6e10f19130/bin/uautomizer/data/269f433ca/85e1ce96a7ba4fea88d317691fa74b22/FLAGf9d77f7bd [2019-10-22 09:02:27,331 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:02:27,332 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_275eb0f5-721c-45de-a037-fb6e10f19130/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2019-10-22 09:02:27,339 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_275eb0f5-721c-45de-a037-fb6e10f19130/bin/uautomizer/data/269f433ca/85e1ce96a7ba4fea88d317691fa74b22/FLAGf9d77f7bd [2019-10-22 09:02:27,355 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_275eb0f5-721c-45de-a037-fb6e10f19130/bin/uautomizer/data/269f433ca/85e1ce96a7ba4fea88d317691fa74b22 [2019-10-22 09:02:27,358 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:02:27,359 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:02:27,359 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:27,359 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:02:27,363 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:02:27,364 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:27" (1/1) ... [2019-10-22 09:02:27,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e106d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:27, skipping insertion in model container [2019-10-22 09:02:27,366 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:27" (1/1) ... [2019-10-22 09:02:27,373 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:02:27,390 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:27,549 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:27,560 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:27,651 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:27,665 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:27,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:27 WrapperNode [2019-10-22 09:02:27,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:27,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:27,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:27,667 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:27,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:27" (1/1) ... [2019-10-22 09:02:27,683 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:27" (1/1) ... [2019-10-22 09:02:27,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:27,702 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:27,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:27,702 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:27,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:27" (1/1) ... [2019-10-22 09:02:27,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:27" (1/1) ... [2019-10-22 09:02:27,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:27" (1/1) ... [2019-10-22 09:02:27,724 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:27" (1/1) ... [2019-10-22 09:02:27,729 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:27" (1/1) ... [2019-10-22 09:02:27,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:27" (1/1) ... [2019-10-22 09:02:27,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:27" (1/1) ... [2019-10-22 09:02:27,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:27,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:27,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:27,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:27,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_275eb0f5-721c-45de-a037-fb6e10f19130/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:27,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:02:27,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 09:02:27,831 INFO L130 BoogieDeclarations]: Found specification of procedure insertionSort [2019-10-22 09:02:27,832 INFO L138 BoogieDeclarations]: Found implementation of procedure insertionSort [2019-10-22 09:02:27,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:27,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:27,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:02:27,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:02:28,072 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:28,073 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-22 09:02:28,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:28 BoogieIcfgContainer [2019-10-22 09:02:28,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:28,075 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:02:28,075 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:02:28,079 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:02:28,080 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:28,080 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:02:27" (1/3) ... [2019-10-22 09:02:28,081 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43298fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:28, skipping insertion in model container [2019-10-22 09:02:28,081 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:28,081 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:27" (2/3) ... [2019-10-22 09:02:28,082 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43298fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:28, skipping insertion in model container [2019-10-22 09:02:28,082 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:28,082 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:28" (3/3) ... [2019-10-22 09:02:28,084 INFO L371 chiAutomizerObserver]: Analyzing ICFG insertionSort_recursive.i [2019-10-22 09:02:28,155 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:02:28,156 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:02:28,156 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:02:28,156 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:28,156 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:28,156 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:02:28,156 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:28,156 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:02:28,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-10-22 09:02:28,243 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-10-22 09:02:28,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:28,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:28,251 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 09:02:28,251 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:02:28,251 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:02:28,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-10-22 09:02:28,254 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-10-22 09:02:28,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:28,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:28,254 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 09:02:28,255 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:02:28,266 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~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 6#L28true assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 8#L33-3true [2019-10-22 09:02:28,266 INFO L793 eck$LassoCheckResult]: Loop: 8#L33-3true assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 10#L33-2true main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 8#L33-3true [2019-10-22 09:02:28,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:28,272 INFO L82 PathProgramCache]: Analyzing trace with hash 60643, now seen corresponding path program 1 times [2019-10-22 09:02:28,281 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:28,282 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857849892] [2019-10-22 09:02:28,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:28,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:28,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:28,422 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:28,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:28,424 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 1 times [2019-10-22 09:02:28,424 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:28,424 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465380645] [2019-10-22 09:02:28,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:28,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:28,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:28,452 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:28,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:28,456 INFO L82 PathProgramCache]: Analyzing trace with hash 58279397, now seen corresponding path program 1 times [2019-10-22 09:02:28,457 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:28,457 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571363561] [2019-10-22 09:02:28,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:28,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:28,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:28,502 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:28,714 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:28,715 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:28,715 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:28,715 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:28,715 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:28,715 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:28,715 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:28,716 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:28,716 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration1_Lasso [2019-10-22 09:02:28,716 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:28,716 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:28,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:28,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:28,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:28,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:28,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:28,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:29,046 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:29,051 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:29,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:29,055 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:29,055 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:29,056 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:29,056 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:29,056 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:29,058 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:29,058 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:29,061 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:29,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:29,062 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:29,063 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:29,063 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:29,063 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:29,063 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:29,064 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:29,064 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:29,065 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:29,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:29,066 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:29,066 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:29,066 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:29,066 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:29,069 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:29,069 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:29,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:29,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:29,074 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:29,075 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:29,075 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:29,075 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:29,075 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:29,076 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:29,076 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:29,077 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:29,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:29,078 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:29,078 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:02:29,079 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:29,079 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:29,082 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:02:29,082 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:29,100 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:29,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:29,101 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:29,101 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:29,101 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:29,102 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:29,104 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:29,104 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:29,118 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:29,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:29,119 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:29,120 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:29,120 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:29,120 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:29,121 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:29,122 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:29,127 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:29,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:29,128 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:29,128 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:29,128 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:29,128 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:29,129 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:29,129 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:29,129 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:29,130 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:29,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:29,131 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:29,132 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:29,132 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:29,132 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:29,136 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:29,136 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:29,242 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:29,291 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 09:02:29,292 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 09:02:29,294 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:29,296 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:29,296 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:29,297 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-10-22 09:02:29,307 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 09:02:29,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:29,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:29,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:29,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:02:29,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:29,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:29,397 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:02:29,399 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 3 states. [2019-10-22 09:02:29,454 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 3 states. Result 43 states and 57 transitions. Complement of second has 9 states. [2019-10-22 09:02:29,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:29,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2019-10-22 09:02:29,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 2 letters. [2019-10-22 09:02:29,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:29,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 09:02:29,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:29,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 4 letters. [2019-10-22 09:02:29,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:29,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-10-22 09:02:29,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 09:02:29,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2019-10-22 09:02:29,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 09:02:29,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 09:02:29,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2019-10-22 09:02:29,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:29,477 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-10-22 09:02:29,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2019-10-22 09:02:29,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-10-22 09:02:29,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 09:02:29,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-10-22 09:02:29,507 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-10-22 09:02:29,508 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-10-22 09:02:29,508 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:02:29,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-10-22 09:02:29,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 09:02:29,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:29,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:29,509 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:02:29,509 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 09:02:29,510 INFO L791 eck$LassoCheckResult]: Stem: 133#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 130#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 126#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 127#L33-3 assume !(main_~i~0 < main_~n~0); 121#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 120#insertionSortENTRY [2019-10-22 09:02:29,510 INFO L793 eck$LassoCheckResult]: Loop: 120#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 123#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 131#L15-6 assume !true; 132#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 122#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 120#insertionSortENTRY [2019-10-22 09:02:29,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:29,510 INFO L82 PathProgramCache]: Analyzing trace with hash 58279346, now seen corresponding path program 1 times [2019-10-22 09:02:29,511 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:29,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995984153] [2019-10-22 09:02:29,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:29,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:29,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:29,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:29,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995984153] [2019-10-22 09:02:29,565 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:29,565 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:29,565 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9071988] [2019-10-22 09:02:29,568 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:29,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:29,568 INFO L82 PathProgramCache]: Analyzing trace with hash 28740467, now seen corresponding path program 1 times [2019-10-22 09:02:29,569 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:29,569 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056967440] [2019-10-22 09:02:29,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:29,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:29,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:29,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:29,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056967440] [2019-10-22 09:02:29,585 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:29,585 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:29,585 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384962454] [2019-10-22 09:02:29,585 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:02:29,585 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:29,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 09:02:29,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 09:02:29,592 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 2 states. [2019-10-22 09:02:29,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:29,598 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2019-10-22 09:02:29,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 09:02:29,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2019-10-22 09:02:29,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 09:02:29,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2019-10-22 09:02:29,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 09:02:29,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 09:02:29,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-10-22 09:02:29,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:29,601 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-10-22 09:02:29,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-10-22 09:02:29,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-10-22 09:02:29,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 09:02:29,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-10-22 09:02:29,603 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-10-22 09:02:29,603 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-10-22 09:02:29,603 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:02:29,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-10-22 09:02:29,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 09:02:29,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:29,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:29,609 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:02:29,609 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:29,609 INFO L791 eck$LassoCheckResult]: Stem: 168#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 166#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 162#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 163#L33-3 assume !(main_~i~0 < main_~n~0); 157#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 156#insertionSortENTRY [2019-10-22 09:02:29,609 INFO L793 eck$LassoCheckResult]: Loop: 156#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 159#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 167#L15-6 #t~short4 := ~j~0 > 0; 160#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 161#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 169#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 158#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 156#insertionSortENTRY [2019-10-22 09:02:29,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:29,609 INFO L82 PathProgramCache]: Analyzing trace with hash 58279346, now seen corresponding path program 2 times [2019-10-22 09:02:29,610 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:29,610 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475407438] [2019-10-22 09:02:29,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:29,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:29,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:29,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:29,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475407438] [2019-10-22 09:02:29,650 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:29,650 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:29,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144107039] [2019-10-22 09:02:29,651 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:29,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:29,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1835476522, now seen corresponding path program 1 times [2019-10-22 09:02:29,651 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:29,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918322336] [2019-10-22 09:02:29,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:29,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:29,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:29,688 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:29,877 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-10-22 09:02:30,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:30,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:30,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:30,044 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-10-22 09:02:30,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:30,057 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-10-22 09:02:30,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:30,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2019-10-22 09:02:30,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 09:02:30,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2019-10-22 09:02:30,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 09:02:30,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 09:02:30,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2019-10-22 09:02:30,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:30,061 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-10-22 09:02:30,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2019-10-22 09:02:30,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-10-22 09:02:30,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 09:02:30,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-10-22 09:02:30,065 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-10-22 09:02:30,066 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-10-22 09:02:30,066 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:02:30,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2019-10-22 09:02:30,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 09:02:30,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:30,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:30,067 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:30,067 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:30,067 INFO L791 eck$LassoCheckResult]: Stem: 205#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 203#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 199#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 200#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 201#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 202#L33-3 assume !(main_~i~0 < main_~n~0); 195#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 193#insertionSortENTRY [2019-10-22 09:02:30,067 INFO L793 eck$LassoCheckResult]: Loop: 193#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 196#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 204#L15-6 #t~short4 := ~j~0 > 0; 197#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 198#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 206#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 194#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 193#insertionSortENTRY [2019-10-22 09:02:30,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:30,068 INFO L82 PathProgramCache]: Analyzing trace with hash 171927092, now seen corresponding path program 1 times [2019-10-22 09:02:30,068 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:30,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019972005] [2019-10-22 09:02:30,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:30,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:30,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:30,096 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:30,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:30,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1835476522, now seen corresponding path program 2 times [2019-10-22 09:02:30,099 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:30,099 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061396465] [2019-10-22 09:02:30,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:30,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:30,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:30,134 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:30,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:30,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1744506729, now seen corresponding path program 1 times [2019-10-22 09:02:30,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:30,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273755109] [2019-10-22 09:02:30,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:30,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:30,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:30,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:02:30,213 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273755109] [2019-10-22 09:02:30,215 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:30,215 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:02:30,216 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495697013] [2019-10-22 09:02:30,368 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-10-22 09:02:30,500 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:30,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:02:30,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:02:30,501 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-10-22 09:02:30,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:30,587 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-10-22 09:02:30,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:02:30,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2019-10-22 09:02:30,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 09:02:30,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 25 transitions. [2019-10-22 09:02:30,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-10-22 09:02:30,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-10-22 09:02:30,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2019-10-22 09:02:30,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:30,590 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-10-22 09:02:30,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2019-10-22 09:02:30,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-10-22 09:02:30,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-22 09:02:30,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-10-22 09:02:30,593 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-10-22 09:02:30,593 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-10-22 09:02:30,593 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:02:30,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2019-10-22 09:02:30,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 09:02:30,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:30,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:30,602 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:30,603 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:30,603 INFO L791 eck$LassoCheckResult]: Stem: 260#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 256#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 252#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 253#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 254#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 255#L33-3 assume !(main_~i~0 < main_~n~0); 248#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 247#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 249#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 257#L15-6 #t~short4 := ~j~0 > 0; 250#L15-1 assume !#t~short4; 251#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 261#L15-7 [2019-10-22 09:02:30,603 INFO L793 eck$LassoCheckResult]: Loop: 261#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 258#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 259#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 266#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 263#L15-6 #t~short4 := ~j~0 > 0; 265#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 264#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 261#L15-7 [2019-10-22 09:02:30,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:30,604 INFO L82 PathProgramCache]: Analyzing trace with hash -332541132, now seen corresponding path program 1 times [2019-10-22 09:02:30,604 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:30,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493569754] [2019-10-22 09:02:30,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:30,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:30,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:30,647 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:30,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:30,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 3 times [2019-10-22 09:02:30,648 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:30,648 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158115538] [2019-10-22 09:02:30,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:30,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:30,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:30,677 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:30,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:30,678 INFO L82 PathProgramCache]: Analyzing trace with hash 2143759477, now seen corresponding path program 1 times [2019-10-22 09:02:30,678 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:30,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674639497] [2019-10-22 09:02:30,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:30,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:30,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:30,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:30,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674639497] [2019-10-22 09:02:30,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302983363] [2019-10-22 09:02:30,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_275eb0f5-721c-45de-a037-fb6e10f19130/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:30,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-22 09:02:30,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:30,935 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:30,935 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:30,935 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-10-22 09:02:30,957 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392905198] [2019-10-22 09:02:31,305 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-10-22 09:02:31,365 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:31,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-22 09:02:31,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-10-22 09:02:31,366 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 16 states. [2019-10-22 09:02:31,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:31,501 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-10-22 09:02:31,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 09:02:31,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2019-10-22 09:02:31,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 09:02:31,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 23 states and 26 transitions. [2019-10-22 09:02:31,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-10-22 09:02:31,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-10-22 09:02:31,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2019-10-22 09:02:31,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:31,504 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-10-22 09:02:31,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2019-10-22 09:02:31,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-10-22 09:02:31,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-22 09:02:31,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-10-22 09:02:31,506 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-10-22 09:02:31,506 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-10-22 09:02:31,506 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:02:31,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2019-10-22 09:02:31,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 09:02:31,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:31,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:31,507 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:31,507 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:31,509 INFO L791 eck$LassoCheckResult]: Stem: 398#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 395#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 389#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 390#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 392#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 393#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 394#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 401#L33-3 assume !(main_~i~0 < main_~n~0); 387#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 391#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 404#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 403#L15-6 #t~short4 := ~j~0 > 0; 386#L15-1 assume !#t~short4; 388#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 399#L15-7 [2019-10-22 09:02:31,509 INFO L793 eck$LassoCheckResult]: Loop: 399#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 384#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 383#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 385#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 396#L15-6 #t~short4 := ~j~0 > 0; 397#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 402#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 399#L15-7 [2019-10-22 09:02:31,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:31,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1063486350, now seen corresponding path program 2 times [2019-10-22 09:02:31,510 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:31,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724910078] [2019-10-22 09:02:31,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:31,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:31,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:31,540 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:31,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:31,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 4 times [2019-10-22 09:02:31,541 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:31,541 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289354512] [2019-10-22 09:02:31,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:31,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:31,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:31,553 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:31,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:31,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1119961463, now seen corresponding path program 2 times [2019-10-22 09:02:31,553 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:31,553 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922374825] [2019-10-22 09:02:31,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:31,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:31,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:31,600 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:32,067 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2019-10-22 09:02:32,252 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2019-10-22 09:02:32,292 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:32,292 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:32,292 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:32,292 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:32,292 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:32,292 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:32,292 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:32,292 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:32,292 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration6_Lasso [2019-10-22 09:02:32,293 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:32,293 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:32,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,646 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 92 [2019-10-22 09:02:32,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:33,072 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:33,072 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:33,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:33,073 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:33,073 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:33,073 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:33,074 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:33,074 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:33,074 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:33,074 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:33,075 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:33,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:33,075 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:33,075 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:33,076 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:33,076 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:33,076 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:33,076 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:33,076 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:33,077 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:33,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:33,077 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:33,077 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:33,077 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:33,078 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:33,079 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:33,079 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:33,081 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:33,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:33,081 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:33,081 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:33,082 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:33,082 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:33,082 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:33,082 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:33,082 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:33,083 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:33,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:33,083 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:33,084 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:33,084 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:33,084 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:33,084 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:33,084 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:33,084 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:33,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:33,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:33,085 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:33,085 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:33,085 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:33,086 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:33,086 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:33,086 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:33,086 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:33,086 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:33,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:33,087 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:33,087 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:33,087 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:33,087 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:33,088 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:33,088 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:33,088 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:33,088 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:33,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:33,089 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:33,089 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:33,089 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:33,089 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:33,089 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:33,090 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:33,090 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:33,090 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:33,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:33,091 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:33,091 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:33,091 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:33,091 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:33,091 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:33,091 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:33,091 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:33,092 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:33,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:33,092 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:33,093 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:33,093 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:33,093 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:33,093 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:33,093 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:33,093 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:33,094 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:33,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:33,094 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:33,094 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:33,094 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:33,095 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:33,095 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:33,095 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:33,095 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:33,095 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:33,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:33,096 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:33,096 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:33,096 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:33,096 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:33,097 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:33,097 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:33,098 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:33,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:33,099 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:33,099 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:33,100 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:33,100 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:33,104 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:33,104 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:33,167 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:33,240 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:02:33,240 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 09:02:33,240 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:33,242 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:33,242 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:33,242 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~size, insertionSort_~j~0) = 1*insertionSort_~size - 1*insertionSort_~j~0 Supporting invariants [] [2019-10-22 09:02:33,264 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2019-10-22 09:02:33,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:33,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:02:33,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:33,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-22 09:02:33,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:33,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:33,400 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-10-22 09:02:33,400 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-10-22 09:02:33,495 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 40 states and 47 transitions. Complement of second has 16 states. [2019-10-22 09:02:33,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:33,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 09:02:33,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2019-10-22 09:02:33,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 14 letters. Loop has 7 letters. [2019-10-22 09:02:33,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:33,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 21 letters. Loop has 7 letters. [2019-10-22 09:02:33,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:33,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 14 letters. Loop has 14 letters. [2019-10-22 09:02:33,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:33,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2019-10-22 09:02:33,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 09:02:33,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 34 states and 40 transitions. [2019-10-22 09:02:33,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-10-22 09:02:33,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-10-22 09:02:33,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 40 transitions. [2019-10-22 09:02:33,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:33,501 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-10-22 09:02:33,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 40 transitions. [2019-10-22 09:02:33,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-10-22 09:02:33,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-22 09:02:33,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-10-22 09:02:33,506 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-10-22 09:02:33,506 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-10-22 09:02:33,506 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:02:33,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2019-10-22 09:02:33,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 09:02:33,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:33,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:33,507 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:33,507 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:33,507 INFO L791 eck$LassoCheckResult]: Stem: 607#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 603#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 597#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 598#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 600#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 601#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 602#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 612#L33-3 assume !(main_~i~0 < main_~n~0); 593#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 599#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 617#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 604#L15-6 #t~short4 := ~j~0 > 0; 592#L15-1 assume !#t~short4; 594#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 608#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 590#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 589#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 591#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 605#L15-6 #t~short4 := ~j~0 > 0; 606#L15-1 assume !#t~short4; 616#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 610#L15-5 [2019-10-22 09:02:33,507 INFO L793 eck$LassoCheckResult]: Loop: 610#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 611#L15-6 #t~short4 := ~j~0 > 0; 615#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 614#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 610#L15-5 [2019-10-22 09:02:33,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:33,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1119961527, now seen corresponding path program 1 times [2019-10-22 09:02:33,508 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:33,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255166234] [2019-10-22 09:02:33,508 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:33,508 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:33,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:33,525 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-22 09:02:33,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255166234] [2019-10-22 09:02:33,526 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:33,526 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:33,526 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924631992] [2019-10-22 09:02:33,526 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:33,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:33,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1526396, now seen corresponding path program 1 times [2019-10-22 09:02:33,527 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:33,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786257927] [2019-10-22 09:02:33,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:33,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:33,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:33,533 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:33,605 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:33,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:33,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:33,606 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-10-22 09:02:33,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:33,613 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-10-22 09:02:33,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:33,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 40 transitions. [2019-10-22 09:02:33,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-10-22 09:02:33,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 34 states and 39 transitions. [2019-10-22 09:02:33,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-10-22 09:02:33,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-10-22 09:02:33,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 39 transitions. [2019-10-22 09:02:33,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:33,615 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-10-22 09:02:33,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 39 transitions. [2019-10-22 09:02:33,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-22 09:02:33,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-22 09:02:33,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-10-22 09:02:33,618 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-10-22 09:02:33,618 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-10-22 09:02:33,618 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 09:02:33,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 38 transitions. [2019-10-22 09:02:33,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-10-22 09:02:33,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:33,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:33,619 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:33,619 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:33,619 INFO L791 eck$LassoCheckResult]: Stem: 681#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 674#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 669#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 670#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 671#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 672#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 673#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 675#L33-3 assume !(main_~i~0 < main_~n~0); 660#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 659#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 661#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 676#L15-6 #t~short4 := ~j~0 > 0; 665#L15-1 assume !#t~short4; 666#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 684#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 663#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 662#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 664#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 677#L15-6 #t~short4 := ~j~0 > 0; 678#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 687#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 685#L15-5 [2019-10-22 09:02:33,619 INFO L793 eck$LassoCheckResult]: Loop: 685#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 686#L15-6 #t~short4 := ~j~0 > 0; 690#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 688#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 685#L15-5 [2019-10-22 09:02:33,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:33,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1119961465, now seen corresponding path program 1 times [2019-10-22 09:02:33,620 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:33,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343566977] [2019-10-22 09:02:33,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:33,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:33,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:33,660 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:33,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:33,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1526396, now seen corresponding path program 2 times [2019-10-22 09:02:33,662 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:33,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205249721] [2019-10-22 09:02:33,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:33,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:33,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:33,669 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:33,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:33,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1796534284, now seen corresponding path program 1 times [2019-10-22 09:02:33,669 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:33,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862395133] [2019-10-22 09:02:33,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:33,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:33,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:33,731 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 09:02:33,731 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862395133] [2019-10-22 09:02:33,731 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607873557] [2019-10-22 09:02:33,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_275eb0f5-721c-45de-a037-fb6e10f19130/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:33,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 09:02:33,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:33,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:33,806 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 09:02:33,806 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:33,806 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2019-10-22 09:02:33,806 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870370961] [2019-10-22 09:02:33,881 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:33,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 09:02:33,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-10-22 09:02:33,882 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. cyclomatic complexity: 8 Second operand 12 states. [2019-10-22 09:02:34,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:34,052 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2019-10-22 09:02:34,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-22 09:02:34,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 58 transitions. [2019-10-22 09:02:34,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-10-22 09:02:34,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 58 transitions. [2019-10-22 09:02:34,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-10-22 09:02:34,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-10-22 09:02:34,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 58 transitions. [2019-10-22 09:02:34,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:34,054 INFO L688 BuchiCegarLoop]: Abstraction has 51 states and 58 transitions. [2019-10-22 09:02:34,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 58 transitions. [2019-10-22 09:02:34,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2019-10-22 09:02:34,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-22 09:02:34,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2019-10-22 09:02:34,056 INFO L711 BuchiCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-10-22 09:02:34,056 INFO L591 BuchiCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-10-22 09:02:34,057 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 09:02:34,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 48 transitions. [2019-10-22 09:02:34,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-10-22 09:02:34,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:34,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:34,058 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:34,058 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:34,058 INFO L791 eck$LassoCheckResult]: Stem: 876#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 872#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 865#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 866#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 869#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 870#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 871#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 884#L33-3 assume !(main_~i~0 < main_~n~0); 867#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 868#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 889#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 888#L15-6 #t~short4 := ~j~0 > 0; 887#L15-1 assume !#t~short4; 886#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 878#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 861#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 877#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 895#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 874#L15-6 #t~short4 := ~j~0 > 0; 875#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 880#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 881#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 873#L15-6 #t~short4 := ~j~0 > 0; 860#L15-1 assume !#t~short4; 862#L15-3 [2019-10-22 09:02:34,058 INFO L793 eck$LassoCheckResult]: Loop: 862#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 885#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 855#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 854#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 856#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 882#L15-6 #t~short4 := ~j~0 > 0; 892#L15-1 assume !#t~short4; 862#L15-3 [2019-10-22 09:02:34,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:34,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1466067936, now seen corresponding path program 2 times [2019-10-22 09:02:34,059 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:34,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750686787] [2019-10-22 09:02:34,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:34,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:34,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:34,081 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:34,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:34,081 INFO L82 PathProgramCache]: Analyzing trace with hash -497256520, now seen corresponding path program 1 times [2019-10-22 09:02:34,081 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:34,081 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838266605] [2019-10-22 09:02:34,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:34,082 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:34,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:34,088 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:34,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:34,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1939981049, now seen corresponding path program 3 times [2019-10-22 09:02:34,089 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:34,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301824754] [2019-10-22 09:02:34,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:34,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:34,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:34,155 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-22 09:02:34,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301824754] [2019-10-22 09:02:34,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104200538] [2019-10-22 09:02:34,156 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_275eb0f5-721c-45de-a037-fb6e10f19130/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:34,206 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-22 09:02:34,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:02:34,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 09:02:34,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:34,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,238 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-22 09:02:34,239 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:34,239 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 13 [2019-10-22 09:02:34,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755856986] [2019-10-22 09:02:34,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:34,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 09:02:34,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-22 09:02:34,575 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. cyclomatic complexity: 9 Second operand 14 states. [2019-10-22 09:02:34,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:34,816 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2019-10-22 09:02:34,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-22 09:02:34,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 62 transitions. [2019-10-22 09:02:34,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-10-22 09:02:34,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 62 transitions. [2019-10-22 09:02:34,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-10-22 09:02:34,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-10-22 09:02:34,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 62 transitions. [2019-10-22 09:02:34,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:34,819 INFO L688 BuchiCegarLoop]: Abstraction has 55 states and 62 transitions. [2019-10-22 09:02:34,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 62 transitions. [2019-10-22 09:02:34,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2019-10-22 09:02:34,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-22 09:02:34,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2019-10-22 09:02:34,823 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 51 transitions. [2019-10-22 09:02:34,823 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 51 transitions. [2019-10-22 09:02:34,823 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 09:02:34,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 51 transitions. [2019-10-22 09:02:34,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-10-22 09:02:34,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:34,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:34,825 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:34,825 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:34,825 INFO L791 eck$LassoCheckResult]: Stem: 1111#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1105#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 1100#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 1101#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 1102#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1103#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 1104#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1119#L33-3 assume !(main_~i~0 < main_~n~0); 1090#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 1089#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1091#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1128#L15-6 #t~short4 := ~j~0 > 0; 1127#L15-1 assume !#t~short4; 1126#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1125#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1096#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1124#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1123#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1121#L15-6 #t~short4 := ~j~0 > 0; 1122#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 1130#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 1133#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1106#L15-6 #t~short4 := ~j~0 > 0; 1095#L15-1 assume !#t~short4; 1097#L15-3 [2019-10-22 09:02:34,825 INFO L793 eck$LassoCheckResult]: Loop: 1097#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1112#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1109#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1110#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1116#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1117#L15-6 #t~short4 := ~j~0 > 0; 1131#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 1129#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 1115#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1118#L15-6 #t~short4 := ~j~0 > 0; 1132#L15-1 assume !#t~short4; 1097#L15-3 [2019-10-22 09:02:34,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:34,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1466067936, now seen corresponding path program 4 times [2019-10-22 09:02:34,825 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:34,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914812251] [2019-10-22 09:02:34,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:34,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:34,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:34,845 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:34,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:34,846 INFO L82 PathProgramCache]: Analyzing trace with hash -346675363, now seen corresponding path program 1 times [2019-10-22 09:02:34,846 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:34,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314661121] [2019-10-22 09:02:34,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:34,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:34,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:34,856 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:34,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:34,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1989274142, now seen corresponding path program 5 times [2019-10-22 09:02:34,856 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:34,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405800681] [2019-10-22 09:02:34,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:34,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:34,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:34,941 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-22 09:02:34,941 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405800681] [2019-10-22 09:02:34,941 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972776905] [2019-10-22 09:02:34,941 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_275eb0f5-721c-45de-a037-fb6e10f19130/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:34,995 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-10-22 09:02:34,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:02:34,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-22 09:02:34,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:35,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:35,042 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-22 09:02:35,042 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:35,042 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 16 [2019-10-22 09:02:35,042 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123344885] [2019-10-22 09:02:35,146 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-10-22 09:02:35,452 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-10-22 09:02:35,500 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:35,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-22 09:02:35,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-10-22 09:02:35,501 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. cyclomatic complexity: 9 Second operand 17 states. [2019-10-22 09:02:35,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:35,801 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2019-10-22 09:02:35,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-22 09:02:35,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 65 transitions. [2019-10-22 09:02:35,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2019-10-22 09:02:35,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 65 transitions. [2019-10-22 09:02:35,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2019-10-22 09:02:35,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2019-10-22 09:02:35,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 65 transitions. [2019-10-22 09:02:35,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:35,803 INFO L688 BuchiCegarLoop]: Abstraction has 59 states and 65 transitions. [2019-10-22 09:02:35,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 65 transitions. [2019-10-22 09:02:35,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2019-10-22 09:02:35,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-22 09:02:35,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2019-10-22 09:02:35,806 INFO L711 BuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-10-22 09:02:35,806 INFO L591 BuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-10-22 09:02:35,806 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 09:02:35,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 54 transitions. [2019-10-22 09:02:35,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-10-22 09:02:35,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:35,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:35,808 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:35,808 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:35,808 INFO L791 eck$LassoCheckResult]: Stem: 1375#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1369#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 1364#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 1365#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 1366#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1367#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 1368#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1382#L33-3 assume !(main_~i~0 < main_~n~0); 1354#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 1353#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1355#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1386#L15-6 #t~short4 := ~j~0 > 0; 1385#L15-1 assume !#t~short4; 1384#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1383#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1357#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1356#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1358#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1371#L15-6 #t~short4 := ~j~0 > 0; 1372#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 1390#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 1392#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1370#L15-6 #t~short4 := ~j~0 > 0; 1359#L15-1 assume !#t~short4; 1360#L15-3 [2019-10-22 09:02:35,808 INFO L793 eck$LassoCheckResult]: Loop: 1360#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1376#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1373#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1374#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1378#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1379#L15-6 #t~short4 := ~j~0 > 0; 1400#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 1399#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 1380#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1381#L15-6 #t~short4 := ~j~0 > 0; 1391#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 1388#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 1389#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1398#L15-6 #t~short4 := ~j~0 > 0; 1397#L15-1 assume !#t~short4; 1360#L15-3 [2019-10-22 09:02:35,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:35,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1466067936, now seen corresponding path program 6 times [2019-10-22 09:02:35,809 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:35,809 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331835536] [2019-10-22 09:02:35,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:35,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:35,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:35,829 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:35,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:35,829 INFO L82 PathProgramCache]: Analyzing trace with hash 2062908546, now seen corresponding path program 2 times [2019-10-22 09:02:35,829 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:35,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711631068] [2019-10-22 09:02:35,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:35,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:35,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:35,842 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:35,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:35,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1457523005, now seen corresponding path program 7 times [2019-10-22 09:02:35,842 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:35,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642365710] [2019-10-22 09:02:35,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:35,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:35,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:35,963 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 29 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 09:02:35,963 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642365710] [2019-10-22 09:02:35,964 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911179949] [2019-10-22 09:02:35,964 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_275eb0f5-721c-45de-a037-fb6e10f19130/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:36,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-22 09:02:36,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:36,171 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 40 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 09:02:36,172 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:36,172 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2019-10-22 09:02:36,172 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863215715] [2019-10-22 09:02:36,401 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 76 [2019-10-22 09:02:36,759 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-10-22 09:02:36,831 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:36,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-22 09:02:36,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2019-10-22 09:02:36,832 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. cyclomatic complexity: 9 Second operand 23 states. [2019-10-22 09:02:36,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:36,971 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2019-10-22 09:02:36,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 09:02:36,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 84 transitions. [2019-10-22 09:02:36,973 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-10-22 09:02:36,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 51 states and 57 transitions. [2019-10-22 09:02:36,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-10-22 09:02:36,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-10-22 09:02:36,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 57 transitions. [2019-10-22 09:02:36,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:36,974 INFO L688 BuchiCegarLoop]: Abstraction has 51 states and 57 transitions. [2019-10-22 09:02:36,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 57 transitions. [2019-10-22 09:02:36,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-10-22 09:02:36,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-22 09:02:36,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2019-10-22 09:02:36,977 INFO L711 BuchiCegarLoop]: Abstraction has 50 states and 56 transitions. [2019-10-22 09:02:36,977 INFO L591 BuchiCegarLoop]: Abstraction has 50 states and 56 transitions. [2019-10-22 09:02:36,977 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-10-22 09:02:36,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 56 transitions. [2019-10-22 09:02:36,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-10-22 09:02:36,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:36,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:36,978 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:36,978 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:36,978 INFO L791 eck$LassoCheckResult]: Stem: 1656#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1651#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 1644#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 1645#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 1648#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1652#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 1670#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1649#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 1650#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1662#L33-3 assume !(main_~i~0 < main_~n~0); 1646#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 1647#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1668#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1667#L15-6 #t~short4 := ~j~0 > 0; 1666#L15-1 assume !#t~short4; 1665#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1657#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1637#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1636#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1638#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1654#L15-6 #t~short4 := ~j~0 > 0; 1655#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 1669#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 1676#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1674#L15-6 #t~short4 := ~j~0 > 0; 1671#L15-1 assume !#t~short4; 1664#L15-3 [2019-10-22 09:02:36,978 INFO L793 eck$LassoCheckResult]: Loop: 1664#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1663#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1634#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1633#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1635#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1653#L15-6 #t~short4 := ~j~0 > 0; 1639#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 1640#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 1660#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1661#L15-6 #t~short4 := ~j~0 > 0; 1678#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 1673#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 1677#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1675#L15-6 #t~short4 := ~j~0 > 0; 1672#L15-1 assume !#t~short4; 1664#L15-3 [2019-10-22 09:02:36,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:36,979 INFO L82 PathProgramCache]: Analyzing trace with hash 970401822, now seen corresponding path program 8 times [2019-10-22 09:02:36,979 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:36,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175328343] [2019-10-22 09:02:36,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:36,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:36,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:37,002 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:37,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:37,002 INFO L82 PathProgramCache]: Analyzing trace with hash 2062908546, now seen corresponding path program 3 times [2019-10-22 09:02:37,002 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:37,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743778924] [2019-10-22 09:02:37,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:37,017 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:37,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:37,018 INFO L82 PathProgramCache]: Analyzing trace with hash -798001467, now seen corresponding path program 9 times [2019-10-22 09:02:37,018 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:37,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395836192] [2019-10-22 09:02:37,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:37,059 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:37,314 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 76 [2019-10-22 09:02:37,668 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-10-22 09:02:38,138 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2019-10-22 09:02:38,331 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-10-22 09:02:38,669 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 112 [2019-10-22 09:02:38,732 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:38,732 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:38,732 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:38,733 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:38,733 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:38,733 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:38,733 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:38,733 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:38,733 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration12_Lasso [2019-10-22 09:02:38,733 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:38,733 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:38,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:38,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:39,133 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-10-22 09:02:39,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:39,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:39,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:39,489 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:39,489 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:39,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:39,490 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,490 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,490 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,491 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,491 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,491 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,492 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,492 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,493 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:39,493 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,493 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,493 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,493 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,493 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,494 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,494 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,494 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,494 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:39,495 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,495 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,495 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,495 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,496 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,496 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,496 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,497 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,497 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:39,497 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,497 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,497 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,498 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,498 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,498 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,498 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,498 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:39,499 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,500 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,500 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,500 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,501 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:39,501 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:39,502 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,502 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:39,502 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,503 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,503 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,503 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,503 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,504 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,504 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,504 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:39,505 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,505 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,505 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,505 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,506 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:39,506 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:39,507 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:39,508 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,508 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,508 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,508 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,509 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,509 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,509 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,509 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:39,510 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,510 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,510 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,510 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,510 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,511 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,511 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,511 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:39,512 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,513 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,513 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,513 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,513 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,513 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,513 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,514 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:39,514 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,514 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,514 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,514 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,515 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,515 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,515 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,515 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:39,516 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,516 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,516 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,517 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,517 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,517 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,517 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,518 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:39,518 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,518 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,519 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,519 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,520 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:39,520 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:39,521 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:39,522 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,522 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,522 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,522 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,522 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,522 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,523 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,523 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:39,524 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,524 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,524 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,525 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,525 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,525 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,525 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,525 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:39,526 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,526 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,526 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,527 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,527 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,527 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,527 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,528 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:39,529 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,529 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,529 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,529 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,529 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,529 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,530 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,530 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:39,531 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,531 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,531 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,531 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,531 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,532 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,532 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,532 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:39,533 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,533 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,533 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,534 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,535 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:39,535 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:39,540 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:39,540 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,541 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,541 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,541 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,541 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,541 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,542 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,542 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:39,543 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,543 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,543 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,544 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,546 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:39,546 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:39,564 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:39,565 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,565 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,565 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,565 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,566 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:39,566 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:39,568 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:39,568 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,569 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:02:39,569 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,569 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,570 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:02:39,570 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:39,575 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:39,576 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,576 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,576 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,576 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,583 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:39,584 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:39,635 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:39,790 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2019-10-22 09:02:39,790 INFO L444 ModelExtractionUtils]: 20 out of 31 variables were initially zero. Simplification set additionally 8 variables to zero. [2019-10-22 09:02:39,791 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:39,792 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:39,793 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:39,793 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length insertionSort_#in~array.base)_2, insertionSort_~i) = 1*v_rep(select #length insertionSort_#in~array.base)_2 - 8*insertionSort_~i Supporting invariants [] [2019-10-22 09:02:39,822 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2019-10-22 09:02:39,825 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:02:39,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:39,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:02:39,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:39,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-22 09:02:39,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:46,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:46,573 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:46,573 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2019-10-22 09:02:46,573 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 56 transitions. cyclomatic complexity: 9 Second operand 12 states. [2019-10-22 09:02:59,701 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 56 transitions. cyclomatic complexity: 9. Second operand 12 states. Result 227 states and 268 transitions. Complement of second has 95 states. [2019-10-22 09:02:59,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 2 stem states 14 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:59,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-22 09:02:59,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 45 transitions. [2019-10-22 09:02:59,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 45 transitions. Stem has 26 letters. Loop has 15 letters. [2019-10-22 09:02:59,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:59,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 45 transitions. Stem has 41 letters. Loop has 15 letters. [2019-10-22 09:02:59,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:59,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 45 transitions. Stem has 26 letters. Loop has 30 letters. [2019-10-22 09:02:59,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:59,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 227 states and 268 transitions. [2019-10-22 09:02:59,716 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 54 [2019-10-22 09:02:59,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 227 states to 222 states and 263 transitions. [2019-10-22 09:02:59,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2019-10-22 09:02:59,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 93 [2019-10-22 09:02:59,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 222 states and 263 transitions. [2019-10-22 09:02:59,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:59,719 INFO L688 BuchiCegarLoop]: Abstraction has 222 states and 263 transitions. [2019-10-22 09:02:59,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 263 transitions. [2019-10-22 09:02:59,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 88. [2019-10-22 09:02:59,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-22 09:02:59,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2019-10-22 09:02:59,727 INFO L711 BuchiCegarLoop]: Abstraction has 88 states and 103 transitions. [2019-10-22 09:02:59,727 INFO L591 BuchiCegarLoop]: Abstraction has 88 states and 103 transitions. [2019-10-22 09:02:59,727 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-10-22 09:02:59,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 103 transitions. [2019-10-22 09:02:59,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2019-10-22 09:02:59,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:59,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:59,729 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:59,729 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:59,729 INFO L791 eck$LassoCheckResult]: Stem: 2239#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2230#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 2224#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 2225#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 2227#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 2228#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 2229#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 2231#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 2250#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 2249#L33-3 assume !(main_~i~0 < main_~n~0); 2218#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 2226#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2257#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 2256#L15-6 #t~short4 := ~j~0 > 0; 2217#L15-1 assume !#t~short4; 2219#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 2269#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 2237#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 2238#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2264#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 2265#L15-6 #t~short4 := ~j~0 > 0; 2285#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 2295#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 2294#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 2293#L15-6 #t~short4 := ~j~0 > 0; 2260#L15-1 assume !#t~short4; 2261#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 2240#L15-7 [2019-10-22 09:02:59,730 INFO L793 eck$LassoCheckResult]: Loop: 2240#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 2212#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 2211#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2213#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 2244#L15-6 #t~short4 := ~j~0 > 0; 2290#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 2291#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 2240#L15-7 [2019-10-22 09:02:59,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:59,730 INFO L82 PathProgramCache]: Analyzing trace with hash 17685426, now seen corresponding path program 10 times [2019-10-22 09:02:59,730 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:59,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610325701] [2019-10-22 09:02:59,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:59,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:59,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:59,753 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:59,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:59,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 5 times [2019-10-22 09:02:59,753 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:59,754 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883112170] [2019-10-22 09:02:59,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:59,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:59,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:59,762 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:59,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:59,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1495415351, now seen corresponding path program 11 times [2019-10-22 09:02:59,762 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:59,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249519842] [2019-10-22 09:02:59,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:59,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:59,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:59,790 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:00,122 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-10-22 09:03:00,602 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-10-22 09:03:00,812 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 90 [2019-10-22 09:03:01,153 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 113 [2019-10-22 09:03:01,268 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-10-22 09:03:01,271 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:03:01,271 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:03:01,271 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:03:01,271 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:03:01,271 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:03:01,271 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:03:01,271 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:03:01,271 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:03:01,271 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration13_Lasso [2019-10-22 09:03:01,271 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:03:01,272 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:03:01,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,543 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-10-22 09:03:01,738 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-10-22 09:03:01,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,114 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:03:02,115 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:03:02,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:03:02,116 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:02,116 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:02,116 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:02,116 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:02,116 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:02,116 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:02,116 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:02,117 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:02,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:03:02,118 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:02,118 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:02,118 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:02,118 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:02,118 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:02,118 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:02,118 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:02,119 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:02,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:03:02,119 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:02,120 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:02,120 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:02,120 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:02,120 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:02,121 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:02,121 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:02,121 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:02,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:03:02,122 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:02,122 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:02,122 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:02,122 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:02,122 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:02,122 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:02,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:02,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:03:02,125 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:02,125 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:02,125 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:02,125 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:02,127 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:02,127 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:02,138 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:02,139 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:03:02,140 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:02,140 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:02,140 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:02,140 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:02,141 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:02,141 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:02,142 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:02,142 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:03:02,142 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:02,142 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:02,143 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:02,143 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:02,143 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:02,143 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:02,143 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:02,144 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:02,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:03:02,144 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:02,145 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:02,145 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:02,145 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:02,145 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:02,145 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:02,146 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:02,146 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:03:02,147 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:02,147 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:02,147 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:02,147 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:02,150 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:02,150 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:02,244 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:03:02,282 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 09:03:02,282 INFO L444 ModelExtractionUtils]: 23 out of 31 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 09:03:02,283 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:03:02,284 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:03:02,284 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:03:02,284 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length insertionSort_~array.base)_3, insertionSort_~i, insertionSort_~array.offset) = 1*v_rep(select #length insertionSort_~array.base)_3 - 4*insertionSort_~i - 1*insertionSort_~array.offset Supporting invariants [] [2019-10-22 09:03:02,310 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2019-10-22 09:03:02,311 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:03:02,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:02,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:03:02,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:02,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-22 09:03:02,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:02,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:02,424 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-10-22 09:03:02,425 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 88 states and 103 transitions. cyclomatic complexity: 20 Second operand 6 states. [2019-10-22 09:03:02,535 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 88 states and 103 transitions. cyclomatic complexity: 20. Second operand 6 states. Result 153 states and 183 transitions. Complement of second has 14 states. [2019-10-22 09:03:02,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-10-22 09:03:02,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 09:03:02,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2019-10-22 09:03:02,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 27 letters. Loop has 7 letters. [2019-10-22 09:03:02,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:02,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 34 letters. Loop has 7 letters. [2019-10-22 09:03:02,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:02,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 27 letters. Loop has 14 letters. [2019-10-22 09:03:02,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:02,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 183 transitions. [2019-10-22 09:03:02,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:03:02,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 104 states and 121 transitions. [2019-10-22 09:03:02,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-10-22 09:03:02,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-10-22 09:03:02,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 121 transitions. [2019-10-22 09:03:02,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:03:02,540 INFO L688 BuchiCegarLoop]: Abstraction has 104 states and 121 transitions. [2019-10-22 09:03:02,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 121 transitions. [2019-10-22 09:03:02,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 93. [2019-10-22 09:03:02,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-22 09:03:02,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 110 transitions. [2019-10-22 09:03:02,545 INFO L711 BuchiCegarLoop]: Abstraction has 93 states and 110 transitions. [2019-10-22 09:03:02,545 INFO L591 BuchiCegarLoop]: Abstraction has 93 states and 110 transitions. [2019-10-22 09:03:02,545 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-10-22 09:03:02,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 110 transitions. [2019-10-22 09:03:02,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:03:02,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:03:02,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:03:02,546 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:02,547 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:03:02,547 INFO L791 eck$LassoCheckResult]: Stem: 2645#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2640#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 2635#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 2636#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 2637#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 2638#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 2639#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 2641#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 2657#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 2656#L33-3 assume !(main_~i~0 < main_~n~0); 2625#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 2624#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2626#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 2655#L15-6 #t~short4 := ~j~0 > 0; 2679#L15-1 assume !#t~short4; 2677#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 2678#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 2699#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 2716#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2715#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 2711#L15-6 #t~short4 := ~j~0 > 0; 2698#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 2700#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 2709#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 2631#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 2707#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2705#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 2703#L15-6 #t~short4 := ~j~0 > 0; 2643#L15-1 [2019-10-22 09:03:02,547 INFO L793 eck$LassoCheckResult]: Loop: 2643#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 2651#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 2652#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 2642#L15-6 #t~short4 := ~j~0 > 0; 2643#L15-1 [2019-10-22 09:03:02,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:02,547 INFO L82 PathProgramCache]: Analyzing trace with hash 496161610, now seen corresponding path program 3 times [2019-10-22 09:03:02,547 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:02,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046564053] [2019-10-22 09:03:02,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:02,570 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:02,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:02,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1239356, now seen corresponding path program 3 times [2019-10-22 09:03:02,570 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:02,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442557319] [2019-10-22 09:03:02,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:02,575 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:02,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:02,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1509363707, now seen corresponding path program 12 times [2019-10-22 09:03:02,576 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:02,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369896314] [2019-10-22 09:03:02,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:02,604 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:03,097 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-10-22 09:03:03,489 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 100 [2019-10-22 09:03:03,703 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 90 [2019-10-22 09:03:04,108 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 114 [2019-10-22 09:03:04,188 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:03:04,189 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:03:04,189 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:03:04,189 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:03:04,189 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:03:04,189 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:03:04,189 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:03:04,189 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:03:04,189 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration14_Lasso [2019-10-22 09:03:04,189 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:03:04,189 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:03:04,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:04,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:04,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:04,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:04,392 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-10-22 09:03:04,573 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-10-22 09:03:04,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:04,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-10-22 09:03:04,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:04,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:04,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:04,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:04,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-10-22 09:03:04,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:04,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:04,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-10-22 09:03:04,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:04,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-10-22 09:03:04,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:04,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-10-22 09:03:04,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:04,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-10-22 09:03:04,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:04,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:04,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-10-22 09:03:04,997 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:03:04,997 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:03:04,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:03:04,998 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:04,998 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:04,998 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:04,998 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:04,999 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:04,999 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:04,999 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:05,000 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:05,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:03:05,000 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:05,000 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:05,001 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:05,001 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:05,001 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:05,001 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:05,001 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:05,002 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:05,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:03:05,002 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:05,003 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:05,003 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:05,003 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:05,003 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:05,003 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:05,004 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:05,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:03:05,005 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:05,005 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:05,005 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:05,005 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:05,007 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:05,007 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:05,012 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:05,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:03:05,013 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:05,013 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:05,013 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:05,014 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:05,014 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:05,014 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:05,014 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:05,014 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:05,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:03:05,015 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:05,015 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:05,015 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:05,015 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:05,016 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:05,016 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:05,019 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:05,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:03:05,020 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:05,020 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:03:05,020 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:05,020 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:05,021 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:03:05,021 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:05,024 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:05,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:03:05,024 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:05,025 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:05,025 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:03:05,025 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:05,030 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-10-22 09:03:05,030 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 09:03:05,120 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:03:05,266 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-10-22 09:03:05,266 INFO L444 ModelExtractionUtils]: 44 out of 56 variables were initially zero. Simplification set additionally 9 variables to zero. [2019-10-22 09:03:05,267 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:03:05,267 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-10-22 09:03:05,268 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:03:05,268 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~array.offset, insertionSort_~j~0) = 1*insertionSort_~array.offset + 4*insertionSort_~j~0 Supporting invariants [] [2019-10-22 09:03:05,311 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2019-10-22 09:03:05,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:05,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:03:05,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:05,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:03:05,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:05,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:05,386 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 09:03:05,386 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 110 transitions. cyclomatic complexity: 23 Second operand 5 states. [2019-10-22 09:03:05,393 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 110 transitions. cyclomatic complexity: 23. Second operand 5 states. Result 98 states and 115 transitions. Complement of second has 8 states. [2019-10-22 09:03:05,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:03:05,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:03:05,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-10-22 09:03:05,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 28 letters. Loop has 4 letters. [2019-10-22 09:03:05,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:05,394 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:03:05,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:05,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:03:05,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:05,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:03:05,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:05,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:05,462 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 09:03:05,462 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 110 transitions. cyclomatic complexity: 23 Second operand 5 states. [2019-10-22 09:03:05,470 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 110 transitions. cyclomatic complexity: 23. Second operand 5 states. Result 98 states and 115 transitions. Complement of second has 8 states. [2019-10-22 09:03:05,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:03:05,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:03:05,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-10-22 09:03:05,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 28 letters. Loop has 4 letters. [2019-10-22 09:03:05,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:05,480 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:03:05,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:05,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:03:05,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:05,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:03:05,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:05,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:05,554 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 09:03:05,554 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 110 transitions. cyclomatic complexity: 23 Second operand 5 states. [2019-10-22 09:03:05,574 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 110 transitions. cyclomatic complexity: 23. Second operand 5 states. Result 162 states and 199 transitions. Complement of second has 9 states. [2019-10-22 09:03:05,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:03:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:03:05,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2019-10-22 09:03:05,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 28 letters. Loop has 4 letters. [2019-10-22 09:03:05,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:05,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 32 letters. Loop has 4 letters. [2019-10-22 09:03:05,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:05,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 28 letters. Loop has 8 letters. [2019-10-22 09:03:05,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:05,576 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 199 transitions. [2019-10-22 09:03:05,577 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:03:05,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 0 states and 0 transitions. [2019-10-22 09:03:05,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:03:05,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:03:05,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:03:05,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:03:05,577 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:03:05,577 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:03:05,578 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:03:05,578 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-10-22 09:03:05,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:03:05,578 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:03:05,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:03:05,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:03:05 BoogieIcfgContainer [2019-10-22 09:03:05,585 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:03:05,586 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:03:05,586 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:03:05,586 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:03:05,586 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:28" (3/4) ... [2019-10-22 09:03:05,589 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:03:05,590 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:03:05,591 INFO L168 Benchmark]: Toolchain (without parser) took 38232.23 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 450.4 MB). Free memory was 948.5 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 263.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:05,591 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:03:05,591 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 948.5 MB in the beginning and 1.1 GB in the end (delta: -162.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:05,595 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.02 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:03:05,595 INFO L168 Benchmark]: Boogie Preprocessor took 49.33 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:03:05,595 INFO L168 Benchmark]: RCFGBuilder took 322.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:05,595 INFO L168 Benchmark]: BuchiAutomizer took 37510.57 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 329.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -49.6 MB). Peak memory consumption was 280.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:05,596 INFO L168 Benchmark]: Witness Printer took 4.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:03:05,597 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.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 307.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 948.5 MB in the beginning and 1.1 GB in the end (delta: -162.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.02 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.33 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 322.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 37510.57 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 329.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -49.6 MB). Peak memory consumption was 280.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 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 14 terminating modules (9 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. One deterministic module has affine ranking function size + -1 * j and consists of 7 locations. One deterministic module has affine ranking function unknown-#length-unknown[array] + -8 * i and consists of 17 locations. One deterministic module has affine ranking function unknown-#length-unknown[array] + -4 * i + -1 * array and consists of 6 locations. One nondeterministic module has affine ranking function array + 4 * j and consists of 4 locations. 9 modules have a trivial ranking function, the largest among these consists of 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 37.4s and 15 iterations. TraceHistogramMax:3. Analysis of lassos took 15.2s. Construction of modules took 0.6s. Büchi inclusion checks took 21.1s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 183 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 93 states and ocurred in iteration 13. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/10 HoareTripleCheckerStatistics: 223 SDtfs, 340 SDslu, 662 SDs, 0 SdLazy, 920 SolverSat, 165 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc6 concLT0 SILN0 SILU2 SILI1 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital279 mio100 ax100 hnf99 lsp94 ukn76 mio100 lsp56 div100 bol101 ite100 ukn100 eq168 hnf87 smp95 dnf124 smp92 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 243ms VariablesStem: 10 VariablesLoop: 8 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...