./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/insertionsort-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/array-memsafety/insertionsort-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c911d3bfcad41488f605dca082dbd47805d189ae ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:11:07,172 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:11:07,174 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:11:07,188 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:11:07,189 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:11:07,190 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:11:07,191 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:11:07,194 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:11:07,196 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:11:07,196 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:11:07,197 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:11:07,198 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:11:07,199 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:11:07,200 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:11:07,201 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:11:07,202 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:11:07,203 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:11:07,206 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:11:07,208 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:11:07,210 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:11:07,211 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:11:07,212 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:11:07,215 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:11:07,215 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:11:07,216 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:11:07,217 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:11:07,218 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:11:07,219 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:11:07,220 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:11:07,222 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:11:07,222 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:11:07,223 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:11:07,223 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:11:07,223 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:11:07,225 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:11:07,226 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:11:07,226 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:11:07,243 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:11:07,244 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:11:07,245 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:11:07,245 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:11:07,246 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:11:07,246 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:11:07,246 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:11:07,246 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:11:07,246 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:11:07,247 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:11:07,247 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:11:07,247 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:11:07,247 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:11:07,247 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:11:07,247 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:11:07,249 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:11:07,249 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:11:07,249 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:11:07,249 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:11:07,250 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:11:07,250 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:11:07,250 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:11:07,251 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:11:07,251 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:11:07,251 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:11:07,251 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:11:07,251 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:11:07,252 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:11:07,253 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:11:07,253 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:11:07,253 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:11:07,254 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:11:07,254 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c911d3bfcad41488f605dca082dbd47805d189ae [2018-11-29 00:11:07,309 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:11:07,325 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:11:07,330 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:11:07,332 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:11:07,332 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:11:07,333 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/insertionsort-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:11:07,399 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa1340dfb/830104ab3c714554bf8d1c8042c62139/FLAGdee143fbc [2018-11-29 00:11:07,996 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:11:07,997 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/insertionsort-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:11:08,016 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa1340dfb/830104ab3c714554bf8d1c8042c62139/FLAGdee143fbc [2018-11-29 00:11:08,242 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa1340dfb/830104ab3c714554bf8d1c8042c62139 [2018-11-29 00:11:08,246 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:11:08,248 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:11:08,249 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:11:08,249 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:11:08,253 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:11:08,254 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:11:08" (1/1) ... [2018-11-29 00:11:08,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6272bb4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:08, skipping insertion in model container [2018-11-29 00:11:08,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:11:08" (1/1) ... [2018-11-29 00:11:08,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:11:08,313 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:11:08,723 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:11:08,740 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:11:08,809 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:11:08,874 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:11:08,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:08 WrapperNode [2018-11-29 00:11:08,875 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:11:08,876 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:11:08,876 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:11:08,876 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:11:08,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:08" (1/1) ... [2018-11-29 00:11:08,990 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:08" (1/1) ... [2018-11-29 00:11:09,013 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:11:09,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:11:09,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:11:09,014 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:11:09,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:08" (1/1) ... [2018-11-29 00:11:09,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:08" (1/1) ... [2018-11-29 00:11:09,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:08" (1/1) ... [2018-11-29 00:11:09,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:08" (1/1) ... [2018-11-29 00:11:09,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:08" (1/1) ... [2018-11-29 00:11:09,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:08" (1/1) ... [2018-11-29 00:11:09,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:08" (1/1) ... [2018-11-29 00:11:09,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:11:09,044 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:11:09,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:11:09,048 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:11:09,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-29 00:11:09,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-29 00:11:09,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-29 00:11:09,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-29 00:11:09,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-29 00:11:09,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:11:09,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:11:09,488 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:11:09,488 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-29 00:11:09,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:09 BoogieIcfgContainer [2018-11-29 00:11:09,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:11:09,490 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:11:09,490 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:11:09,494 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:11:09,495 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:09,495 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:11:08" (1/3) ... [2018-11-29 00:11:09,496 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6bb37455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:11:09, skipping insertion in model container [2018-11-29 00:11:09,496 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:09,497 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:08" (2/3) ... [2018-11-29 00:11:09,497 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6bb37455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:11:09, skipping insertion in model container [2018-11-29 00:11:09,497 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:09,497 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:09" (3/3) ... [2018-11-29 00:11:09,499 INFO L375 chiAutomizerObserver]: Analyzing ICFG insertionsort-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:11:09,561 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:11:09,562 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:11:09,562 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:11:09,562 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:11:09,563 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:11:09,563 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:11:09,563 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:11:09,563 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:11:09,564 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:11:09,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-29 00:11:09,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-29 00:11:09,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:09,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:09,614 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-29 00:11:09,615 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:11:09,615 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:11:09,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-29 00:11:09,617 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-29 00:11:09,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:09,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:09,618 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-29 00:11:09,619 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:11:09,627 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#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; 7#L553true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 11#L553-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; 12#L543-3true [2018-11-29 00:11:09,627 INFO L796 eck$LassoCheckResult]: Loop: 12#L543-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; 14#L546-6true assume !true; 16#L546-7true call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 9#L543-2true insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 12#L543-3true [2018-11-29 00:11:09,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:09,634 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-29 00:11:09,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:09,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:09,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:09,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:09,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:09,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:09,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1465782, now seen corresponding path program 1 times [2018-11-29 00:11:09,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:09,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:09,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:09,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:09,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:09,817 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-29 00:11:09,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:11:09,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-29 00:11:09,824 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:11:09,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-29 00:11:09,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-29 00:11:09,846 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2018-11-29 00:11:09,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:11:09,852 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-11-29 00:11:09,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-29 00:11:09,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2018-11-29 00:11:09,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-29 00:11:09,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 14 transitions. [2018-11-29 00:11:09,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-29 00:11:09,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-29 00:11:09,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-29 00:11:09,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:09,866 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-29 00:11:09,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-29 00:11:09,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-29 00:11:09,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-29 00:11:09,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-29 00:11:09,898 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-29 00:11:09,898 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-29 00:11:09,898 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:11:09,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-11-29 00:11:09,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-29 00:11:09,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:09,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:09,901 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-29 00:11:09,901 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-29 00:11:09,901 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#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; 39#L553 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 40#L553-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; 45#L543-3 [2018-11-29 00:11:09,901 INFO L796 eck$LassoCheckResult]: Loop: 45#L543-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; 43#L546-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 46#L546-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#L546-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5; 48#L546-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 44#L543-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 45#L543-3 [2018-11-29 00:11:09,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:09,903 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-29 00:11:09,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:09,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:09,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:09,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:09,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:09,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:09,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338221, now seen corresponding path program 1 times [2018-11-29 00:11:09,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:09,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:09,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:09,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:09,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:10,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:10,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1897689455, now seen corresponding path program 1 times [2018-11-29 00:11:10,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:10,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:10,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:10,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:10,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:10,580 WARN L180 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2018-11-29 00:11:10,800 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-29 00:11:10,938 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-29 00:11:10,959 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:11:10,960 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:11:10,960 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:11:10,961 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:11:10,961 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:11:10,961 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:11:10,961 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:11:10,961 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:11:10,962 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-29 00:11:10,962 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:11:10,962 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:11: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-29 00:11:11,004 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-29 00:11:11,007 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-29 00:11:11,010 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-29 00:11:11,014 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-29 00:11:11,019 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-29 00:11:11,024 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-29 00:11:11,625 WARN L180 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-11-29 00:11:11,746 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-29 00:11:11,749 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-29 00:11:11,753 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-29 00:11:11,755 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-29 00:11:12,278 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:11:12,284 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:11:12,286 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-29 00:11:12,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:12,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:12,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:12,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,295 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-29 00:11:12,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:12,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:12,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:12,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,298 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-29 00:11:12,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:12,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:12,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:12,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,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-29 00:11:12,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:12,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:12,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:12,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,304 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-29 00:11:12,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,308 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:12,308 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:12,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,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-29 00:11:12,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:12,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:12,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:12,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,316 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-29 00:11:12,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:12,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:12,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:12,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,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-29 00:11:12,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,330 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:12,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:12,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,345 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-29 00:11:12,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,351 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:12,352 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:12,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,364 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-29 00:11:12,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,365 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:11:12,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,376 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:11:12,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:12,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,416 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-29 00:11:12,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:12,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,424 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:12,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:12,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,425 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-29 00:11:12,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,437 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:12,438 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:12,576 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:11:12,646 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-29 00:11:12,646 INFO L444 ModelExtractionUtils]: 27 out of 37 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-29 00:11:12,652 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:11:12,653 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:11:12,654 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:11:12,655 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-29 00:11:12,744 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-29 00:11:12,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:12,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:12,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:12,897 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-29 00:11:12,901 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-29 00:11:12,902 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-29 00:11:12,949 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-29 00:11:12,951 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-29 00:11:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:11:12,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-29 00:11:12,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-29 00:11:12,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:12,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-29 00:11:12,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:12,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-29 00:11:12,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:12,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 25 transitions. [2018-11-29 00:11:12,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-29 00:11:12,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 23 transitions. [2018-11-29 00:11:12,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-29 00:11:12,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-29 00:11:12,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2018-11-29 00:11:12,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:11:12,960 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-29 00:11:12,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2018-11-29 00:11:12,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-11-29 00:11:12,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-29 00:11:12,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-11-29 00:11:12,962 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-29 00:11:12,962 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-29 00:11:12,962 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:11:12,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2018-11-29 00:11:12,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-29 00:11:12,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:12,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:12,964 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:11:12,964 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:11:12,964 INFO L794 eck$LassoCheckResult]: Stem: 137#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 134#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; 135#L553 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 136#L553-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; 144#L543-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; 139#L546-6 [2018-11-29 00:11:12,965 INFO L796 eck$LassoCheckResult]: Loop: 139#L546-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 145#L546-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#L546-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; 138#L546-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 139#L546-6 [2018-11-29 00:11:12,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:12,965 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-11-29 00:11:12,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:12,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:12,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:12,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:12,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:12,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:12,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 1 times [2018-11-29 00:11:12,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:12,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:12,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:12,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:12,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:13,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:13,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1185710257, now seen corresponding path program 1 times [2018-11-29 00:11:13,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:13,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:13,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:13,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:13,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:13,182 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-29 00:11:13,346 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-29 00:11:13,532 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2018-11-29 00:11:13,598 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:11:13,599 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:11:13,599 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:11:13,599 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:11:13,599 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:11:13,599 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:11:13,600 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:11:13,600 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:11:13,600 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-29 00:11:13,600 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:11:13,600 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:11:13,605 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-29 00:11:13,615 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-29 00:11:13,616 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-29 00:11:13,618 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-29 00:11:13,623 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-29 00:11:13,902 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2018-11-29 00:11:13,970 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-29 00:11:13,974 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-29 00:11:13,977 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-29 00:11:13,980 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-29 00:11:13,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-29 00:11:13,986 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-29 00:11:14,307 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-29 00:11:14,540 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:11:14,540 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:11:14,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-29 00:11:14,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:14,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:14,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:14,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:14,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:14,543 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:14,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:14,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:14,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-29 00:11:14,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:14,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:14,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:14,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:14,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:14,545 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:14,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:14,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:14,546 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-29 00:11:14,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:14,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:14,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:14,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:14,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:14,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:14,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:14,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:14,549 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-29 00:11:14,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:14,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:14,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:14,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:14,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:14,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:14,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:14,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:14,551 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-29 00:11:14,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:14,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:14,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:14,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:14,554 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:14,554 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:14,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:14,561 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-29 00:11:14,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:14,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:14,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:14,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:14,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:14,566 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:14,736 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:11:14,758 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-29 00:11:14,758 INFO L444 ModelExtractionUtils]: 27 out of 37 variables were initially zero. Simplification set additionally 8 variables to zero. [2018-11-29 00:11:14,759 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:11:14,760 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:11:14,760 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:11:14,760 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-29 00:11:14,865 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-29 00:11:15,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:15,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:15,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:15,427 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-29 00:11:15,450 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-29 00:11:15,450 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-29 00:11:15,450 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-29 00:11:15,658 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-29 00:11:15,660 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-29 00:11:15,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:11:15,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-11-29 00:11:15,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-29 00:11:15,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:15,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-29 00:11:15,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:15,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-29 00:11:15,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:15,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 62 transitions. [2018-11-29 00:11:15,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-29 00:11:15,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 30 states and 40 transitions. [2018-11-29 00:11:15,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-29 00:11:15,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-29 00:11:15,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-11-29 00:11:15,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:11:15,675 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-11-29 00:11:15,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-11-29 00:11:15,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2018-11-29 00:11:15,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-29 00:11:15,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2018-11-29 00:11:15,685 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-11-29 00:11:15,685 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-11-29 00:11:15,685 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:11:15,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2018-11-29 00:11:15,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-29 00:11:15,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:15,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:15,691 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:15,691 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:11:15,691 INFO L794 eck$LassoCheckResult]: Stem: 271#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 268#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; 269#L553 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 270#L553-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; 278#L543-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; 275#L546-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 283#L546-1 assume !insertionSort_#t~short6; 284#L546-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5; 285#L546-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 276#L543-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 277#L543-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; 273#L546-6 [2018-11-29 00:11:15,691 INFO L796 eck$LassoCheckResult]: Loop: 273#L546-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 279#L546-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#L546-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; 272#L546-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 273#L546-6 [2018-11-29 00:11:15,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:15,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1303016098, now seen corresponding path program 1 times [2018-11-29 00:11:15,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:15,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:15,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:15,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:15,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:15,771 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-29 00:11:15,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:11:15,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:11:15,772 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:11:15,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:15,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 2 times [2018-11-29 00:11:15,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:15,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:15,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:15,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:15,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:16,038 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-29 00:11:16,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:11:16,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:11:16,062 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-29 00:11:16,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:11:16,168 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2018-11-29 00:11:16,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:11:16,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2018-11-29 00:11:16,171 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-29 00:11:16,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 43 transitions. [2018-11-29 00:11:16,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-29 00:11:16,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-29 00:11:16,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2018-11-29 00:11:16,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:11:16,173 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-11-29 00:11:16,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2018-11-29 00:11:16,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2018-11-29 00:11:16,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-29 00:11:16,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2018-11-29 00:11:16,176 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-11-29 00:11:16,177 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-11-29 00:11:16,177 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:11:16,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2018-11-29 00:11:16,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-29 00:11:16,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:16,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:16,178 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:16,178 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:11:16,178 INFO L794 eck$LassoCheckResult]: Stem: 338#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 335#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; 336#L553 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 337#L553-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; 345#L543-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; 347#L546-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 349#L546-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#L546-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5; 353#L546-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 343#L543-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 344#L543-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; 340#L546-6 [2018-11-29 00:11:16,179 INFO L796 eck$LassoCheckResult]: Loop: 340#L546-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 346#L546-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#L546-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; 339#L546-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 340#L546-6 [2018-11-29 00:11:16,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:16,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1301169056, now seen corresponding path program 2 times [2018-11-29 00:11:16,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:16,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:16,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:16,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:16,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:16,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:16,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 3 times [2018-11-29 00:11:16,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:16,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:16,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:16,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:16,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:16,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:16,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1886560891, now seen corresponding path program 1 times [2018-11-29 00:11:16,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:16,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:16,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:16,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:16,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:16,528 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-29 00:11:16,916 WARN L180 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 90 [2018-11-29 00:11:17,004 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:11:17,004 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:11:17,005 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:11:17,005 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:11:17,005 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:11:17,005 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:11:17,005 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:11:17,005 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:11:17,005 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-29 00:11:17,005 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:11:17,005 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:11:17,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-29 00:11:17,015 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-29 00:11:17,017 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-29 00:11:17,019 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-29 00:11:17,022 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-29 00:11:17,218 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2018-11-29 00:11:17,306 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-29 00:11:17,310 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-29 00:11:17,312 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-29 00:11:17,314 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-29 00:11:17,316 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-29 00:11:17,320 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-29 00:11:17,780 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:11:17,780 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:11:17,781 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-29 00:11:17,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:17,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:17,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:17,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:17,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:17,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:17,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:17,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:17,789 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-29 00:11:17,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:17,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:17,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:17,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:17,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:17,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:17,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:17,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:17,792 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-29 00:11:17,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:17,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:17,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:17,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:17,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:17,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:17,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:17,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:17,794 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-29 00:11:17,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:17,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:17,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:17,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:17,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:17,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:17,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:17,801 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-29 00:11:17,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:17,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:17,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:17,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:17,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:17,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:17,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:17,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:17,806 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-29 00:11:17,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:17,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:17,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:17,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:17,808 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:17,808 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:17,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:17,815 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-29 00:11:17,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:17,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:17,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:17,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:17,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:17,826 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:17,857 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:11:17,888 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-29 00:11:17,888 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-29 00:11:17,890 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:11:17,892 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:11:17,892 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:11:17,892 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-29 00:11:18,081 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-29 00:11:18,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:18,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:18,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:18,758 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-29 00:11:18,782 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-29 00:11:18,783 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-29 00:11:18,783 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-29 00:11:18,839 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-29 00:11:18,842 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-29 00:11:18,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:11:18,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-11-29 00:11:18,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-29 00:11:18,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:18,843 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:11:18,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:18,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:18,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:18,923 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-29 00:11:18,924 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-29 00:11:18,924 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-29 00:11:19,002 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-29 00:11:19,003 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-29 00:11:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:11:19,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-11-29 00:11:19,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-29 00:11:19,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:19,005 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:11:19,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:19,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:19,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:19,154 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-29 00:11:19,154 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-29 00:11:19,155 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-29 00:11:19,215 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-29 00:11:19,218 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-29 00:11:19,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:11:19,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-29 00:11:19,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-29 00:11:19,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:19,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-29 00:11:19,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:19,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 8 letters. [2018-11-29 00:11:19,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:19,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 75 transitions. [2018-11-29 00:11:19,224 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:11:19,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 0 states and 0 transitions. [2018-11-29 00:11:19,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:11:19,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:11:19,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:11:19,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:19,224 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:11:19,227 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:11:19,227 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:11:19,227 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:11:19,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:11:19,227 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:11:19,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:11:19,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:11:19 BoogieIcfgContainer [2018-11-29 00:11:19,235 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:11:19,236 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:11:19,236 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:11:19,236 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:11:19,236 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:09" (3/4) ... [2018-11-29 00:11:19,240 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:11:19,240 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:11:19,241 INFO L168 Benchmark]: Toolchain (without parser) took 10994.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.5 MB). Free memory was 950.0 MB in the beginning and 760.7 MB in the end (delta: 189.3 MB). Peak memory consumption was 372.8 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:19,242 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:11:19,243 INFO L168 Benchmark]: CACSL2BoogieTranslator took 626.48 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 928.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:19,243 INFO L168 Benchmark]: Boogie Procedure Inliner took 137.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 928.5 MB in the beginning and 1.1 GB in the end (delta: -156.2 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:19,245 INFO L168 Benchmark]: Boogie Preprocessor took 30.61 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-29 00:11:19,246 INFO L168 Benchmark]: RCFGBuilder took 444.83 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: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:19,247 INFO L168 Benchmark]: BuchiAutomizer took 9745.34 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 86.5 MB). Free memory was 1.1 GB in the beginning and 760.7 MB in the end (delta: 304.7 MB). Peak memory consumption was 391.3 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:19,248 INFO L168 Benchmark]: Witness Printer took 4.78 ms. Allocated memory is still 1.2 GB. Free memory is still 760.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:11:19,254 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 626.48 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 928.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 137.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 928.5 MB in the beginning and 1.1 GB in the end (delta: -156.2 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.61 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 444.83 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: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9745.34 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 86.5 MB). Free memory was 1.1 GB in the beginning and 760.7 MB in the end (delta: 304.7 MB). Peak memory consumption was 391.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.78 ms. Allocated memory is still 1.2 GB. Free memory is still 760.7 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 9.6s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 7.2s. Construction of modules took 0.3s. Büchi inclusion checks took 1.8s. 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.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital167 mio100 ax100 hnf99 lsp96 ukn75 mio100 lsp66 div100 bol100 ite100 ukn100 eq176 hnf84 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 47ms 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...