./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.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 8104a25549f6efe413528ca8cc098e1acad610e4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:34:21,142 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:34:21,145 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:34:21,158 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:34:21,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:34:21,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:34:21,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:34:21,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:34:21,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:34:21,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:34:21,169 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:34:21,170 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:34:21,171 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:34:21,172 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:34:21,173 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:34:21,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:34:21,176 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:34:21,177 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:34:21,179 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:34:21,181 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:34:21,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:34:21,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:34:21,185 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:34:21,186 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:34:21,190 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:34:21,191 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:34:21,192 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:34:21,193 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:34:21,195 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:34:21,196 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:34:21,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:34:21,199 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:34:21,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:34:21,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:34:21,205 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:34:21,205 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:34:21,207 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:34:21,207 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:34:21,208 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:34:21,211 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:34:21,213 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:34:21,215 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 20:34:21,238 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:34:21,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:34:21,242 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:34:21,243 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:34:21,243 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:34:21,243 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:34:21,244 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:34:21,244 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:34:21,244 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:34:21,244 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:34:21,245 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:34:21,246 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:34:21,246 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:34:21,247 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:34:21,247 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:34:21,247 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:34:21,247 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:34:21,248 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:34:21,248 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:34:21,248 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:34:21,249 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:34:21,249 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:34:21,249 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:34:21,250 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:34:21,250 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:34:21,250 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:34:21,250 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:34:21,251 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:34:21,251 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:34:21,252 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:34:21,252 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8104a25549f6efe413528ca8cc098e1acad610e4 [2019-11-28 20:34:21,595 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:34:21,609 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:34:21,612 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:34:21,614 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:34:21,615 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:34:21,616 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i [2019-11-28 20:34:21,687 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f8f0e833/e0974fe6e57049e7bec6f4ede629f1ed/FLAG0dd6925c6 [2019-11-28 20:34:22,223 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:34:22,224 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i [2019-11-28 20:34:22,238 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f8f0e833/e0974fe6e57049e7bec6f4ede629f1ed/FLAG0dd6925c6 [2019-11-28 20:34:22,587 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f8f0e833/e0974fe6e57049e7bec6f4ede629f1ed [2019-11-28 20:34:22,591 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:34:22,593 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:34:22,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:34:22,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:34:22,598 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:34:22,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:34:22" (1/1) ... [2019-11-28 20:34:22,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff623f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:22, skipping insertion in model container [2019-11-28 20:34:22,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:34:22" (1/1) ... [2019-11-28 20:34:22,611 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:34:22,661 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:34:23,060 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:34:23,075 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:34:23,126 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:34:23,187 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:34:23,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:23 WrapperNode [2019-11-28 20:34:23,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:34:23,190 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:34:23,190 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:34:23,190 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:34:23,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:23" (1/1) ... [2019-11-28 20:34:23,224 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:23" (1/1) ... [2019-11-28 20:34:23,249 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:34:23,249 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:34:23,249 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:34:23,249 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:34:23,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:23" (1/1) ... [2019-11-28 20:34:23,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:23" (1/1) ... [2019-11-28 20:34:23,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:23" (1/1) ... [2019-11-28 20:34:23,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:23" (1/1) ... [2019-11-28 20:34:23,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:23" (1/1) ... [2019-11-28 20:34:23,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:23" (1/1) ... [2019-11-28 20:34:23,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:23" (1/1) ... [2019-11-28 20:34:23,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:34:23,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:34:23,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:34:23,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:34:23,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:23" (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 [2019-11-28 20:34:23,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:34:23,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:34:23,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:34:23,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:34:23,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:34:23,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:34:23,609 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:34:23,610 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 20:34:23,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:34:23 BoogieIcfgContainer [2019-11-28 20:34:23,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:34:23,612 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:34:23,612 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:34:23,616 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:34:23,617 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:34:23,617 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:34:22" (1/3) ... [2019-11-28 20:34:23,618 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77bd854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:34:23, skipping insertion in model container [2019-11-28 20:34:23,619 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:34:23,619 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:23" (2/3) ... [2019-11-28 20:34:23,620 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77bd854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:34:23, skipping insertion in model container [2019-11-28 20:34:23,620 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:34:23,620 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:34:23" (3/3) ... [2019-11-28 20:34:23,622 INFO L371 chiAutomizerObserver]: Analyzing ICFG insertionsort-alloca-2.i [2019-11-28 20:34:23,667 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:34:23,667 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:34:23,667 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:34:23,667 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:34:23,668 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:34:23,668 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:34:23,668 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:34:23,669 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:34:23,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-28 20:34:23,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:34:23,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:23,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:23,710 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:34:23,710 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:34:23,710 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:34:23,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-28 20:34:23,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:34:23,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:23,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:23,713 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:34:23,713 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:34:23,720 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 16#L560true assume !(main_~array_size~0 < 1); 5#L560-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 6#L550-3true [2019-11-28 20:34:23,720 INFO L796 eck$LassoCheckResult]: Loop: 6#L550-3true assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 8#L553-6true assume !true; 9#L553-7true call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 3#L550-2true insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 6#L550-3true [2019-11-28 20:34:23,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:23,727 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-28 20:34:23,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:23,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173929736] [2019-11-28 20:34:23,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:23,877 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:23,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:23,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1465782, now seen corresponding path program 1 times [2019-11-28 20:34:23,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:23,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388510869] [2019-11-28 20:34:23,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:23,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:23,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388510869] [2019-11-28 20:34:23,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:34:23,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:34:23,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011805992] [2019-11-28 20:34:23,927 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:34:23,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:34:23,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 20:34:23,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 20:34:23,950 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2019-11-28 20:34:23,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:34:23,965 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-11-28 20:34:23,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 20:34:23,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2019-11-28 20:34:23,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:34:23,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 14 transitions. [2019-11-28 20:34:23,988 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 20:34:23,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 20:34:23,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-11-28 20:34:23,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:34:23,991 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-28 20:34:24,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-11-28 20:34:24,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-28 20:34:24,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-28 20:34:24,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-11-28 20:34:24,035 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-28 20:34:24,035 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-28 20:34:24,035 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:34:24,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-11-28 20:34:24,037 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:34:24,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:24,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:24,039 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:34:24,039 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:34:24,040 INFO L794 eck$LassoCheckResult]: Stem: 45#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 42#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 43#L560 assume !(main_~array_size~0 < 1); 44#L560-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 41#L550-3 [2019-11-28 20:34:24,040 INFO L796 eck$LassoCheckResult]: Loop: 41#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 39#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 46#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 47#L553-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 48#L553-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 40#L550-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 41#L550-3 [2019-11-28 20:34:24,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:24,041 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-11-28 20:34:24,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:24,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935939152] [2019-11-28 20:34:24,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:24,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:24,112 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:24,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:24,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338221, now seen corresponding path program 1 times [2019-11-28 20:34:24,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:24,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273083886] [2019-11-28 20:34:24,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:24,198 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:24,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:24,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1897689455, now seen corresponding path program 1 times [2019-11-28 20:34:24,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:24,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739856474] [2019-11-28 20:34:24,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:24,292 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:24,480 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-11-28 20:34:24,696 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-11-28 20:34:24,783 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:34:24,783 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:34:24,784 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:34:24,784 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:34:24,784 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:34:24,785 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:24,785 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:34:24,785 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:34:24,785 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration2_Lasso [2019-11-28 20:34:24,786 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:34:24,786 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:34:24,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:24,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:24,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:24,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:24,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:24,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:24,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:24,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:24,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:24,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:24,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,012 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-11-28 20:34:25,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,515 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:34:25,521 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) [2019-11-28 20:34:25,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:25,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:25,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:25,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:25,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:25,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:25,535 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:25,535 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 [2019-11-28 20:34:25,539 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) [2019-11-28 20:34:25,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:25,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:25,555 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:25,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:25,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:25,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:25,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:25,557 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 [2019-11-28 20:34:25,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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:25,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:25,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:25,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:25,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:25,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:25,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:25,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:25,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:25,586 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:25,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:25,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:25,596 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:25,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:25,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:25,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:25,597 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:25,597 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:25,599 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 [2019-11-28 20:34:25,610 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:25,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:25,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:25,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:25,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:25,617 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:25,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:25,622 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) [2019-11-28 20:34:25,633 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:25,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:25,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:25,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:25,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:25,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:25,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:25,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:25,642 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:25,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:25,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:25,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:25,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:25,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:25,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:25,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:25,675 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) [2019-11-28 20:34:25,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:25,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:25,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:25,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:25,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:25,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:25,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:25,700 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) [2019-11-28 20:34:25,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:25,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:25,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:25,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:25,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:25,715 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 [2019-11-28 20:34:25,718 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:25,724 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:25,734 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:25,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:25,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:25,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:25,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:25,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:25,763 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:25,763 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:25,774 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 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:25,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:25,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:25,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:25,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:25,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:25,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:25,794 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:25,801 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 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 [2019-11-28 20:34:25,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:25,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:25,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:25,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:25,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:25,819 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:25,820 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:25,830 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 [2019-11-28 20:34:25,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:25,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:25,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:25,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:25,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:25,847 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:25,848 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:25,852 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) [2019-11-28 20:34:25,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:25,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:25,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:25,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:25,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:25,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:25,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:25,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:25,882 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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) [2019-11-28 20:34:25,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:25,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:25,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:25,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:25,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:25,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:25,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:25,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:25,903 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:25,912 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:25,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:25,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:25,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:25,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:25,952 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:25,952 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:25,971 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:34:26,154 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2019-11-28 20:34:26,155 INFO L444 ModelExtractionUtils]: 11 out of 37 variables were initially zero. Simplification set additionally 22 variables to zero. 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) [2019-11-28 20:34:26,165 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:26,170 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:34:26,170 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:34:26,171 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~a.offset, ULTIMATE.start_insertionSort_~i~0, v_rep(select #length ULTIMATE.start_insertionSort_~a.base)_1) = -1*ULTIMATE.start_insertionSort_~a.offset - 4*ULTIMATE.start_insertionSort_~i~0 + 1*v_rep(select #length ULTIMATE.start_insertionSort_~a.base)_1 Supporting invariants [] [2019-11-28 20:34:26,196 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-28 20:34:26,209 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 20:34:26,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:26,277 INFO L264 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:34:26,279 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:26,305 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:34:26,306 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:26,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:26,343 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:34:26,347 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-28 20:34:26,406 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 19 states and 25 transitions. Complement of second has 4 states. [2019-11-28 20:34:26,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:34:26,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:34:26,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-11-28 20:34:26,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-28 20:34:26,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:26,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-28 20:34:26,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:26,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 12 letters. [2019-11-28 20:34:26,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:26,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 25 transitions. [2019-11-28 20:34:26,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 20:34:26,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 23 transitions. [2019-11-28 20:34:26,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-28 20:34:26,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 20:34:26,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2019-11-28 20:34:26,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:34:26,426 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-28 20:34:26,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2019-11-28 20:34:26,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-28 20:34:26,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-28 20:34:26,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-11-28 20:34:26,431 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-28 20:34:26,431 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-28 20:34:26,431 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:34:26,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-11-28 20:34:26,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 20:34:26,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:26,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:26,438 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:34:26,439 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:34:26,439 INFO L794 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 140#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 141#L560 assume !(main_~array_size~0 < 1); 142#L560-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 143#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 135#L553-6 [2019-11-28 20:34:26,439 INFO L796 eck$LassoCheckResult]: Loop: 135#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 144#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 147#L553-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 134#L553-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 135#L553-6 [2019-11-28 20:34:26,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:26,440 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-11-28 20:34:26,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:26,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123011019] [2019-11-28 20:34:26,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:26,490 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:26,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:26,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 1 times [2019-11-28 20:34:26,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:26,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798777241] [2019-11-28 20:34:26,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:26,504 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:26,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:26,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1185710257, now seen corresponding path program 1 times [2019-11-28 20:34:26,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:26,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862149186] [2019-11-28 20:34:26,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:26,536 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:26,825 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-11-28 20:34:26,886 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:34:26,886 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:34:26,886 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:34:26,886 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:34:26,886 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:34:26,886 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:26,886 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:34:26,886 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:34:26,887 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration3_Lasso [2019-11-28 20:34:26,887 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:34:26,887 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:34:26,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:26,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:27,063 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-11-28 20:34:27,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:27,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:27,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:27,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:27,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:27,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:27,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:27,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:27,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:27,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:27,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:27,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:27,509 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:34:27,513 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2019-11-28 20:34:27,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:27,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:27,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:27,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:27,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:27,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:27,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:27,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:27,534 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) [2019-11-28 20:34:27,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:27,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:27,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:27,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:27,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:27,558 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:27,559 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:27,567 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) [2019-11-28 20:34:27,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:27,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:27,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:27,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:27,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:27,606 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:27,607 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:27,629 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:34:27,680 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2019-11-28 20:34:27,680 INFO L444 ModelExtractionUtils]: 23 out of 37 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:27,696 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:27,699 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:34:27,699 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:34:27,699 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0) = 1*ULTIMATE.start_insertionSort_~j~0 Supporting invariants [] [2019-11-28 20:34:27,715 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-28 20:34:27,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:27,748 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:34:27,749 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:27,760 INFO L264 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:34:27,762 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:27,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:27,806 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 20:34:27,806 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-11-28 20:34:27,855 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 47 states and 62 transitions. Complement of second has 9 states. [2019-11-28 20:34:27,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 20:34:27,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:34:27,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-11-28 20:34:27,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-28 20:34:27,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:27,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-28 20:34:27,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:27,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-28 20:34:27,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:27,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 62 transitions. [2019-11-28 20:34:27,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 20:34:27,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 30 states and 40 transitions. [2019-11-28 20:34:27,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-28 20:34:27,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-28 20:34:27,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-11-28 20:34:27,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:34:27,864 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-11-28 20:34:27,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-11-28 20:34:27,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2019-11-28 20:34:27,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 20:34:27,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2019-11-28 20:34:27,868 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-11-28 20:34:27,868 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-11-28 20:34:27,868 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:34:27,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2019-11-28 20:34:27,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 20:34:27,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:27,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:27,870 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:34:27,870 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:34:27,870 INFO L794 eck$LassoCheckResult]: Stem: 281#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 274#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 275#L560 assume !(main_~array_size~0 < 1); 276#L560-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 277#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 271#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 283#L553-1 assume !insertionSort_#t~short6; 284#L553-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 285#L553-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 272#L550-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 273#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 269#L553-6 [2019-11-28 20:34:27,870 INFO L796 eck$LassoCheckResult]: Loop: 269#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 278#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 282#L553-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 268#L553-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 269#L553-6 [2019-11-28 20:34:27,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:27,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1303016098, now seen corresponding path program 1 times [2019-11-28 20:34:27,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:27,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344633648] [2019-11-28 20:34:27,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:27,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:27,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344633648] [2019-11-28 20:34:27,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:34:27,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:34:27,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237038971] [2019-11-28 20:34:27,938 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:34:27,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:27,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 2 times [2019-11-28 20:34:27,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:27,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611319267] [2019-11-28 20:34:27,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:27,964 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:28,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:34:28,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:34:28,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:34:28,091 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-11-28 20:34:28,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:34:28,160 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-11-28 20:34:28,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:34:28,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2019-11-28 20:34:28,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 20:34:28,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 43 transitions. [2019-11-28 20:34:28,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-28 20:34:28,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-28 20:34:28,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2019-11-28 20:34:28,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:34:28,164 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-28 20:34:28,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2019-11-28 20:34:28,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2019-11-28 20:34:28,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 20:34:28,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2019-11-28 20:34:28,167 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-28 20:34:28,167 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-28 20:34:28,167 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:34:28,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2019-11-28 20:34:28,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 20:34:28,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:28,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:28,169 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:34:28,169 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:34:28,169 INFO L794 eck$LassoCheckResult]: Stem: 350#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 341#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 342#L560 assume !(main_~array_size~0 < 1); 343#L560-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 344#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 346#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 347#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 352#L553-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 353#L553-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 339#L550-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 340#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 336#L553-6 [2019-11-28 20:34:28,169 INFO L796 eck$LassoCheckResult]: Loop: 336#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 345#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 351#L553-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 335#L553-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 336#L553-6 [2019-11-28 20:34:28,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:28,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1301169056, now seen corresponding path program 2 times [2019-11-28 20:34:28,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:28,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722983391] [2019-11-28 20:34:28,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:28,214 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:28,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:28,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 3 times [2019-11-28 20:34:28,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:28,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544437654] [2019-11-28 20:34:28,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:28,226 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:28,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:28,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1886560891, now seen corresponding path program 1 times [2019-11-28 20:34:28,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:28,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691054679] [2019-11-28 20:34:28,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:28,307 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:28,714 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 89 [2019-11-28 20:34:28,798 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:34:28,799 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:34:28,799 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:34:28,799 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:34:28,799 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:34:28,799 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:28,800 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:34:28,800 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:34:28,800 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration5_Lasso [2019-11-28 20:34:28,800 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:34:28,800 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:34:28,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:29,037 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-11-28 20:34:29,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:29,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:29,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:29,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:29,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:29,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:29,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:29,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:29,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:29,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:29,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:29,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:29,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:29,525 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:34:29,525 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:29,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:29,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:29,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:29,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:29,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:29,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:29,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:29,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:29,541 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 [2019-11-28 20:34:29,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:29,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:29,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:29,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:29,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:29,555 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:29,555 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:29,561 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:29,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:29,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:29,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:29,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:29,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:29,577 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:29,577 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:29,585 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:29,592 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:29,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:29,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:29,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:29,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:29,598 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:29,598 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:29,607 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:29,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:29,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:29,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:29,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:29,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:29,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:29,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:29,642 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:34:29,724 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2019-11-28 20:34:29,724 INFO L444 ModelExtractionUtils]: 10 out of 37 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:29,732 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:29,735 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:34:29,735 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:34:29,735 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0) = 1*ULTIMATE.start_insertionSort_~j~0 Supporting invariants [] [2019-11-28 20:34:29,755 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-11-28 20:34:29,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:29,782 INFO L264 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:34:29,784 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:29,799 INFO L264 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:34:29,799 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:29,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:29,836 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 20:34:29,836 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-28 20:34:29,880 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 48 states and 62 transitions. Complement of second has 9 states. [2019-11-28 20:34:29,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 20:34:29,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:34:29,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-11-28 20:34:29,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2019-11-28 20:34:29,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:29,882 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:34:29,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:29,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:29,913 INFO L264 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:34:29,914 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:29,922 INFO L264 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:34:29,922 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:29,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:29,950 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 20:34:29,951 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-28 20:34:29,988 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 48 states and 62 transitions. Complement of second has 9 states. [2019-11-28 20:34:29,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 20:34:29,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:34:29,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-11-28 20:34:29,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2019-11-28 20:34:29,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:29,990 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:34:30,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:30,016 INFO L264 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:34:30,016 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:30,023 INFO L264 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:34:30,023 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:30,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:30,050 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 20:34:30,050 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-28 20:34:30,095 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 56 states and 75 transitions. Complement of second has 8 states. [2019-11-28 20:34:30,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 20:34:30,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:34:30,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-11-28 20:34:30,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 4 letters. [2019-11-28 20:34:30,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:30,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-28 20:34:30,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:30,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 8 letters. [2019-11-28 20:34:30,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:30,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 75 transitions. [2019-11-28 20:34:30,100 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:34:30,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 0 states and 0 transitions. [2019-11-28 20:34:30,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 20:34:30,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 20:34:30,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 20:34:30,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:34:30,101 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:34:30,101 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:34:30,101 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:34:30,101 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 20:34:30,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:34:30,101 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:34:30,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 20:34:30,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:34:30 BoogieIcfgContainer [2019-11-28 20:34:30,110 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:34:30,111 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:34:30,111 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:34:30,112 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:34:30,112 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:34:23" (3/4) ... [2019-11-28 20:34:30,117 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:34:30,117 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:34:30,119 INFO L168 Benchmark]: Toolchain (without parser) took 7526.17 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 304.1 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 128.5 MB. Max. memory is 11.5 GB. [2019-11-28 20:34:30,120 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:34:30,125 INFO L168 Benchmark]: CACSL2BoogieTranslator took 594.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -155.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:34:30,127 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:34:30,127 INFO L168 Benchmark]: Boogie Preprocessor took 28.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:34:30,130 INFO L168 Benchmark]: RCFGBuilder took 333.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:34:30,136 INFO L168 Benchmark]: BuchiAutomizer took 6497.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 168.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -45.7 MB). Peak memory consumption was 123.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:34:30,138 INFO L168 Benchmark]: Witness Printer took 5.89 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:34:30,143 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 594.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -155.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 333.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6497.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 168.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -45.7 MB). Peak memory consumption was 123.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.89 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * a + -4 * i + unknown-#length-unknown[a] and consists of 3 locations. One deterministic module has affine ranking function j and consists of 5 locations. One nondeterministic module has affine ranking function j and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.4s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 79 SDtfs, 116 SDslu, 40 SDs, 0 SdLazy, 136 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital165 mio100 ax110 hnf99 lsp86 ukn77 mio100 lsp64 div100 bol100 ite100 ukn100 eq180 hnf82 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...