./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8722e652-bb94-4310-b495-1ef7c8d39ddf/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8722e652-bb94-4310-b495-1ef7c8d39ddf/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8722e652-bb94-4310-b495-1ef7c8d39ddf/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8722e652-bb94-4310-b495-1ef7c8d39ddf/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8722e652-bb94-4310-b495-1ef7c8d39ddf/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8722e652-bb94-4310-b495-1ef7c8d39ddf/bin-2019/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 8104a25549f6efe413528ca8cc098e1acad610e4 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 07:35:07,026 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:35:07,027 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:35:07,035 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:35:07,035 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:35:07,036 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:35:07,037 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:35:07,038 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:35:07,039 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:35:07,040 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:35:07,040 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:35:07,040 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:35:07,041 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:35:07,042 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:35:07,042 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:35:07,043 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:35:07,043 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:35:07,044 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:35:07,046 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:35:07,047 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:35:07,047 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:35:07,048 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:35:07,049 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:35:07,050 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:35:07,050 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:35:07,050 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:35:07,051 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:35:07,052 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:35:07,052 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:35:07,053 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:35:07,053 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:35:07,054 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:35:07,054 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:35:07,054 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:35:07,054 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:35:07,055 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:35:07,055 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8722e652-bb94-4310-b495-1ef7c8d39ddf/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 07:35:07,066 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:35:07,066 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:35:07,067 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:35:07,067 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:35:07,067 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 07:35:07,067 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 07:35:07,068 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 07:35:07,068 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 07:35:07,068 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 07:35:07,068 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 07:35:07,068 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 07:35:07,068 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:35:07,068 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 07:35:07,068 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:35:07,069 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:35:07,069 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 07:35:07,069 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 07:35:07,069 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 07:35:07,069 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:35:07,069 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 07:35:07,069 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:35:07,070 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 07:35:07,070 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:35:07,070 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 07:35:07,070 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 07:35:07,072 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:35:07,072 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 07:35:07,072 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 07:35:07,073 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 07:35:07,073 INFO L133 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_8722e652-bb94-4310-b495-1ef7c8d39ddf/bin-2019/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 -> 8104a25549f6efe413528ca8cc098e1acad610e4 [2018-11-23 07:35:07,097 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:35:07,106 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:35:07,108 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:35:07,109 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:35:07,110 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:35:07,110 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8722e652-bb94-4310-b495-1ef7c8d39ddf/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca_true-termination.c.i [2018-11-23 07:35:07,154 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8722e652-bb94-4310-b495-1ef7c8d39ddf/bin-2019/uautomizer/data/193024717/166fabbb2cc84ba2b3d9b76aaee894af/FLAGcc94e5d4d [2018-11-23 07:35:07,521 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:35:07,521 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8722e652-bb94-4310-b495-1ef7c8d39ddf/sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca_true-termination.c.i [2018-11-23 07:35:07,531 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8722e652-bb94-4310-b495-1ef7c8d39ddf/bin-2019/uautomizer/data/193024717/166fabbb2cc84ba2b3d9b76aaee894af/FLAGcc94e5d4d [2018-11-23 07:35:07,922 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8722e652-bb94-4310-b495-1ef7c8d39ddf/bin-2019/uautomizer/data/193024717/166fabbb2cc84ba2b3d9b76aaee894af [2018-11-23 07:35:07,925 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:35:07,926 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:35:07,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:35:07,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:35:07,929 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:35:07,930 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:35:07" (1/1) ... [2018-11-23 07:35:07,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13908ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:35:07, skipping insertion in model container [2018-11-23 07:35:07,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:35:07" (1/1) ... [2018-11-23 07:35:07,939 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:35:07,967 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:35:08,148 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:35:08,155 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:35:08,224 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:35:08,251 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:35:08,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:35:08 WrapperNode [2018-11-23 07:35:08,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:35:08,252 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:35:08,252 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:35:08,252 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:35:08,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:35:08" (1/1) ... [2018-11-23 07:35:08,265 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:35:08" (1/1) ... [2018-11-23 07:35:08,279 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:35:08,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:35:08,279 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:35:08,279 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:35:08,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:35:08" (1/1) ... [2018-11-23 07:35:08,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:35:08" (1/1) ... [2018-11-23 07:35:08,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:35:08" (1/1) ... [2018-11-23 07:35:08,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:35:08" (1/1) ... [2018-11-23 07:35:08,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:35:08" (1/1) ... [2018-11-23 07:35:08,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:35:08" (1/1) ... [2018-11-23 07:35:08,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:35:08" (1/1) ... [2018-11-23 07:35:08,300 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:35:08,300 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:35:08,300 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:35:08,301 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:35:08,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:35:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8722e652-bb94-4310-b495-1ef7c8d39ddf/bin-2019/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 [2018-11-23 07:35:08,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 07:35:08,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 07:35:08,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 07:35:08,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 07:35:08,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:35:08,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:35:08,526 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:35:08,526 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 07:35:08,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:35:08 BoogieIcfgContainer [2018-11-23 07:35:08,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:35:08,527 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 07:35:08,527 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 07:35:08,530 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 07:35:08,531 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:35:08,531 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 07:35:07" (1/3) ... [2018-11-23 07:35:08,532 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6df29989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 07:35:08, skipping insertion in model container [2018-11-23 07:35:08,532 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:35:08,532 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:35:08" (2/3) ... [2018-11-23 07:35:08,532 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6df29989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 07:35:08, skipping insertion in model container [2018-11-23 07:35:08,532 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:35:08,532 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:35:08" (3/3) ... [2018-11-23 07:35:08,534 INFO L375 chiAutomizerObserver]: Analyzing ICFG insertionsort-alloca_true-termination.c.i [2018-11-23 07:35:08,569 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 07:35:08,570 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 07:35:08,570 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 07:35:08,570 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 07:35:08,570 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 07:35:08,570 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 07:35:08,570 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 07:35:08,570 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 07:35:08,570 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 07:35:08,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-23 07:35:08,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 07:35:08,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:35:08,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:35:08,597 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 07:35:08,597 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 07:35:08,598 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 07:35:08,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-23 07:35:08,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 07:35:08,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:35:08,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:35:08,599 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 07:35:08,599 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 07:35:08,604 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 16#L560true assume !(main_~array_size~0 < 1); 5#L560-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 6#L550-3true [2018-11-23 07:35:08,605 INFO L796 eck$LassoCheckResult]: Loop: 6#L550-3true assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 8#L553-6true assume !true; 9#L553-7true call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 3#L550-2true insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 6#L550-3true [2018-11-23 07:35:08,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:35:08,608 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-23 07:35:08,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:35:08,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:35:08,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:35:08,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:35:08,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:35:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:35:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:35:08,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:35:08,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1465782, now seen corresponding path program 1 times [2018-11-23 07:35:08,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:35:08,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:35:08,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:35:08,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:35:08,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:35:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:35:08,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:35:08,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:35:08,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 07:35:08,710 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 07:35:08,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 07:35:08,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 07:35:08,720 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2018-11-23 07:35:08,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:35:08,724 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-11-23 07:35:08,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 07:35:08,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2018-11-23 07:35:08,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 07:35:08,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 14 transitions. [2018-11-23 07:35:08,729 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 07:35:08,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 07:35:08,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-23 07:35:08,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:35:08,730 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-23 07:35:08,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-23 07:35:08,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-23 07:35:08,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 07:35:08,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-23 07:35:08,749 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-23 07:35:08,749 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-23 07:35:08,749 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 07:35:08,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-11-23 07:35:08,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 07:35:08,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:35:08,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:35:08,751 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 07:35:08,751 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 07:35:08,751 INFO L794 eck$LassoCheckResult]: Stem: 45#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 42#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 43#L560 assume !(main_~array_size~0 < 1); 44#L560-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 41#L550-3 [2018-11-23 07:35:08,751 INFO L796 eck$LassoCheckResult]: Loop: 41#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 39#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 46#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 47#L553-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5; 48#L553-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 40#L550-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 41#L550-3 [2018-11-23 07:35:08,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:35:08,751 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-23 07:35:08,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:35:08,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:35:08,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:35:08,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:35:08,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:35:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:35:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:35:08,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:35:08,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338221, now seen corresponding path program 1 times [2018-11-23 07:35:08,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:35:08,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:35:08,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:35:08,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:35:08,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:35:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:35:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:35:08,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:35:08,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1897689455, now seen corresponding path program 1 times [2018-11-23 07:35:08,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:35:08,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:35:08,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:35:08,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:35:08,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:35:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:35:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:35:08,951 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2018-11-23 07:35:09,116 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:35:09,117 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:35:09,117 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:35:09,118 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:35:09,118 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:35:09,118 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:35:09,118 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:35:09,118 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:35:09,118 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-23 07:35:09,118 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:35:09,119 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:35:09,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:09,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:09,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:09,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:09,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:09,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:09,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:09,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:09,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:09,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:09,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:09,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:09,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:09,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:09,522 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:35:09,526 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:35:09,527 INFO L122 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 [2018-11-23 07:35:09,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:35:09,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:35:09,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:35:09,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:35:09,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:35:09,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:35:09,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:35:09,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:35:09,533 INFO L122 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 [2018-11-23 07:35:09,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:35:09,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:35:09,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:35:09,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:35:09,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:35:09,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:35:09,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:35:09,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:35:09,534 INFO L122 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 [2018-11-23 07:35:09,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:35:09,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:35:09,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:35:09,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:35:09,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:35:09,535 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:35:09,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:35:09,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:35:09,536 INFO L122 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 [2018-11-23 07:35:09,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:35:09,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:35:09,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:35:09,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:35:09,539 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:35:09,539 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:35:09,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:35:09,541 INFO L122 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 [2018-11-23 07:35:09,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:35:09,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:35:09,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:35:09,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:35:09,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:35:09,543 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:35:09,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:35:09,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:35:09,544 INFO L122 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 [2018-11-23 07:35:09,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:35:09,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:35:09,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:35:09,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:35:09,546 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:35:09,546 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:35:09,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:35:09,550 INFO L122 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 [2018-11-23 07:35:09,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:35:09,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:35:09,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:35:09,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:35:09,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:35:09,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:35:09,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:35:09,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:35:09,553 INFO L122 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 [2018-11-23 07:35:09,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:35:09,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:35:09,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:35:09,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:35:09,556 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:35:09,556 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:35:09,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:35:09,564 INFO L122 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 [2018-11-23 07:35:09,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:35:09,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:35:09,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:35:09,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:35:09,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:35:09,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:35:09,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:35:09,571 INFO L122 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 [2018-11-23 07:35:09,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:35:09,572 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 07:35:09,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:35:09,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:35:09,574 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:35:09,574 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:35:09,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:35:09,587 INFO L122 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 [2018-11-23 07:35:09,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:35:09,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:35:09,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:35:09,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:35:09,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:35:09,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:35:09,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:35:09,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:35:09,590 INFO L122 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 [2018-11-23 07:35:09,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:35:09,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:35:09,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:35:09,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:35:09,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:35:09,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:35:09,641 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:35:09,660 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 07:35:09,660 INFO L444 ModelExtractionUtils]: 33 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 07:35:09,662 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:35:09,664 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 07:35:09,664 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:35:09,664 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~array_size, ULTIMATE.start_insertionSort_~i~0) = 1*ULTIMATE.start_insertionSort_~array_size - 1*ULTIMATE.start_insertionSort_~i~0 Supporting invariants [] [2018-11-23 07:35:09,680 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-23 07:35:09,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:35:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:35:09,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:35:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:35:09,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:35:09,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:35:09,751 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 [2018-11-23 07:35:09,752 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-23 07:35:09,773 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 19 states and 25 transitions. Complement of second has 4 states. [2018-11-23 07:35:09,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 07:35:09,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 07:35:09,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-23 07:35:09,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-23 07:35:09,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:35:09,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-23 07:35:09,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:35:09,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-23 07:35:09,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:35:09,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 25 transitions. [2018-11-23 07:35:09,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 07:35:09,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 23 transitions. [2018-11-23 07:35:09,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 07:35:09,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 07:35:09,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2018-11-23 07:35:09,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:35:09,779 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-23 07:35:09,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2018-11-23 07:35:09,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-11-23 07:35:09,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 07:35:09,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-11-23 07:35:09,780 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-23 07:35:09,781 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-23 07:35:09,781 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 07:35:09,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2018-11-23 07:35:09,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 07:35:09,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:35:09,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:35:09,782 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 07:35:09,782 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 07:35:09,782 INFO L794 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 140#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 141#L560 assume !(main_~array_size~0 < 1); 142#L560-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 143#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 135#L553-6 [2018-11-23 07:35:09,782 INFO L796 eck$LassoCheckResult]: Loop: 135#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 144#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 147#L553-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 134#L553-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 135#L553-6 [2018-11-23 07:35:09,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:35:09,783 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-11-23 07:35:09,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:35:09,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:35:09,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:35:09,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:35:09,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:35:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:35:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:35:09,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:35:09,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 1 times [2018-11-23 07:35:09,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:35:09,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:35:09,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:35:09,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:35:09,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:35:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:35:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:35:09,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:35:09,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1185710257, now seen corresponding path program 1 times [2018-11-23 07:35:09,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:35:09,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:35:09,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:35:09,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:35:09,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:35:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:35:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:35:10,006 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:35:10,006 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:35:10,006 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:35:10,006 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:35:10,006 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:35:10,006 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:35:10,006 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:35:10,006 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:35:10,006 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-23 07:35:10,006 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:35:10,006 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:35:10,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:10,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:10,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:10,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:10,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:10,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:10,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:10,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:10,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:10,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:10,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:10,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:10,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:10,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:10,324 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:35:10,324 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:35:10,325 INFO L122 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 [2018-11-23 07:35:10,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:35:10,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:35:10,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:35:10,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:35:10,329 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:35:10,329 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:35:10,349 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:35:10,367 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-23 07:35:10,368 INFO L444 ModelExtractionUtils]: 28 out of 37 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-23 07:35:10,368 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:35:10,369 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 07:35:10,369 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:35:10,369 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0) = 1*ULTIMATE.start_insertionSort_~j~0 Supporting invariants [] [2018-11-23 07:35:10,393 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-23 07:35:10,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:35:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:35:10,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:35:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:35:10,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:35:10,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:35:10,464 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 [2018-11-23 07:35:10,464 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-23 07:35:10,507 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 47 states and 62 transitions. Complement of second has 9 states. [2018-11-23 07:35:10,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 07:35:10,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 07:35:10,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-11-23 07:35:10,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-23 07:35:10,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:35:10,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-23 07:35:10,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:35:10,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-23 07:35:10,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:35:10,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 62 transitions. [2018-11-23 07:35:10,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 07:35:10,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 30 states and 40 transitions. [2018-11-23 07:35:10,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 07:35:10,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-23 07:35:10,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-11-23 07:35:10,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:35:10,515 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-11-23 07:35:10,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-11-23 07:35:10,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2018-11-23 07:35:10,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 07:35:10,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2018-11-23 07:35:10,519 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-11-23 07:35:10,519 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-11-23 07:35:10,519 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 07:35:10,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2018-11-23 07:35:10,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 07:35:10,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:35:10,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:35:10,522 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:35:10,522 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 07:35:10,522 INFO L794 eck$LassoCheckResult]: Stem: 281#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 274#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 275#L560 assume !(main_~array_size~0 < 1); 276#L560-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 277#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 271#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 283#L553-1 assume !insertionSort_#t~short6; 284#L553-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5; 285#L553-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 272#L550-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 273#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 269#L553-6 [2018-11-23 07:35:10,522 INFO L796 eck$LassoCheckResult]: Loop: 269#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 278#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 282#L553-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 268#L553-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 269#L553-6 [2018-11-23 07:35:10,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:35:10,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1303016098, now seen corresponding path program 1 times [2018-11-23 07:35:10,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:35:10,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:35:10,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:35:10,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:35:10,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:35:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:35:10,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:35:10,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:35:10,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:35:10,562 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:35:10,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:35:10,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 2 times [2018-11-23 07:35:10,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:35:10,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:35:10,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:35:10,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:35:10,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:35:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:35:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:35:10,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:35:10,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:35:10,630 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-23 07:35:10,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:35:10,666 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2018-11-23 07:35:10,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 07:35:10,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2018-11-23 07:35:10,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 07:35:10,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 43 transitions. [2018-11-23 07:35:10,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 07:35:10,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-23 07:35:10,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2018-11-23 07:35:10,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:35:10,669 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-11-23 07:35:10,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2018-11-23 07:35:10,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2018-11-23 07:35:10,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 07:35:10,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2018-11-23 07:35:10,671 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-11-23 07:35:10,671 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-11-23 07:35:10,671 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 07:35:10,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2018-11-23 07:35:10,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 07:35:10,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:35:10,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:35:10,672 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:35:10,672 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 07:35:10,672 INFO L794 eck$LassoCheckResult]: Stem: 350#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 341#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 342#L560 assume !(main_~array_size~0 < 1); 343#L560-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 344#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 346#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 347#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 352#L553-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5; 353#L553-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 339#L550-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 340#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 336#L553-6 [2018-11-23 07:35:10,672 INFO L796 eck$LassoCheckResult]: Loop: 336#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 345#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 351#L553-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 335#L553-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 336#L553-6 [2018-11-23 07:35:10,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:35:10,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1301169056, now seen corresponding path program 2 times [2018-11-23 07:35:10,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:35:10,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:35:10,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:35:10,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:35:10,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:35:10,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:35:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:35:10,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:35:10,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 3 times [2018-11-23 07:35:10,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:35:10,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:35:10,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:35:10,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:35:10,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:35:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:35:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:35:10,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:35:10,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1886560891, now seen corresponding path program 1 times [2018-11-23 07:35:10,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:35:10,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:35:10,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:35:10,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:35:10,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:35:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:35:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:35:10,935 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 85 [2018-11-23 07:35:10,979 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:35:10,979 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:35:10,979 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:35:10,979 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:35:10,979 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:35:10,979 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:35:10,979 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:35:10,979 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:35:10,979 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-23 07:35:10,979 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:35:10,979 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:35:10,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:10,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:10,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:10,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:10,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:11,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:11,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:11,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:11,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:11,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:11,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:11,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:11,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:11,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:35:11,297 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:35:11,297 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:35:11,297 INFO L122 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 [2018-11-23 07:35:11,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:35:11,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:35:11,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:35:11,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:35:11,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:35:11,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:35:11,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:35:11,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:35:11,299 INFO L122 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 [2018-11-23 07:35:11,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:35:11,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:35:11,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:35:11,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:35:11,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:35:11,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:35:11,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:35:11,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:35:11,301 INFO L122 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 [2018-11-23 07:35:11,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:35:11,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:35:11,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:35:11,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:35:11,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:35:11,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:35:11,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:35:11,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:35:11,308 INFO L122 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 [2018-11-23 07:35:11,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:35:11,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:35:11,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:35:11,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:35:11,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:35:11,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:35:11,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:35:11,311 INFO L122 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 [2018-11-23 07:35:11,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:35:11,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:35:11,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:35:11,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:35:11,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:35:11,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:35:11,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:35:11,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:35:11,313 INFO L122 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 [2018-11-23 07:35:11,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:35:11,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:35:11,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:35:11,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:35:11,314 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:35:11,314 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:35:11,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:35:11,317 INFO L122 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 [2018-11-23 07:35:11,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:35:11,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:35:11,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:35:11,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:35:11,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:35:11,320 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:35:11,329 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:35:11,335 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 07:35:11,335 INFO L444 ModelExtractionUtils]: 33 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 07:35:11,336 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:35:11,336 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 07:35:11,336 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:35:11,336 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0) = 1*ULTIMATE.start_insertionSort_~j~0 Supporting invariants [] [2018-11-23 07:35:11,363 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-23 07:35:11,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:35:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:35:11,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:35:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:35:11,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:35:11,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:35:11,406 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 [2018-11-23 07:35:11,406 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-23 07:35:11,437 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 48 states and 62 transitions. Complement of second has 9 states. [2018-11-23 07:35:11,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 07:35:11,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 07:35:11,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-11-23 07:35:11,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-23 07:35:11,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:35:11,438 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 07:35:11,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:35:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:35:11,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:35:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:35:11,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:35:11,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:35:11,484 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 [2018-11-23 07:35:11,484 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-23 07:35:11,524 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 48 states and 62 transitions. Complement of second has 9 states. [2018-11-23 07:35:11,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 07:35:11,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 07:35:11,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-11-23 07:35:11,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-23 07:35:11,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:35:11,526 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 07:35:11,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:35:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:35:11,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:35:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:35:11,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:35:11,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:35:11,562 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 [2018-11-23 07:35:11,562 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-23 07:35:11,590 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 56 states and 75 transitions. Complement of second has 8 states. [2018-11-23 07:35:11,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 07:35:11,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 07:35:11,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-23 07:35:11,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-23 07:35:11,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:35:11,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-23 07:35:11,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:35:11,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 8 letters. [2018-11-23 07:35:11,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:35:11,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 75 transitions. [2018-11-23 07:35:11,594 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 07:35:11,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 0 states and 0 transitions. [2018-11-23 07:35:11,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 07:35:11,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 07:35:11,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 07:35:11,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:35:11,594 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 07:35:11,595 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 07:35:11,595 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 07:35:11,595 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 07:35:11,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 07:35:11,595 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 07:35:11,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 07:35:11,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 07:35:11 BoogieIcfgContainer [2018-11-23 07:35:11,599 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 07:35:11,600 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:35:11,600 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:35:11,600 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:35:11,600 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:35:08" (3/4) ... [2018-11-23 07:35:11,603 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 07:35:11,603 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:35:11,603 INFO L168 Benchmark]: Toolchain (without parser) took 3678.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.3 MB). Free memory was 955.4 MB in the beginning and 862.3 MB in the end (delta: 93.1 MB). Peak memory consumption was 293.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:35:11,604 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:35:11,604 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -143.7 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2018-11-23 07:35:11,605 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.21 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:35:11,605 INFO L168 Benchmark]: Boogie Preprocessor took 21.05 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. [2018-11-23 07:35:11,605 INFO L168 Benchmark]: RCFGBuilder took 226.57 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: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-11-23 07:35:11,606 INFO L168 Benchmark]: BuchiAutomizer took 3071.96 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 88.6 MB). Free memory was 1.1 GB in the beginning and 862.3 MB in the end (delta: 215.9 MB). Peak memory consumption was 304.5 MB. Max. memory is 11.5 GB. [2018-11-23 07:35:11,606 INFO L168 Benchmark]: Witness Printer took 3.10 ms. Allocated memory is still 1.2 GB. Free memory is still 862.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:35:11,608 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 325.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -143.7 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.21 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.05 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 226.57 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: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3071.96 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 88.6 MB). Free memory was 1.1 GB in the beginning and 862.3 MB in the end (delta: 215.9 MB). Peak memory consumption was 304.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.10 ms. Allocated memory is still 1.2 GB. Free memory is still 862.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One deterministic module has affine ranking function j and consists of 5 locations. One nondeterministic module has affine ranking function j and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 2.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 82 SDtfs, 116 SDslu, 43 SDs, 0 SdLazy, 130 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital163 mio100 ax111 hnf99 lsp86 ukn75 mio100 lsp65 div100 bol100 ite100 ukn100 eq180 hnf84 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...