./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 906a4fb5 Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 647da5540d24322bf98da85423c1800dc68ed16f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-906a4fb [2020-10-19 18:50:39,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 18:50:39,268 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 18:50:39,312 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 18:50:39,313 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 18:50:39,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 18:50:39,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 18:50:39,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 18:50:39,334 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 18:50:39,335 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 18:50:39,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 18:50:39,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 18:50:39,339 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 18:50:39,340 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 18:50:39,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 18:50:39,344 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 18:50:39,345 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 18:50:39,347 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 18:50:39,351 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 18:50:39,353 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 18:50:39,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 18:50:39,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 18:50:39,360 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 18:50:39,361 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 18:50:39,371 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 18:50:39,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 18:50:39,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 18:50:39,374 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 18:50:39,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 18:50:39,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 18:50:39,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 18:50:39,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 18:50:39,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 18:50:39,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 18:50:39,380 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 18:50:39,380 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 18:50:39,381 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 18:50:39,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 18:50:39,381 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 18:50:39,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 18:50:39,384 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 18:50:39,385 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-19 18:50:39,432 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 18:50:39,432 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 18:50:39,434 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 18:50:39,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 18:50:39,435 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 18:50:39,435 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 18:50:39,435 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 18:50:39,435 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 18:50:39,435 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 18:50:39,436 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 18:50:39,437 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 18:50:39,437 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 18:50:39,437 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 18:50:39,438 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 18:50:39,438 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 18:50:39,438 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 18:50:39,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 18:50:39,439 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 18:50:39,439 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 18:50:39,439 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 18:50:39,440 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 18:50:39,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 18:50:39,440 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 18:50:39,440 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 18:50:39,440 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 18:50:39,441 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 18:50:39,441 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 18:50:39,441 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 18:50:39,441 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 18:50:39,443 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 18:50:39,443 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 647da5540d24322bf98da85423c1800dc68ed16f [2020-10-19 18:50:39,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 18:50:39,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 18:50:39,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 18:50:39,790 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 18:50:39,793 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 18:50:39,794 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2020-10-19 18:50:39,860 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d764d6fc1/4660ec32e8664649a0341978d7ca36b8/FLAG37ed79761 [2020-10-19 18:50:40,339 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 18:50:40,339 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2020-10-19 18:50:40,346 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d764d6fc1/4660ec32e8664649a0341978d7ca36b8/FLAG37ed79761 [2020-10-19 18:50:40,711 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d764d6fc1/4660ec32e8664649a0341978d7ca36b8 [2020-10-19 18:50:40,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 18:50:40,722 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 18:50:40,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 18:50:40,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 18:50:40,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 18:50:40,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:50:40" (1/1) ... [2020-10-19 18:50:40,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41ba1e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:40, skipping insertion in model container [2020-10-19 18:50:40,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:50:40" (1/1) ... [2020-10-19 18:50:40,739 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 18:50:40,758 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 18:50:40,952 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:50:40,964 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 18:50:40,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:50:41,001 INFO L208 MainTranslator]: Completed translation [2020-10-19 18:50:41,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:41 WrapperNode [2020-10-19 18:50:41,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 18:50:41,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 18:50:41,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 18:50:41,003 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 18:50:41,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:41" (1/1) ... [2020-10-19 18:50:41,021 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:41" (1/1) ... [2020-10-19 18:50:41,099 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 18:50:41,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 18:50:41,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 18:50:41,100 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 18:50:41,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:41" (1/1) ... [2020-10-19 18:50:41,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:41" (1/1) ... [2020-10-19 18:50:41,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:41" (1/1) ... [2020-10-19 18:50:41,112 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:41" (1/1) ... [2020-10-19 18:50:41,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:41" (1/1) ... [2020-10-19 18:50:41,124 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:41" (1/1) ... [2020-10-19 18:50:41,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:41" (1/1) ... [2020-10-19 18:50:41,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 18:50:41,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 18:50:41,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 18:50:41,128 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 18:50:41,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:41" (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 [2020-10-19 18:50:41,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-19 18:50:41,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-19 18:50:41,197 INFO L130 BoogieDeclarations]: Found specification of procedure insertionSort [2020-10-19 18:50:41,198 INFO L138 BoogieDeclarations]: Found implementation of procedure insertionSort [2020-10-19 18:50:41,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 18:50:41,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 18:50:41,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-19 18:50:41,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 18:50:41,449 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 18:50:41,449 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-19 18:50:41,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:50:41 BoogieIcfgContainer [2020-10-19 18:50:41,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 18:50:41,452 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 18:50:41,453 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 18:50:41,456 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 18:50:41,458 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:50:41,458 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 06:50:40" (1/3) ... [2020-10-19 18:50:41,459 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32790ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:50:41, skipping insertion in model container [2020-10-19 18:50:41,460 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:50:41,460 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:41" (2/3) ... [2020-10-19 18:50:41,460 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32790ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:50:41, skipping insertion in model container [2020-10-19 18:50:41,460 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:50:41,461 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:50:41" (3/3) ... [2020-10-19 18:50:41,462 INFO L373 chiAutomizerObserver]: Analyzing ICFG insertionSort_recursive.i [2020-10-19 18:50:41,521 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 18:50:41,521 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 18:50:41,521 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 18:50:41,522 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 18:50:41,522 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 18:50:41,522 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 18:50:41,523 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 18:50:41,523 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 18:50:41,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-10-19 18:50:41,580 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-19 18:50:41,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:50:41,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:50:41,589 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-19 18:50:41,589 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 18:50:41,590 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 18:50:41,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-10-19 18:50:41,593 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-19 18:50:41,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:50:41,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:50:41,594 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-19 18:50:41,594 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 18:50:41,609 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 6#L28true assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 8#L33-3true [2020-10-19 18:50:41,610 INFO L796 eck$LassoCheckResult]: Loop: 8#L33-3true assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 10#L33-2true main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 8#L33-3true [2020-10-19 18:50:41,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:41,620 INFO L82 PathProgramCache]: Analyzing trace with hash 60643, now seen corresponding path program 1 times [2020-10-19 18:50:41,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:41,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030559980] [2020-10-19 18:50:41,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:41,735 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:41,746 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:41,768 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:41,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:41,770 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 1 times [2020-10-19 18:50:41,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:41,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227295041] [2020-10-19 18:50:41,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:41,782 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:41,789 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:41,792 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:41,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:41,795 INFO L82 PathProgramCache]: Analyzing trace with hash 58279397, now seen corresponding path program 1 times [2020-10-19 18:50:41,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:41,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968033205] [2020-10-19 18:50:41,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:41,816 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:41,831 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:41,835 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:42,022 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:50:42,023 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:50:42,023 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:50:42,024 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:50:42,024 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:50:42,024 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:42,025 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:50:42,025 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:50:42,025 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration1_Lasso [2020-10-19 18:50:42,025 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:50:42,026 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:50:42,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:42,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:42,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:42,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:42,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:42,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:42,470 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:50:42,476 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:50:42,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:42,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:42,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:42,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:42,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:42,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:42,503 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:42,503 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:42,506 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:50:42,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:42,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:42,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:42,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:42,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:42,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:42,548 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:42,548 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:42,551 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:50:42,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:42,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:42,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:42,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:42,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:42,594 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:42,595 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:42,604 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:50:42,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:42,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:42,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:42,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:42,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:42,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:42,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:42,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:42,653 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:50:42,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:42,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:42,699 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-10-19 18:50:42,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:42,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:42,706 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-10-19 18:50:42,706 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:42,720 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:50:42,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:42,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:42,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:42,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:42,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:42,763 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:42,764 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:42,776 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:42,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:42,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:42,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:42,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:42,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:42,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:42,812 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:50:42,821 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:50:42,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:42,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:42,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:42,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:42,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:42,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:42,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:42,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:42,871 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:50:42,912 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:42,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:42,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:42,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:42,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:42,923 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:42,923 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:42,937 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:50:42,968 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-19 18:50:42,968 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:42,977 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 18:50:42,981 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-19 18:50:42,981 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:50:42,982 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1) = -4*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 Supporting invariants [1*ULTIMATE.start_main_~a~0.offset >= 0] [2020-10-19 18:50:43,028 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2020-10-19 18:50:43,042 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 18:50:43,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:43,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 18:50:43,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:43,111 WARN L261 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-19 18:50:43,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:43,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:50:43,151 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 [2020-10-19 18:50:43,152 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 3 states. [2020-10-19 18:50:43,243 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 3 states. Result 43 states and 57 transitions. Complement of second has 9 states. [2020-10-19 18:50:43,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 18:50:43,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 18:50:43,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2020-10-19 18:50:43,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 2 letters. [2020-10-19 18:50:43,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:43,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 5 letters. Loop has 2 letters. [2020-10-19 18:50:43,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:43,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 4 letters. [2020-10-19 18:50:43,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:43,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2020-10-19 18:50:43,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 18:50:43,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2020-10-19 18:50:43,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-10-19 18:50:43,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-19 18:50:43,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2020-10-19 18:50:43,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:50:43,270 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-10-19 18:50:43,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2020-10-19 18:50:43,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-10-19 18:50:43,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-19 18:50:43,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-10-19 18:50:43,306 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-10-19 18:50:43,307 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-10-19 18:50:43,307 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 18:50:43,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-10-19 18:50:43,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 18:50:43,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:50:43,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:50:43,309 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-19 18:50:43,309 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-19 18:50:43,309 INFO L794 eck$LassoCheckResult]: Stem: 142#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 139#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 135#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 136#L33-3 assume !(main_~i~0 < main_~n~0); 131#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 129#insertionSortENTRY [2020-10-19 18:50:43,310 INFO L796 eck$LassoCheckResult]: Loop: 129#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 132#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 140#L15-6 assume !true; 141#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 130#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 129#insertionSortENTRY [2020-10-19 18:50:43,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:43,310 INFO L82 PathProgramCache]: Analyzing trace with hash 58279346, now seen corresponding path program 1 times [2020-10-19 18:50:43,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:43,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590664543] [2020-10-19 18:50:43,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:43,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:50:43,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590664543] [2020-10-19 18:50:43,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:50:43,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:50:43,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345867666] [2020-10-19 18:50:43,434 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:50:43,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:43,434 INFO L82 PathProgramCache]: Analyzing trace with hash 28740467, now seen corresponding path program 1 times [2020-10-19 18:50:43,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:43,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895890590] [2020-10-19 18:50:43,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:43,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:50:43,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895890590] [2020-10-19 18:50:43,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:50:43,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 18:50:43,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591536290] [2020-10-19 18:50:43,469 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:50:43,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:50:43,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-19 18:50:43,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-19 18:50:43,475 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 2 states. [2020-10-19 18:50:43,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:50:43,485 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2020-10-19 18:50:43,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-19 18:50:43,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2020-10-19 18:50:43,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 18:50:43,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2020-10-19 18:50:43,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-19 18:50:43,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-19 18:50:43,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2020-10-19 18:50:43,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:50:43,496 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-10-19 18:50:43,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2020-10-19 18:50:43,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-10-19 18:50:43,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-19 18:50:43,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2020-10-19 18:50:43,507 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-10-19 18:50:43,508 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-10-19 18:50:43,508 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 18:50:43,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2020-10-19 18:50:43,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 18:50:43,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:50:43,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:50:43,512 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-19 18:50:43,512 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:50:43,512 INFO L794 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 175#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 171#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 172#L33-3 assume !(main_~i~0 < main_~n~0); 167#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 165#insertionSortENTRY [2020-10-19 18:50:43,513 INFO L796 eck$LassoCheckResult]: Loop: 165#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 168#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 176#L15-6 #t~short4 := ~j~0 > 0; 169#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 170#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 178#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 166#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 165#insertionSortENTRY [2020-10-19 18:50:43,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:43,513 INFO L82 PathProgramCache]: Analyzing trace with hash 58279346, now seen corresponding path program 2 times [2020-10-19 18:50:43,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:43,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463294830] [2020-10-19 18:50:43,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:50:43,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463294830] [2020-10-19 18:50:43,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:50:43,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:50:43,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652202358] [2020-10-19 18:50:43,560 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:50:43,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:43,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1835476522, now seen corresponding path program 1 times [2020-10-19 18:50:43,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:43,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959230340] [2020-10-19 18:50:43,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:43,601 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:43,627 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:43,637 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:43,853 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2020-10-19 18:50:44,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:50:44,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:50:44,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:50:44,056 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-10-19 18:50:44,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:50:44,072 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2020-10-19 18:50:44,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:50:44,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2020-10-19 18:50:44,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 18:50:44,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2020-10-19 18:50:44,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-19 18:50:44,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-19 18:50:44,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2020-10-19 18:50:44,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:50:44,076 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-10-19 18:50:44,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2020-10-19 18:50:44,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-10-19 18:50:44,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-19 18:50:44,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2020-10-19 18:50:44,082 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-10-19 18:50:44,082 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-10-19 18:50:44,082 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 18:50:44,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2020-10-19 18:50:44,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 18:50:44,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:50:44,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:50:44,085 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:50:44,085 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:50:44,085 INFO L794 eck$LassoCheckResult]: Stem: 214#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 212#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 208#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 209#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 210#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 211#L33-3 assume !(main_~i~0 < main_~n~0); 203#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 202#insertionSortENTRY [2020-10-19 18:50:44,085 INFO L796 eck$LassoCheckResult]: Loop: 202#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 205#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 213#L15-6 #t~short4 := ~j~0 > 0; 206#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 207#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 215#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 204#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 202#insertionSortENTRY [2020-10-19 18:50:44,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:44,086 INFO L82 PathProgramCache]: Analyzing trace with hash 171927092, now seen corresponding path program 1 times [2020-10-19 18:50:44,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:44,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768538658] [2020-10-19 18:50:44,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:44,110 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:44,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:44,135 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:44,143 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:44,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:44,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1835476522, now seen corresponding path program 2 times [2020-10-19 18:50:44,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:44,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111981479] [2020-10-19 18:50:44,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:44,167 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:44,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:44,186 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:44,189 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:44,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:44,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1744506729, now seen corresponding path program 1 times [2020-10-19 18:50:44,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:44,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872456757] [2020-10-19 18:50:44,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:44,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 18:50:44,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872456757] [2020-10-19 18:50:44,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:50:44,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-19 18:50:44,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469065203] [2020-10-19 18:50:44,482 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2020-10-19 18:50:44,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:50:44,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-19 18:50:44,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-19 18:50:44,687 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 6 states. [2020-10-19 18:50:44,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:50:44,761 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2020-10-19 18:50:44,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 18:50:44,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2020-10-19 18:50:44,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 18:50:44,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 25 transitions. [2020-10-19 18:50:44,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-10-19 18:50:44,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-10-19 18:50:44,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2020-10-19 18:50:44,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:50:44,764 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-10-19 18:50:44,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2020-10-19 18:50:44,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2020-10-19 18:50:44,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-19 18:50:44,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-10-19 18:50:44,767 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-10-19 18:50:44,767 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-10-19 18:50:44,767 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 18:50:44,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2020-10-19 18:50:44,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 18:50:44,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:50:44,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:50:44,769 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:50:44,769 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:50:44,769 INFO L794 eck$LassoCheckResult]: Stem: 267#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 265#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 261#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 262#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 263#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 264#L33-3 assume !(main_~i~0 < main_~n~0); 257#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 256#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 258#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 266#L15-6 #t~short4 := ~j~0 > 0; 259#L15-1 assume !#t~short4; 260#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 270#L15-7 [2020-10-19 18:50:44,769 INFO L796 eck$LassoCheckResult]: Loop: 270#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 268#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 269#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 275#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 272#L15-6 #t~short4 := ~j~0 > 0; 274#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 273#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 270#L15-7 [2020-10-19 18:50:44,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:44,769 INFO L82 PathProgramCache]: Analyzing trace with hash -332541132, now seen corresponding path program 1 times [2020-10-19 18:50:44,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:44,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722229677] [2020-10-19 18:50:44,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:44,780 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:44,789 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:44,793 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:44,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:44,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 3 times [2020-10-19 18:50:44,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:44,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44845138] [2020-10-19 18:50:44,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:44,803 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:44,811 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:44,813 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:44,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:44,814 INFO L82 PathProgramCache]: Analyzing trace with hash 2143759477, now seen corresponding path program 1 times [2020-10-19 18:50:44,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:44,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662150920] [2020-10-19 18:50:44,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:44,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:50:44,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662150920] [2020-10-19 18:50:44,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108060193] [2020-10-19 18:50:44,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:50:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:44,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-19 18:50:44,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:45,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:50:45,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:50:45,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2020-10-19 18:50:45,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653023163] [2020-10-19 18:50:45,494 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2020-10-19 18:50:45,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:50:45,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-19 18:50:45,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2020-10-19 18:50:45,562 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 16 states. [2020-10-19 18:50:45,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:50:45,715 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2020-10-19 18:50:45,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-19 18:50:45,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2020-10-19 18:50:45,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 18:50:45,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 23 states and 26 transitions. [2020-10-19 18:50:45,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-10-19 18:50:45,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-19 18:50:45,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2020-10-19 18:50:45,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:50:45,719 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2020-10-19 18:50:45,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2020-10-19 18:50:45,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-10-19 18:50:45,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-19 18:50:45,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2020-10-19 18:50:45,723 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-10-19 18:50:45,723 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-10-19 18:50:45,724 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 18:50:45,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2020-10-19 18:50:45,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 18:50:45,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:50:45,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:50:45,730 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:50:45,730 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:50:45,731 INFO L794 eck$LassoCheckResult]: Stem: 406#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 402#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 397#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 398#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 399#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 400#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 401#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 410#L33-3 assume !(main_~i~0 < main_~n~0); 393#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 392#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 394#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 403#L15-6 #t~short4 := ~j~0 > 0; 395#L15-1 assume !#t~short4; 396#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 407#L15-7 [2020-10-19 18:50:45,731 INFO L796 eck$LassoCheckResult]: Loop: 407#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 404#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 405#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 413#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 409#L15-6 #t~short4 := ~j~0 > 0; 412#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 411#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 407#L15-7 [2020-10-19 18:50:45,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:45,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1063486350, now seen corresponding path program 2 times [2020-10-19 18:50:45,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:45,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491855815] [2020-10-19 18:50:45,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:45,757 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:45,775 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:45,785 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:45,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:45,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 4 times [2020-10-19 18:50:45,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:45,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136707802] [2020-10-19 18:50:45,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:45,805 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:45,819 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:45,822 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:45,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:45,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1119961463, now seen corresponding path program 2 times [2020-10-19 18:50:45,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:45,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409757707] [2020-10-19 18:50:45,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:45,861 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:45,892 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:45,899 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:46,274 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2020-10-19 18:50:46,577 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2020-10-19 18:50:46,903 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2020-10-19 18:50:46,978 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:50:46,978 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:50:46,978 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:50:46,978 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:50:46,979 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:50:46,979 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:46,979 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:50:46,979 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:50:46,979 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration6_Lasso [2020-10-19 18:50:46,980 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:50:46,980 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:50:46,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:46,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:46,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:47,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:47,206 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2020-10-19 18:50:47,479 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2020-10-19 18:50:47,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:47,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:47,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:47,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:47,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:47,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:47,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:47,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:47,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:47,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:47,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:47,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:47,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:47,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:47,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:47,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:47,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:47,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:47,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:47,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:48,191 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:50:48,192 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:48,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:48,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:48,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:48,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:48,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:48,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:48,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:48,200 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:48,202 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:48,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:48,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:48,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:48,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:48,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:48,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:48,227 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:48,227 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:48,228 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:48,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:48,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:48,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:48,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:48,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:48,264 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:48,264 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:50:48,267 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:50:48,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:48,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:48,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:48,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:48,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:48,330 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:48,330 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:50:48,350 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:50:48,408 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2020-10-19 18:50:48,409 INFO L444 ModelExtractionUtils]: 2 out of 31 variables were initially zero. Simplification set additionally 25 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:48,411 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 18:50:48,413 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-19 18:50:48,414 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:50:48,414 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length insertionSort_#in~array.base)_1, insertionSort_~i) = 1*v_rep(select #length insertionSort_#in~array.base)_1 - 2*insertionSort_~i Supporting invariants [1*insertionSort_~array.offset >= 0] [2020-10-19 18:50:48,462 INFO L297 tatePredicateManager]: 7 out of 9 supporting invariants were superfluous and have been removed [2020-10-19 18:50:48,467 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 18:50:48,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:48,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 18:50:48,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:48,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:48,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 19 conjunts are in the unsatisfiable core [2020-10-19 18:50:48,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:48,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:50:48,961 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 5 loop predicates [2020-10-19 18:50:48,961 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 5 Second operand 9 states. [2020-10-19 18:50:50,205 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 5. Second operand 9 states. Result 35 states and 42 transitions. Complement of second has 16 states. [2020-10-19 18:50:50,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 4 stem states 4 non-accepting loop states 1 accepting loop states [2020-10-19 18:50:50,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-19 18:50:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2020-10-19 18:50:50,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 14 letters. Loop has 7 letters. [2020-10-19 18:50:50,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:50,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 21 letters. Loop has 7 letters. [2020-10-19 18:50:50,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:50,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 14 letters. Loop has 14 letters. [2020-10-19 18:50:50,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:50,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2020-10-19 18:50:50,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-19 18:50:50,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 30 states and 36 transitions. [2020-10-19 18:50:50,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-19 18:50:50,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-19 18:50:50,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 36 transitions. [2020-10-19 18:50:50,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:50:50,213 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2020-10-19 18:50:50,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 36 transitions. [2020-10-19 18:50:50,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-10-19 18:50:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-10-19 18:50:50,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2020-10-19 18:50:50,216 INFO L714 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2020-10-19 18:50:50,216 INFO L594 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2020-10-19 18:50:50,216 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 18:50:50,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2020-10-19 18:50:50,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-19 18:50:50,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:50:50,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:50:50,218 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:50:50,218 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 18:50:50,218 INFO L794 eck$LassoCheckResult]: Stem: 619#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 614#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 609#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 610#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 611#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 612#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 613#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 615#L33-3 assume !(main_~i~0 < main_~n~0); 600#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 599#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 601#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 623#L15-6 #t~short4 := ~j~0 > 0; 605#L15-1 assume !#t~short4; 606#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 620#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 603#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 602#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 604#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 624#L15-6 #t~short4 := ~j~0 > 0; 617#L15-1 [2020-10-19 18:50:50,218 INFO L796 eck$LassoCheckResult]: Loop: 617#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 626#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 625#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 616#L15-6 #t~short4 := ~j~0 > 0; 617#L15-1 [2020-10-19 18:50:50,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:50,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1647994767, now seen corresponding path program 1 times [2020-10-19 18:50:50,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:50,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472954110] [2020-10-19 18:50:50,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:50,236 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:50,265 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:50,272 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:50,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:50,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1239356, now seen corresponding path program 1 times [2020-10-19 18:50:50,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:50,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137413926] [2020-10-19 18:50:50,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:50,284 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:50,289 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:50,290 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:50,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:50,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1753822804, now seen corresponding path program 1 times [2020-10-19 18:50:50,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:50,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884226642] [2020-10-19 18:50:50,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:50,319 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:50,348 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:50,358 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:50,679 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2020-10-19 18:50:51,056 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2020-10-19 18:50:51,337 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2020-10-19 18:50:51,830 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 107 [2020-10-19 18:50:51,952 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:50:51,952 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:50:51,952 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:50:51,953 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:50:51,953 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:50:51,953 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:51,953 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:50:51,953 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:50:51,953 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration7_Lasso [2020-10-19 18:50:51,953 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:50:51,953 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:50:51,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:52,153 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-10-19 18:50:52,364 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2020-10-19 18:50:52,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:52,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:52,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:52,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:52,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:52,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:52,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:52,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:52,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:52,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:52,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:52,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:52,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:52,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:52,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:52,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:52,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:52,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:52,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:52,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:52,877 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2020-10-19 18:50:52,985 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:50:52,985 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:52,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:52,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:52,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:52,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:52,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:52,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:52,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:52,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:52,993 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:50:53,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:53,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:53,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:53,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:53,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:53,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:53,028 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:53,028 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:53,029 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:53,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:53,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:53,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:53,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:53,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:53,066 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:53,066 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:50:53,077 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:53,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:53,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:53,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:53,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:53,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:53,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:53,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:50:53,115 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:53,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:53,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:53,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:53,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:53,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:53,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:53,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:50:53,153 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:50:53,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:53,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:53,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:53,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:53,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:53,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:53,179 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:53,179 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:53,182 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:53,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:53,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:53,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:53,213 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-19 18:50:53,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:53,232 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2020-10-19 18:50:53,232 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-10-19 18:50:53,279 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:50:53,387 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2020-10-19 18:50:53,387 INFO L444 ModelExtractionUtils]: 34 out of 56 variables were initially zero. Simplification set additionally 19 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:50:53,398 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:53,409 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2020-10-19 18:50:53,409 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:50:53,410 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~j~0) = 1*insertionSort_~j~0 Supporting invariants [-1*insertionSort_~array.offset >= 0] [2020-10-19 18:50:53,470 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2020-10-19 18:50:53,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:53,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-19 18:50:53,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:53,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 18:50:53,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:53,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:50:53,608 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2020-10-19 18:50:53,608 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 33 transitions. cyclomatic complexity: 8 Second operand 7 states. [2020-10-19 18:50:53,670 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 33 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 32 states and 37 transitions. Complement of second has 8 states. [2020-10-19 18:50:53,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-19 18:50:53,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-19 18:50:53,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2020-10-19 18:50:53,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 19 letters. Loop has 4 letters. [2020-10-19 18:50:53,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:53,672 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 18:50:53,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:53,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-19 18:50:53,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:53,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 18:50:53,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:53,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:50:53,832 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 3 loop predicates [2020-10-19 18:50:53,832 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 33 transitions. cyclomatic complexity: 8 Second operand 7 states. [2020-10-19 18:50:53,900 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 33 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 32 states and 37 transitions. Complement of second has 8 states. [2020-10-19 18:50:53,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-19 18:50:53,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-19 18:50:53,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2020-10-19 18:50:53,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 19 letters. Loop has 4 letters. [2020-10-19 18:50:53,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:53,903 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 18:50:53,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:53,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-19 18:50:53,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:54,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 18:50:54,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:54,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:50:54,069 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2020-10-19 18:50:54,069 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 33 transitions. cyclomatic complexity: 8 Second operand 7 states. [2020-10-19 18:50:54,178 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 33 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 52 states and 66 transitions. Complement of second has 16 states. [2020-10-19 18:50:54,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 18:50:54,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-19 18:50:54,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2020-10-19 18:50:54,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 19 letters. Loop has 4 letters. [2020-10-19 18:50:54,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:54,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 23 letters. Loop has 4 letters. [2020-10-19 18:50:54,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:54,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 19 letters. Loop has 8 letters. [2020-10-19 18:50:54,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:54,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 66 transitions. [2020-10-19 18:50:54,183 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 18:50:54,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 0 states and 0 transitions. [2020-10-19 18:50:54,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-19 18:50:54,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-19 18:50:54,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-19 18:50:54,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:50:54,184 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 18:50:54,184 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 18:50:54,184 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 18:50:54,184 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 18:50:54,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-19 18:50:54,184 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 18:50:54,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-19 18:50:54,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 06:50:54 BoogieIcfgContainer [2020-10-19 18:50:54,191 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 18:50:54,191 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 18:50:54,191 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 18:50:54,192 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 18:50:54,192 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:50:41" (3/4) ... [2020-10-19 18:50:54,195 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-19 18:50:54,196 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 18:50:54,197 INFO L168 Benchmark]: Toolchain (without parser) took 13480.67 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 324.5 MB). Free memory was 953.2 MB in the beginning and 854.9 MB in the end (delta: 98.3 MB). Peak memory consumption was 422.9 MB. Max. memory is 11.5 GB. [2020-10-19 18:50:54,197 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:50:54,198 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.98 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-10-19 18:50:54,199 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -199.9 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2020-10-19 18:50:54,199 INFO L168 Benchmark]: Boogie Preprocessor took 27.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-10-19 18:50:54,200 INFO L168 Benchmark]: RCFGBuilder took 324.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2020-10-19 18:50:54,201 INFO L168 Benchmark]: BuchiAutomizer took 12738.63 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 854.9 MB in the end (delta: 261.7 MB). Peak memory consumption was 439.9 MB. Max. memory is 11.5 GB. [2020-10-19 18:50:54,201 INFO L168 Benchmark]: Witness Printer took 4.29 ms. Allocated memory is still 1.4 GB. Free memory is still 854.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:50:54,204 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 278.98 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -199.9 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 324.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12738.63 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 854.9 MB in the end (delta: 261.7 MB). Peak memory consumption was 439.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.29 ms. Allocated memory is still 1.4 GB. Free memory is still 854.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[malloc(n * sizeof (int))] and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[array] + -2 * i and consists of 9 locations. One nondeterministic module has affine ranking function j and consists of 7 locations. 4 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.6s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 9.5s. Construction of modules took 1.2s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 6 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 112 SDtfs, 116 SDslu, 203 SDs, 0 SdLazy, 218 SolverSat, 37 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 1.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI1 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital179 mio100 ax100 hnf98 lsp97 ukn98 mio100 lsp54 div100 bol102 ite100 ukn100 eq171 hnf84 smp94 dnf142 smp87 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 200ms VariablesStem: 10 VariablesLoop: 8 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...