./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 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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.2.0-5485861 [2020-10-26 04:25:34,868 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 04:25:34,870 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 04:25:34,903 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 04:25:34,903 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 04:25:34,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 04:25:34,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 04:25:34,908 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 04:25:34,910 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 04:25:34,911 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 04:25:34,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 04:25:34,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 04:25:34,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 04:25:34,916 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 04:25:34,917 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 04:25:34,918 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 04:25:34,919 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 04:25:34,920 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 04:25:34,922 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 04:25:34,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 04:25:34,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 04:25:34,937 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 04:25:34,938 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 04:25:34,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 04:25:34,948 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 04:25:34,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 04:25:34,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 04:25:34,952 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 04:25:34,953 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 04:25:34,954 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 04:25:34,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 04:25:34,958 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 04:25:34,959 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 04:25:34,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 04:25:34,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 04:25:34,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 04:25:34,965 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 04:25:34,966 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 04:25:34,966 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 04:25:34,967 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 04:25:34,968 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 04:25:34,970 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-26 04:25:35,029 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 04:25:35,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 04:25:35,031 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 04:25:35,032 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 04:25:35,032 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 04:25:35,032 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 04:25:35,032 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 04:25:35,033 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 04:25:35,033 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 04:25:35,033 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 04:25:35,033 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 04:25:35,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 04:25:35,034 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 04:25:35,034 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 04:25:35,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 04:25:35,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 04:25:35,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 04:25:35,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 04:25:35,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 04:25:35,036 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 04:25:35,036 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 04:25:35,036 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 04:25:35,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 04:25:35,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 04:25:35,037 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 04:25:35,037 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 04:25:35,038 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 04:25:35,038 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 04:25:35,038 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 04:25:35,039 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 04:25:35,040 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-26 04:25:35,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 04:25:35,425 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 04:25:35,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 04:25:35,432 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 04:25:35,433 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 04:25:35,434 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-26 04:25:35,516 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/288722770/63730040044e4d9ca1bf5f95026775f7/FLAGe3e19f1c8 [2020-10-26 04:25:36,158 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 04:25:36,159 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2020-10-26 04:25:36,165 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/288722770/63730040044e4d9ca1bf5f95026775f7/FLAGe3e19f1c8 [2020-10-26 04:25:36,539 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/288722770/63730040044e4d9ca1bf5f95026775f7 [2020-10-26 04:25:36,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 04:25:36,550 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 04:25:36,555 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 04:25:36,555 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 04:25:36,566 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 04:25:36,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:25:36" (1/1) ... [2020-10-26 04:25:36,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c9ecd84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:25:36, skipping insertion in model container [2020-10-26 04:25:36,571 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:25:36" (1/1) ... [2020-10-26 04:25:36,579 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 04:25:36,593 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 04:25:36,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:25:36,748 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 04:25:36,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:25:36,784 INFO L208 MainTranslator]: Completed translation [2020-10-26 04:25:36,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:25:36 WrapperNode [2020-10-26 04:25:36,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 04:25:36,786 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 04:25:36,786 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 04:25:36,787 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 04:25:36,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:25:36" (1/1) ... [2020-10-26 04:25:36,803 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:25:36" (1/1) ... [2020-10-26 04:25:36,823 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 04:25:36,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 04:25:36,824 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 04:25:36,824 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 04:25:36,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:25:36" (1/1) ... [2020-10-26 04:25:36,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:25:36" (1/1) ... [2020-10-26 04:25:36,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:25:36" (1/1) ... [2020-10-26 04:25:36,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:25:36" (1/1) ... [2020-10-26 04:25:36,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:25:36" (1/1) ... [2020-10-26 04:25:36,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:25:36" (1/1) ... [2020-10-26 04:25:36,848 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:25:36" (1/1) ... [2020-10-26 04:25:36,850 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 04:25:36,851 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 04:25:36,851 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 04:25:36,852 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 04:25:36,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:25:36" (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-26 04:25:36,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 04:25:36,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-26 04:25:36,942 INFO L130 BoogieDeclarations]: Found specification of procedure insertionSort [2020-10-26 04:25:36,943 INFO L138 BoogieDeclarations]: Found implementation of procedure insertionSort [2020-10-26 04:25:36,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 04:25:36,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 04:25:36,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-26 04:25:36,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 04:25:37,279 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 04:25:37,279 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-26 04:25:37,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:25:37 BoogieIcfgContainer [2020-10-26 04:25:37,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 04:25:37,283 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 04:25:37,283 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 04:25:37,286 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 04:25:37,290 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:25:37,291 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 04:25:36" (1/3) ... [2020-10-26 04:25:37,292 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5bfd3513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:25:37, skipping insertion in model container [2020-10-26 04:25:37,295 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:25:37,295 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:25:36" (2/3) ... [2020-10-26 04:25:37,296 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5bfd3513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:25:37, skipping insertion in model container [2020-10-26 04:25:37,296 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:25:37,296 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:25:37" (3/3) ... [2020-10-26 04:25:37,301 INFO L373 chiAutomizerObserver]: Analyzing ICFG insertionSort_recursive.i [2020-10-26 04:25:37,415 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 04:25:37,416 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 04:25:37,416 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 04:25:37,416 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 04:25:37,416 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 04:25:37,416 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 04:25:37,417 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 04:25:37,417 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 04:25:37,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-10-26 04:25:37,471 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-26 04:25:37,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:25:37,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:25:37,478 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-26 04:25:37,478 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 04:25:37,479 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 04:25:37,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-10-26 04:25:37,486 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-26 04:25:37,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:25:37,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:25:37,487 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-26 04:25:37,487 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 04:25:37,497 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-26 04:25:37,498 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-26 04:25:37,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:25:37,515 INFO L82 PathProgramCache]: Analyzing trace with hash 60643, now seen corresponding path program 1 times [2020-10-26 04:25:37,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:25:37,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269436740] [2020-10-26 04:25:37,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:25:37,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:25:37,656 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:25:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:25:37,680 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:25:37,707 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:25:37,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:25:37,713 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 1 times [2020-10-26 04:25:37,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:25:37,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102401647] [2020-10-26 04:25:37,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:25:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:25:37,737 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:25:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:25:37,754 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:25:37,762 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:25:37,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:25:37,775 INFO L82 PathProgramCache]: Analyzing trace with hash 58279397, now seen corresponding path program 1 times [2020-10-26 04:25:37,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:25:37,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731707568] [2020-10-26 04:25:37,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:25:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:25:37,803 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:25:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:25:37,817 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:25:37,821 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:25:38,105 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:25:38,106 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:25:38,107 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:25:38,107 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:25:38,107 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:25:38,107 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:25:38,108 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:25:38,108 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:25:38,108 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration1_Lasso [2020-10-26 04:25:38,108 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:25:38,108 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:25:38,130 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-26 04:25:38,149 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-26 04:25:38,155 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-26 04:25:38,162 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-26 04:25:38,329 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2020-10-26 04:25:38,455 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-26 04:25:38,477 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-26 04:25:38,875 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 15 [2020-10-26 04:25:39,029 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:25:39,034 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-26 04:25:39,047 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-26 04:25:39,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:25:39,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:25:39,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:25:39,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:25:39,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:25:39,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:25:39,054 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-26 04:25:39,060 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-26 04:25:39,106 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-26 04:25:39,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:25:39,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:25:39,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:25:39,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:25:39,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:25:39,110 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:25:39,111 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-26 04:25:39,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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:25:39,160 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-26 04:25:39,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:25:39,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:25:39,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:25:39,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:25:39,169 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:25:39,169 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-26 04:25:39,176 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-26 04:25:39,222 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:25:39,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:25:39,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:25:39,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:25:39,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:25:39,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:25:39,228 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:25:39,228 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:25:39,232 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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:25:39,272 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-26 04:25:39,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:25:39,275 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-10-26 04:25:39,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:25:39,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:25:39,284 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-10-26 04:25:39,284 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:25:39,304 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-26 04:25:39,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:25:39,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:25:39,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:25:39,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:25:39,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:25:39,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:25:39,354 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-26 04:25:39,363 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) [2020-10-26 04:25:39,400 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-26 04:25:39,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:25:39,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:25:39,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:25:39,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:25:39,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:25:39,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:25:39,412 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-26 04:25:39,452 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-26 04:25:39,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:25:39,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:25:39,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:25:39,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:25:39,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:25:39,456 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:25:39,456 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-26 04:25:39,459 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-26 04:25:39,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:25:39,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:25:39,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:25:39,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:25:39,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:25:39,519 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:25:39,519 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:25:39,536 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:25:39,579 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-26 04:25:39,579 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) [2020-10-26 04:25:39,587 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:25:39,592 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-26 04:25:39,593 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:25:39,593 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 - 4*ULTIMATE.start_main_~i~0 Supporting invariants [1*ULTIMATE.start_main_~a~0.offset >= 0] [2020-10-26 04:25:39,645 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2020-10-26 04:25:39,661 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-26 04:25:39,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:25:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:25:39,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-26 04:25:39,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:25:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:25:39,762 WARN L261 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-26 04:25:39,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:25:39,846 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-26 04:25:39,863 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-26 04:25:39,864 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 3 states. [2020-10-26 04:25:39,962 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-26 04:25:39,963 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-26 04:25:39,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 04:25:39,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2020-10-26 04:25:39,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 2 letters. [2020-10-26 04:25:39,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:25:39,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 5 letters. Loop has 2 letters. [2020-10-26 04:25:39,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:25:39,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 4 letters. [2020-10-26 04:25:39,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:25:39,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2020-10-26 04:25:39,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-26 04:25:39,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2020-10-26 04:25:39,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-10-26 04:25:39,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-26 04:25:39,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2020-10-26 04:25:39,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:25:39,985 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-10-26 04:25:40,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2020-10-26 04:25:40,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-10-26 04:25:40,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-26 04:25:40,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-10-26 04:25:40,015 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-10-26 04:25:40,015 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-10-26 04:25:40,015 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 04:25:40,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-10-26 04:25:40,016 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-26 04:25:40,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:25:40,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:25:40,017 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-26 04:25:40,018 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-26 04:25:40,018 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-26 04:25:40,018 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-26 04:25:40,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:25:40,019 INFO L82 PathProgramCache]: Analyzing trace with hash 58279346, now seen corresponding path program 1 times [2020-10-26 04:25:40,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:25:40,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412873416] [2020-10-26 04:25:40,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:25:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:25:40,090 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-26 04:25:40,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412873416] [2020-10-26 04:25:40,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:25:40,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:25:40,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615114005] [2020-10-26 04:25:40,095 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:25:40,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:25:40,096 INFO L82 PathProgramCache]: Analyzing trace with hash 28740467, now seen corresponding path program 1 times [2020-10-26 04:25:40,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:25:40,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755974804] [2020-10-26 04:25:40,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:25:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:25:40,107 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-26 04:25:40,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755974804] [2020-10-26 04:25:40,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:25:40,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 04:25:40,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707165686] [2020-10-26 04:25:40,109 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:25:40,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:25:40,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-26 04:25:40,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-26 04:25:40,114 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 2 states. [2020-10-26 04:25:40,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:25:40,119 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2020-10-26 04:25:40,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-26 04:25:40,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2020-10-26 04:25:40,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-26 04:25:40,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2020-10-26 04:25:40,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-26 04:25:40,122 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-26 04:25:40,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2020-10-26 04:25:40,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:25:40,123 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-10-26 04:25:40,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2020-10-26 04:25:40,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-10-26 04:25:40,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-26 04:25:40,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2020-10-26 04:25:40,126 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-10-26 04:25:40,126 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-10-26 04:25:40,126 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 04:25:40,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2020-10-26 04:25:40,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-26 04:25:40,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:25:40,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:25:40,128 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-26 04:25:40,128 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:25:40,128 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-26 04:25:40,129 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~mem3;havoc #t~short4; 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-26 04:25:40,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:25:40,129 INFO L82 PathProgramCache]: Analyzing trace with hash 58279346, now seen corresponding path program 2 times [2020-10-26 04:25:40,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:25:40,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981888183] [2020-10-26 04:25:40,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:25:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:25:40,155 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-26 04:25:40,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981888183] [2020-10-26 04:25:40,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:25:40,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:25:40,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548125718] [2020-10-26 04:25:40,156 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:25:40,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:25:40,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1835476522, now seen corresponding path program 1 times [2020-10-26 04:25:40,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:25:40,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755367682] [2020-10-26 04:25:40,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:25:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:25:40,173 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:25:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:25:40,186 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:25:40,189 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:25:40,553 WARN L193 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2020-10-26 04:25:40,677 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-10-26 04:25:40,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:25:40,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:25:40,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:25:40,830 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-10-26 04:25:40,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:25:40,843 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2020-10-26 04:25:40,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:25:40,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2020-10-26 04:25:40,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-26 04:25:40,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2020-10-26 04:25:40,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-26 04:25:40,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-26 04:25:40,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2020-10-26 04:25:40,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:25:40,846 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-10-26 04:25:40,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2020-10-26 04:25:40,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-10-26 04:25:40,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-26 04:25:40,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2020-10-26 04:25:40,849 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-10-26 04:25:40,850 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-10-26 04:25:40,850 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 04:25:40,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2020-10-26 04:25:40,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-26 04:25:40,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:25:40,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:25:40,851 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:25:40,852 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:25:40,852 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-26 04:25:40,852 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~mem3;havoc #t~short4; 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-26 04:25:40,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:25:40,853 INFO L82 PathProgramCache]: Analyzing trace with hash 171927092, now seen corresponding path program 1 times [2020-10-26 04:25:40,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:25:40,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957201801] [2020-10-26 04:25:40,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:25:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:25:40,864 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:25:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:25:40,874 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:25:40,877 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:25:40,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:25:40,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1835476522, now seen corresponding path program 2 times [2020-10-26 04:25:40,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:25:40,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612898062] [2020-10-26 04:25:40,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:25:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:25:40,890 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:25:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:25:40,901 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:25:40,904 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:25:40,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:25:40,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1744506729, now seen corresponding path program 1 times [2020-10-26 04:25:40,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:25:40,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880103273] [2020-10-26 04:25:40,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:25:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:25:41,003 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-26 04:25:41,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880103273] [2020-10-26 04:25:41,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:25:41,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-26 04:25:41,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622322175] [2020-10-26 04:25:41,208 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2020-10-26 04:25:41,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:25:41,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 04:25:41,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-26 04:25:41,401 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 6 states. [2020-10-26 04:25:41,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:25:41,499 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2020-10-26 04:25:41,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 04:25:41,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2020-10-26 04:25:41,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-26 04:25:41,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 25 transitions. [2020-10-26 04:25:41,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-10-26 04:25:41,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-10-26 04:25:41,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2020-10-26 04:25:41,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:25:41,503 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-10-26 04:25:41,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2020-10-26 04:25:41,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2020-10-26 04:25:41,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-26 04:25:41,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-10-26 04:25:41,506 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-10-26 04:25:41,506 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-10-26 04:25:41,506 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 04:25:41,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2020-10-26 04:25:41,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-26 04:25:41,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:25:41,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:25:41,508 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:25:41,508 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:25:41,509 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~mem3;havoc #t~short4; 270#L15-7 [2020-10-26 04:25:41,509 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~mem3;havoc #t~short4; 270#L15-7 [2020-10-26 04:25:41,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:25:41,510 INFO L82 PathProgramCache]: Analyzing trace with hash -332541132, now seen corresponding path program 1 times [2020-10-26 04:25:41,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:25:41,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846745059] [2020-10-26 04:25:41,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:25:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:25:41,523 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:25:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:25:41,535 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:25:41,540 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:25:41,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:25:41,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 3 times [2020-10-26 04:25:41,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:25:41,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910139465] [2020-10-26 04:25:41,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:25:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:25:41,551 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:25:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:25:41,572 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:25:41,575 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:25:41,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:25:41,576 INFO L82 PathProgramCache]: Analyzing trace with hash 2143759477, now seen corresponding path program 1 times [2020-10-26 04:25:41,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:25:41,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972642197] [2020-10-26 04:25:41,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:25:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:25:41,708 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-26 04:25:41,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972642197] [2020-10-26 04:25:41,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825134171] [2020-10-26 04:25:41,709 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-26 04:25:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:25:41,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-26 04:25:41,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:25:41,918 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-26 04:25:41,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:25:41,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2020-10-26 04:25:41,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521168103] [2020-10-26 04:25:42,043 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2020-10-26 04:25:42,404 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2020-10-26 04:25:42,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:25:42,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-26 04:25:42,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2020-10-26 04:25:42,485 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 16 states. [2020-10-26 04:25:42,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:25:42,693 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2020-10-26 04:25:42,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-26 04:25:42,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2020-10-26 04:25:42,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-26 04:25:42,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 23 states and 26 transitions. [2020-10-26 04:25:42,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-10-26 04:25:42,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-26 04:25:42,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2020-10-26 04:25:42,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:25:42,698 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2020-10-26 04:25:42,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2020-10-26 04:25:42,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-10-26 04:25:42,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-26 04:25:42,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2020-10-26 04:25:42,703 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-10-26 04:25:42,703 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-10-26 04:25:42,703 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-26 04:25:42,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2020-10-26 04:25:42,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-26 04:25:42,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:25:42,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:25:42,710 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:25:42,710 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:25:42,710 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~mem3;havoc #t~short4; 407#L15-7 [2020-10-26 04:25:42,710 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~mem3;havoc #t~short4; 407#L15-7 [2020-10-26 04:25:42,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:25:42,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1063486350, now seen corresponding path program 2 times [2020-10-26 04:25:42,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:25:42,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950550714] [2020-10-26 04:25:42,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:25:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:25:42,743 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:25:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:25:42,765 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:25:42,775 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:25:42,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:25:42,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 4 times [2020-10-26 04:25:42,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:25:42,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342680733] [2020-10-26 04:25:42,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:25:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:25:42,783 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:25:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:25:42,790 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:25:42,793 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:25:42,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:25:42,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1119961463, now seen corresponding path program 2 times [2020-10-26 04:25:42,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:25:42,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525846402] [2020-10-26 04:25:42,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:25:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:25:42,813 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:25:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:25:42,832 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:25:42,838 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:25:42,957 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2020-10-26 04:25:43,312 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2020-10-26 04:25:43,727 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2020-10-26 04:25:44,143 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2020-10-26 04:25:44,225 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:25:44,225 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:25:44,225 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:25:44,226 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:25:44,226 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:25:44,226 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:25:44,226 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:25:44,226 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:25:44,226 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration6_Lasso [2020-10-26 04:25:44,226 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:25:44,226 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:25:44,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:25:44,241 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-26 04:25:44,244 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-26 04:25:44,248 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-26 04:25:44,490 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2020-10-26 04:25:44,867 WARN L193 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2020-10-26 04:25:44,868 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-26 04:25:44,871 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-26 04:25:44,873 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-26 04:25:44,876 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-26 04:25:44,879 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-26 04:25:44,882 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-26 04:25:44,885 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-26 04:25:44,888 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-26 04:25:44,894 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-26 04:25:44,897 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-26 04:25:44,900 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-26 04:25:44,903 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-26 04:25:44,906 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-26 04:25:44,909 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-26 04:25:44,912 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-26 04:25:44,916 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-26 04:25:44,924 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-26 04:25:44,926 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-26 04:25:44,928 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-26 04:25:44,931 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-26 04:25:45,784 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:25:45,785 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-26 04:25:45,791 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-26 04:25:45,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:25:45,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:25:45,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:25:45,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:25:45,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:25:45,794 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:25:45,794 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:25:45,797 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-26 04:25:45,826 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-26 04:25:45,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:25:45,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:25:45,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:25:45,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:25:45,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:25:45,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:25:45,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:25:45,831 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-26 04:25:45,856 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-26 04:25:45,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:25:45,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:25:45,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:25:45,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:25:45,860 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:25:45,860 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:25:45,864 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-26 04:25:45,911 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-26 04:25:45,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:25:45,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:25:45,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:25:45,915 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-26 04:25:45,934 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:25:45,935 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:25:45,959 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:25:46,018 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2020-10-26 04:25:46,018 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-26 04:25:46,020 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:25:46,024 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-26 04:25:46,024 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:25:46,024 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-26 04:25:46,076 INFO L297 tatePredicateManager]: 7 out of 9 supporting invariants were superfluous and have been removed [2020-10-26 04:25:46,082 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-26 04:25:46,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:25:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:25:46,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-26 04:25:46,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:25:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:25:46,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 19 conjunts are in the unsatisfiable core [2020-10-26 04:25:46,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:25:47,144 WARN L193 SmtUtils]: Spent 753.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2020-10-26 04:25:47,537 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-26 04:25:47,539 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-26 04:25:47,539 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 5 Second operand 9 states. [2020-10-26 04:25:50,970 WARN L193 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2020-10-26 04:25:51,015 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-26 04:25:51,016 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-26 04:25:51,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-26 04:25:51,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2020-10-26 04:25:51,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 14 letters. Loop has 7 letters. [2020-10-26 04:25:51,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:25:51,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 21 letters. Loop has 7 letters. [2020-10-26 04:25:51,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:25:51,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 14 letters. Loop has 14 letters. [2020-10-26 04:25:51,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:25:51,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2020-10-26 04:25:51,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-26 04:25:51,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 30 states and 36 transitions. [2020-10-26 04:25:51,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-26 04:25:51,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-26 04:25:51,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 36 transitions. [2020-10-26 04:25:51,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:25:51,023 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2020-10-26 04:25:51,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 36 transitions. [2020-10-26 04:25:51,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-10-26 04:25:51,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-10-26 04:25:51,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2020-10-26 04:25:51,028 INFO L714 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2020-10-26 04:25:51,029 INFO L594 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2020-10-26 04:25:51,029 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-26 04:25:51,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2020-10-26 04:25:51,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-26 04:25:51,030 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:25:51,030 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:25:51,031 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:25:51,031 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:25:51,031 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~mem3;havoc #t~short4; 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-26 04:25:51,031 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~mem3;havoc #t~short4;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-26 04:25:51,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:25:51,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1647994767, now seen corresponding path program 1 times [2020-10-26 04:25:51,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:25:51,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753357374] [2020-10-26 04:25:51,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:25:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:25:51,073 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:25:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:25:51,110 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:25:51,118 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:25:51,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:25:51,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1239356, now seen corresponding path program 1 times [2020-10-26 04:25:51,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:25:51,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241904397] [2020-10-26 04:25:51,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:25:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:25:51,130 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:25:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:25:51,139 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:25:51,144 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:25:51,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:25:51,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1753822804, now seen corresponding path program 1 times [2020-10-26 04:25:51,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:25:51,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522600337] [2020-10-26 04:25:51,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:25:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:25:51,179 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:25:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:25:51,200 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:25:51,205 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:25:51,312 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2020-10-26 04:25:51,608 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2020-10-26 04:25:52,017 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2020-10-26 04:25:52,344 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2020-10-26 04:25:52,948 WARN L193 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 107 [2020-10-26 04:25:53,058 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:25:53,058 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:25:53,058 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:25:53,058 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:25:53,058 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:25:53,058 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:25:53,058 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:25:53,058 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:25:53,059 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration7_Lasso [2020-10-26 04:25:53,059 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:25:53,059 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:25:53,063 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-26 04:25:53,071 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-26 04:25:53,074 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-26 04:25:53,313 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-10-26 04:25:53,589 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2020-10-26 04:25:53,590 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-26 04:25:53,593 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-26 04:25:53,597 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-26 04:25:53,606 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-26 04:25:53,609 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-26 04:25:53,612 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-26 04:25:53,616 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-26 04:25:53,619 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-26 04:25:53,622 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-26 04:25:53,625 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-26 04:25:53,628 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-26 04:25:53,632 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-26 04:25:53,635 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-26 04:25:53,638 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-26 04:25:53,641 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-26 04:25:53,652 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-26 04:25:53,655 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-26 04:25:53,658 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-26 04:25:53,661 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-26 04:25:53,665 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-26 04:25:54,286 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2020-10-26 04:25:54,422 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:25:54,423 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-26 04:25:54,438 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-26 04:25:54,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:25:54,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:25:54,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:25:54,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:25:54,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:25:54,441 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:25:54,441 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:25:54,442 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) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:25:54,473 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-26 04:25:54,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:25:54,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:25:54,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:25:54,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:25:54,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:25:54,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:25:54,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:25:54,477 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-26 04:25:54,509 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-26 04:25:54,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:25:54,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:25:54,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:25:54,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:25:54,515 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:25:54,515 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:25:54,525 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-26 04:25:54,551 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-26 04:25:54,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:25:54,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:25:54,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:25:54,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:25:54,556 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:25:54,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:25:54,563 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) [2020-10-26 04:25:54,601 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-26 04:25:54,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:25:54,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:25:54,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:25:54,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:25:54,605 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:25:54,605 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:25:54,614 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-26 04:25:54,649 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-26 04:25:54,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:25:54,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:25:54,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:25:54,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:25:54,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:25:54,651 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:25:54,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:25:54,655 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-26 04:25:54,678 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-26 04:25:54,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:25:54,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:25:54,680 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-26 04:25:54,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:25:54,706 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2020-10-26 04:25:54,706 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-10-26 04:25:54,766 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:25:54,861 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2020-10-26 04:25:54,862 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) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:25:54,864 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:25:54,868 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2020-10-26 04:25:54,868 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:25:54,868 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-26 04:25:54,926 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2020-10-26 04:25:54,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:25:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:25:54,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-26 04:25:54,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:25:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:25:55,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 04:25:55,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:25:55,123 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-26 04:25:55,124 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-26 04:25:55,125 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 33 transitions. cyclomatic complexity: 8 Second operand 7 states. [2020-10-26 04:25:55,211 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-26 04:25:55,213 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-26 04:25:55,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-26 04:25:55,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2020-10-26 04:25:55,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 19 letters. Loop has 4 letters. [2020-10-26 04:25:55,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:25:55,214 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-26 04:25:55,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:25:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:25:55,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-26 04:25:55,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:25:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:25:55,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 04:25:55,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:25:55,407 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-26 04:25:55,407 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-26 04:25:55,408 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 33 transitions. cyclomatic complexity: 8 Second operand 7 states. [2020-10-26 04:25:55,486 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-26 04:25:55,487 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-26 04:25:55,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-26 04:25:55,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2020-10-26 04:25:55,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 19 letters. Loop has 4 letters. [2020-10-26 04:25:55,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:25:55,488 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-26 04:25:55,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:25:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:25:55,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-26 04:25:55,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:25:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:25:55,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 04:25:55,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:25:55,693 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-26 04:25:55,694 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-26 04:25:55,694 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 33 transitions. cyclomatic complexity: 8 Second operand 7 states. [2020-10-26 04:25:55,812 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-26 04:25:55,814 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-26 04:25:55,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-26 04:25:55,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2020-10-26 04:25:55,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 19 letters. Loop has 4 letters. [2020-10-26 04:25:55,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:25:55,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 23 letters. Loop has 4 letters. [2020-10-26 04:25:55,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:25:55,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 19 letters. Loop has 8 letters. [2020-10-26 04:25:55,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:25:55,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 66 transitions. [2020-10-26 04:25:55,818 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 04:25:55,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 0 states and 0 transitions. [2020-10-26 04:25:55,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-26 04:25:55,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-26 04:25:55,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-26 04:25:55,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:25:55,819 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:25:55,819 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:25:55,819 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:25:55,820 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-26 04:25:55,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-26 04:25:55,820 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 04:25:55,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-26 04:25:55,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 04:25:55 BoogieIcfgContainer [2020-10-26 04:25:55,826 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 04:25:55,827 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 04:25:55,827 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 04:25:55,827 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 04:25:55,828 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:25:37" (3/4) ... [2020-10-26 04:25:55,831 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-26 04:25:55,831 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 04:25:55,832 INFO L168 Benchmark]: Toolchain (without parser) took 19287.15 ms. Allocated memory was 46.1 MB in the beginning and 146.8 MB in the end (delta: 100.7 MB). Free memory was 23.5 MB in the beginning and 104.3 MB in the end (delta: -80.8 MB). Peak memory consumption was 21.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:25:55,832 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 46.1 MB. Free memory was 29.2 MB in the beginning and 29.2 MB in the end (delta: 33.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:25:55,833 INFO L168 Benchmark]: CACSL2BoogieTranslator took 230.71 ms. Allocated memory is still 46.1 MB. Free memory was 22.9 MB in the beginning and 23.1 MB in the end (delta: -171.5 kB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. [2020-10-26 04:25:55,834 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.99 ms. Allocated memory is still 46.1 MB. Free memory was 23.1 MB in the beginning and 21.6 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:25:55,834 INFO L168 Benchmark]: Boogie Preprocessor took 26.57 ms. Allocated memory is still 46.1 MB. Free memory was 21.6 MB in the beginning and 20.6 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:25:55,835 INFO L168 Benchmark]: RCFGBuilder took 430.53 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 20.5 MB in the beginning and 29.5 MB in the end (delta: -9.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 16.1 GB. [2020-10-26 04:25:55,835 INFO L168 Benchmark]: BuchiAutomizer took 18543.70 ms. Allocated memory was 56.6 MB in the beginning and 146.8 MB in the end (delta: 90.2 MB). Free memory was 29.3 MB in the beginning and 104.3 MB in the end (delta: -75.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:25:55,836 INFO L168 Benchmark]: Witness Printer took 3.83 ms. Allocated memory is still 146.8 MB. Free memory is still 104.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:25:55,839 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.20 ms. Allocated memory is still 46.1 MB. Free memory was 29.2 MB in the beginning and 29.2 MB in the end (delta: 33.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 230.71 ms. Allocated memory is still 46.1 MB. Free memory was 22.9 MB in the beginning and 23.1 MB in the end (delta: -171.5 kB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 36.99 ms. Allocated memory is still 46.1 MB. Free memory was 23.1 MB in the beginning and 21.6 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 26.57 ms. Allocated memory is still 46.1 MB. Free memory was 21.6 MB in the beginning and 20.6 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 430.53 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 20.5 MB in the beginning and 29.5 MB in the end (delta: -9.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 18543.70 ms. Allocated memory was 56.6 MB in the beginning and 146.8 MB in the end (delta: 90.2 MB). Free memory was 29.3 MB in the beginning and 104.3 MB in the end (delta: -75.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 16.1 GB. * Witness Printer took 3.83 ms. Allocated memory is still 146.8 MB. Free memory is still 104.3 MB. There was no memory consumed. Max. memory is 16.1 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 unknown-#length-unknown[malloc(n * sizeof (int))] + -4 * i 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 18.4s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 11.7s. Construction of modules took 2.1s. Büchi inclusion checks took 4.2s. 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, 2.1s 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: 193ms 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...