./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/loops/insertion_sort_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/loops/insertion_sort_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e74ff11a050ce92aa6d5151e04de4f3f3a890d4c ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:41:15,482 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:41:15,484 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:41:15,501 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:41:15,502 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:41:15,503 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:41:15,505 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:41:15,507 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:41:15,509 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:41:15,510 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:41:15,511 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:41:15,512 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:41:15,513 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:41:15,514 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:41:15,515 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:41:15,516 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:41:15,517 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:41:15,519 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:41:15,522 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:41:15,523 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:41:15,525 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:41:15,526 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:41:15,529 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:41:15,529 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:41:15,530 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:41:15,531 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:41:15,532 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:41:15,533 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:41:15,534 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:41:15,536 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:41:15,536 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:41:15,537 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:41:15,537 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:41:15,537 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:41:15,538 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:41:15,539 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:41:15,539 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 23:41:15,561 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:41:15,562 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:41:15,563 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:41:15,563 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:41:15,567 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:41:15,567 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:41:15,567 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:41:15,567 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:41:15,568 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:41:15,568 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:41:15,568 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:41:15,568 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:41:15,568 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:41:15,568 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:41:15,569 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:41:15,569 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:41:15,570 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:41:15,570 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:41:15,570 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:41:15,570 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:41:15,570 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:41:15,571 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:41:15,572 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:41:15,572 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:41:15,572 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:41:15,573 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:41:15,573 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:41:15,573 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:41:15,573 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:41:15,573 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:41:15,574 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:41:15,575 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:41:15,575 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e74ff11a050ce92aa6d5151e04de4f3f3a890d4c [2018-11-28 23:41:15,620 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:41:15,638 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:41:15,644 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:41:15,645 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:41:15,646 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:41:15,646 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/insertion_sort_true-unreach-call_true-termination.i [2018-11-28 23:41:15,711 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdfcae070/6ee80664b0f943049ba6a151cafcf161/FLAGda746d793 [2018-11-28 23:41:16,154 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:41:16,155 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/insertion_sort_true-unreach-call_true-termination.i [2018-11-28 23:41:16,160 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdfcae070/6ee80664b0f943049ba6a151cafcf161/FLAGda746d793 [2018-11-28 23:41:16,533 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdfcae070/6ee80664b0f943049ba6a151cafcf161 [2018-11-28 23:41:16,537 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:41:16,538 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:41:16,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:41:16,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:41:16,543 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:41:16,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:41:16" (1/1) ... [2018-11-28 23:41:16,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d05d18b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:16, skipping insertion in model container [2018-11-28 23:41:16,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:41:16" (1/1) ... [2018-11-28 23:41:16,556 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:41:16,578 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:41:16,828 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:41:16,834 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:41:16,869 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:41:16,898 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:41:16,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:16 WrapperNode [2018-11-28 23:41:16,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:41:16,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:41:16,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:41:16,900 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:41:16,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:16" (1/1) ... [2018-11-28 23:41:16,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:16" (1/1) ... [2018-11-28 23:41:16,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:41:16,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:41:16,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:41:16,941 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:41:16,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:16" (1/1) ... [2018-11-28 23:41:16,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:16" (1/1) ... [2018-11-28 23:41:16,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:16" (1/1) ... [2018-11-28 23:41:16,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:16" (1/1) ... [2018-11-28 23:41:16,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:16" (1/1) ... [2018-11-28 23:41:16,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:16" (1/1) ... [2018-11-28 23:41:16,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:16" (1/1) ... [2018-11-28 23:41:16,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:41:16,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:41:16,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:41:16,968 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:41:16,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:41:17,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:41:17,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:41:17,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:41:17,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:41:17,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:41:17,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:41:17,523 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:41:17,523 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-28 23:41:17,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:41:17 BoogieIcfgContainer [2018-11-28 23:41:17,524 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:41:17,525 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:41:17,525 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:41:17,529 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:41:17,529 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:41:17,530 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:41:16" (1/3) ... [2018-11-28 23:41:17,531 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4bd06965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:41:17, skipping insertion in model container [2018-11-28 23:41:17,531 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:41:17,531 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:16" (2/3) ... [2018-11-28 23:41:17,531 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4bd06965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:41:17, skipping insertion in model container [2018-11-28 23:41:17,532 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:41:17,532 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:41:17" (3/3) ... [2018-11-28 23:41:17,534 INFO L375 chiAutomizerObserver]: Analyzing ICFG insertion_sort_true-unreach-call_true-termination.i [2018-11-28 23:41:17,596 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:41:17,597 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:41:17,597 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:41:17,597 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:41:17,598 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:41:17,598 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:41:17,598 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:41:17,598 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:41:17,598 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:41:17,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 23:41:17,634 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-28 23:41:17,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:17,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:17,643 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:41:17,643 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:41:17,643 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:41:17,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 23:41:17,647 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-28 23:41:17,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:17,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:17,648 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:41:17,648 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:41:17,658 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.alloc(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 11#L14-3true [2018-11-28 23:41:17,659 INFO L796 eck$LassoCheckResult]: Loop: 11#L14-3true assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 13#L17-5true assume !true; 12#L17-6true call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 14#L14-2true main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 11#L14-3true [2018-11-28 23:41:17,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:17,668 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 23:41:17,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:17,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:17,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:17,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:17,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:17,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:17,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1249301, now seen corresponding path program 1 times [2018-11-28 23:41:17,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:17,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:17,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:17,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:17,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:17,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:17,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:41:17,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:41:17,852 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:41:17,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 23:41:17,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 23:41:17,871 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-28 23:41:17,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:41:17,879 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-11-28 23:41:17,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:41:17,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2018-11-28 23:41:17,884 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 23:41:17,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 16 transitions. [2018-11-28 23:41:17,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 23:41:17,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 23:41:17,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2018-11-28 23:41:17,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:41:17,891 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-28 23:41:17,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2018-11-28 23:41:17,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-28 23:41:17,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 23:41:17,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-11-28 23:41:17,922 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-28 23:41:17,922 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-28 23:41:17,922 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:41:17,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2018-11-28 23:41:17,923 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 23:41:17,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:17,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:17,924 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:41:17,924 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:41:17,924 INFO L794 eck$LassoCheckResult]: Stem: 52#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 48#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.alloc(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 49#L14-3 [2018-11-28 23:41:17,924 INFO L796 eck$LassoCheckResult]: Loop: 49#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 55#L17-5 main_#t~short4 := main_~i~0 >= 0; 44#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 45#L17-3 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 53#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 54#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 49#L14-3 [2018-11-28 23:41:17,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:17,925 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-28 23:41:17,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:17,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:17,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:17,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:17,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:17,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:17,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1188208270, now seen corresponding path program 1 times [2018-11-28 23:41:17,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:17,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:17,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:17,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:17,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:18,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:18,004 INFO L82 PathProgramCache]: Analyzing trace with hash 268257488, now seen corresponding path program 1 times [2018-11-28 23:41:18,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:18,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:18,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:18,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:18,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:18,827 WARN L180 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2018-11-28 23:41:19,143 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-28 23:41:19,514 WARN L180 SmtUtils]: Spent 368.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-28 23:41:19,531 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:41:19,532 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:41:19,532 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:41:19,533 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:41:19,533 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:41:19,533 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:41:19,533 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:41:19,533 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:41:19,534 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_true-unreach-call_true-termination.i_Iteration2_Lasso [2018-11-28 23:41:19,534 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:41:19,534 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:41:19,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:19,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:19,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:19,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:19,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:19,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:19,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:19,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:19,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:19,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:19,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:19,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:20,050 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-11-28 23:41:20,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:20,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:20,338 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-28 23:41:20,603 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-11-28 23:41:20,731 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-11-28 23:41:21,155 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-11-28 23:41:21,237 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:41:21,243 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:41:21,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:21,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:21,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:21,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:21,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:21,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:21,251 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:21,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:21,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:21,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:21,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:21,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:21,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:21,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:21,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:21,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:21,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:21,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:21,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:21,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:21,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:21,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:21,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:21,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:21,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:21,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:21,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:21,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:21,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:21,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:21,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:21,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:21,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:21,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:21,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:21,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:21,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:21,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:21,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:21,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:21,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:21,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:21,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:21,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:21,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:21,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:21,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:21,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:21,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:21,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:21,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:21,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:21,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:21,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:21,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:21,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:21,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:21,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:21,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:21,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:21,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:21,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:21,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:21,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:21,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:21,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:21,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:21,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:21,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:21,284 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:21,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:21,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:21,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:21,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:21,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:21,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:21,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:21,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:21,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:21,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:21,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:21,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:21,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:21,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:21,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:21,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:21,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:21,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:21,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:21,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:21,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:21,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:21,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:21,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:21,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:21,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:21,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:21,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:21,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:21,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:21,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:21,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:21,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:21,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:21,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:21,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:21,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:21,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:21,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:21,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:21,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:21,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:21,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:21,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:21,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:21,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:21,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:21,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:21,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:21,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:21,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:21,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:21,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:21,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:21,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:21,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:21,327 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:41:21,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:21,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:21,341 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:41:21,341 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:21,438 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:41:21,511 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:41:21,512 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 23:41:21,515 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:41:21,517 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:41:21,517 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:41:21,518 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#v~0.base)_1, ULTIMATE.start_main_~#v~0.offset, ULTIMATE.start_main_~j~0) = 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_1 - 1*ULTIMATE.start_main_~#v~0.offset - 4*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-28 23:41:21,573 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-28 23:41:21,594 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:41:21,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:21,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:21,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:21,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:21,784 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:41:21,785 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 23:41:21,859 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 25 states and 34 transitions. Complement of second has 6 states. [2018-11-28 23:41:21,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:41:21,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:41:21,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-28 23:41:21,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-28 23:41:21,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:21,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-28 23:41:21,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:21,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 12 letters. [2018-11-28 23:41:21,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:21,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2018-11-28 23:41:21,868 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-28 23:41:21,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 25 transitions. [2018-11-28 23:41:21,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:41:21,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 23:41:21,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-11-28 23:41:21,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:41:21,869 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-28 23:41:21,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-11-28 23:41:21,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-28 23:41:21,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 23:41:21,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2018-11-28 23:41:21,872 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-11-28 23:41:21,872 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-11-28 23:41:21,872 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:41:21,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2018-11-28 23:41:21,873 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-28 23:41:21,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:21,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:21,874 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:41:21,874 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:41:21,874 INFO L794 eck$LassoCheckResult]: Stem: 147#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 143#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.alloc(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 144#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 151#L17-5 [2018-11-28 23:41:21,874 INFO L796 eck$LassoCheckResult]: Loop: 151#L17-5 main_#t~short4 := main_~i~0 >= 0; 137#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 138#L17-3 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;call main_#t~mem5 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem5;main_~i~0 := main_~i~0 - 1; 151#L17-5 [2018-11-28 23:41:21,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:21,875 INFO L82 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2018-11-28 23:41:21,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:21,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:21,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:21,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:21,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:21,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:21,898 INFO L82 PathProgramCache]: Analyzing trace with hash 44790, now seen corresponding path program 1 times [2018-11-28 23:41:21,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:21,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:21,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:21,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:21,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:21,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:21,910 INFO L82 PathProgramCache]: Analyzing trace with hash 889663632, now seen corresponding path program 1 times [2018-11-28 23:41:21,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:21,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:21,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:21,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:21,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:22,131 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2018-11-28 23:41:22,298 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2018-11-28 23:41:22,409 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2018-11-28 23:41:22,413 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:41:22,413 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:41:22,413 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:41:22,413 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:41:22,413 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:41:22,414 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:41:22,414 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:41:22,414 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:41:22,414 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_true-unreach-call_true-termination.i_Iteration3_Lasso [2018-11-28 23:41:22,414 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:41:22,414 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:41:22,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:22,686 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-11-28 23:41:22,893 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-11-28 23:41:22,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:22,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:22,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:22,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:22,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:22,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:22,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:22,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:22,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:22,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:22,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:22,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:22,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:23,188 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:41:23,188 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:41:23,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:23,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:23,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:23,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:23,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:23,192 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:23,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:23,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:23,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:23,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:23,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:23,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:23,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:23,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:23,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:23,221 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:41:23,236 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:41:23,236 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:41:23,236 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:41:23,238 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:41:23,238 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:41:23,238 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2018-11-28 23:41:23,295 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-28 23:41:23,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:23,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:23,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:23,668 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-28 23:41:23,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:23,688 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:41:23,689 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-11-28 23:41:23,752 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 69 states and 87 transitions. Complement of second has 9 states. [2018-11-28 23:41:23,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:41:23,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:41:23,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2018-11-28 23:41:23,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 3 letters. Loop has 3 letters. [2018-11-28 23:41:23,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:23,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-28 23:41:23,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:23,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-28 23:41:23,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:23,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 87 transitions. [2018-11-28 23:41:23,764 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 19 [2018-11-28 23:41:23,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 45 states and 58 transitions. [2018-11-28 23:41:23,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-28 23:41:23,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-28 23:41:23,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 58 transitions. [2018-11-28 23:41:23,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:41:23,768 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 58 transitions. [2018-11-28 23:41:23,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 58 transitions. [2018-11-28 23:41:23,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 22. [2018-11-28 23:41:23,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 23:41:23,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-11-28 23:41:23,772 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-11-28 23:41:23,773 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-11-28 23:41:23,773 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:41:23,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2018-11-28 23:41:23,774 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-28 23:41:23,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:23,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:23,774 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:41:23,775 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:41:23,775 INFO L794 eck$LassoCheckResult]: Stem: 287#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 283#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.alloc(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 284#L14-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 285#L14-4 main_~k~0 := 1; 281#L23-3 [2018-11-28 23:41:23,775 INFO L796 eck$LassoCheckResult]: Loop: 281#L23-3 assume !!(main_~k~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem7 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * (main_~k~0 - 1), 4);call main_#t~mem8 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~k~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem7 <= main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 282#L4 assume !(0 == __VERIFIER_assert_~cond); 295#L4-2 havoc main_#t~mem8;havoc main_#t~mem7; 286#L23-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 281#L23-3 [2018-11-28 23:41:23,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:23,775 INFO L82 PathProgramCache]: Analyzing trace with hash 925727, now seen corresponding path program 1 times [2018-11-28 23:41:23,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:23,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:23,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:23,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:23,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:23,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:23,798 INFO L82 PathProgramCache]: Analyzing trace with hash 2285066, now seen corresponding path program 1 times [2018-11-28 23:41:23,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:23,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:23,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:23,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:23,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:23,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:23,824 INFO L82 PathProgramCache]: Analyzing trace with hash 231194408, now seen corresponding path program 1 times [2018-11-28 23:41:23,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:23,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:23,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:23,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:23,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:24,114 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 32 [2018-11-28 23:41:24,456 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 27 [2018-11-28 23:41:24,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:24,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:41:24,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:41:24,659 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2018-11-28 23:41:24,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:41:24,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:41:24,660 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-11-28 23:41:24,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:41:24,869 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2018-11-28 23:41:24,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:41:24,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2018-11-28 23:41:24,872 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-28 23:41:24,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 32 transitions. [2018-11-28 23:41:24,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:41:24,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:41:24,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2018-11-28 23:41:24,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:41:24,874 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-11-28 23:41:24,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2018-11-28 23:41:24,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-11-28 23:41:24,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 23:41:24,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2018-11-28 23:41:24,877 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-11-28 23:41:24,877 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-11-28 23:41:24,877 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:41:24,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2018-11-28 23:41:24,878 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-28 23:41:24,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:24,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:24,878 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:41:24,879 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:41:24,879 INFO L794 eck$LassoCheckResult]: Stem: 346#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 342#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.alloc(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 343#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 349#L17-5 main_#t~short4 := main_~i~0 >= 0; 338#L17-1 assume !main_#t~short4; 339#L17-3 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 347#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 348#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 350#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 352#L17-5 [2018-11-28 23:41:24,879 INFO L796 eck$LassoCheckResult]: Loop: 352#L17-5 main_#t~short4 := main_~i~0 >= 0; 336#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 337#L17-3 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;call main_#t~mem5 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem5;main_~i~0 := main_~i~0 - 1; 352#L17-5 [2018-11-28 23:41:24,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:24,879 INFO L82 PathProgramCache]: Analyzing trace with hash -272105412, now seen corresponding path program 1 times [2018-11-28 23:41:24,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:24,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:24,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:24,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:24,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:24,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:24,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:41:24,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:41:24,961 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:41:24,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:24,961 INFO L82 PathProgramCache]: Analyzing trace with hash 44790, now seen corresponding path program 2 times [2018-11-28 23:41:24,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:24,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:24,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:24,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:24,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:25,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:41:25,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:41:25,086 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-28 23:41:25,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:41:25,233 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2018-11-28 23:41:25,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:41:25,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2018-11-28 23:41:25,237 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-28 23:41:25,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 53 transitions. [2018-11-28 23:41:25,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-28 23:41:25,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-28 23:41:25,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 53 transitions. [2018-11-28 23:41:25,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:41:25,240 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 53 transitions. [2018-11-28 23:41:25,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 53 transitions. [2018-11-28 23:41:25,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2018-11-28 23:41:25,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-28 23:41:25,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2018-11-28 23:41:25,244 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-11-28 23:41:25,244 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-11-28 23:41:25,244 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:41:25,244 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 38 transitions. [2018-11-28 23:41:25,245 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-28 23:41:25,245 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:25,245 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:25,248 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:41:25,248 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:41:25,248 INFO L794 eck$LassoCheckResult]: Stem: 421#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 417#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.alloc(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 418#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 424#L17-5 main_#t~short4 := main_~i~0 >= 0; 413#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 414#L17-3 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 422#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 423#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 425#L14-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 419#L14-4 main_~k~0 := 1; 415#L23-3 [2018-11-28 23:41:25,248 INFO L796 eck$LassoCheckResult]: Loop: 415#L23-3 assume !!(main_~k~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem7 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * (main_~k~0 - 1), 4);call main_#t~mem8 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~k~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem7 <= main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 416#L4 assume !(0 == __VERIFIER_assert_~cond); 429#L4-2 havoc main_#t~mem8;havoc main_#t~mem7; 420#L23-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 415#L23-3 [2018-11-28 23:41:25,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:25,248 INFO L82 PathProgramCache]: Analyzing trace with hash 97408492, now seen corresponding path program 1 times [2018-11-28 23:41:25,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:25,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:25,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:25,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:25,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:25,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:25,274 INFO L82 PathProgramCache]: Analyzing trace with hash 2285066, now seen corresponding path program 2 times [2018-11-28 23:41:25,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:25,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:25,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:25,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:25,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:25,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:25,284 INFO L82 PathProgramCache]: Analyzing trace with hash 699287157, now seen corresponding path program 1 times [2018-11-28 23:41:25,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:25,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:25,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:25,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:25,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:25,433 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-11-28 23:41:25,668 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 77 [2018-11-28 23:41:25,892 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2018-11-28 23:41:25,894 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:41:25,894 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:41:25,894 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:41:25,894 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:41:25,895 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:41:25,895 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:41:25,895 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:41:25,895 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:41:25,895 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_true-unreach-call_true-termination.i_Iteration6_Lasso [2018-11-28 23:41:25,895 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:41:25,896 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:41:25,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:25,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:25,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:25,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:25,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:25,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:25,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:25,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:25,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:25,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:25,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:26,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:26,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:26,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:26,428 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2018-11-28 23:41:26,723 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:41:26,724 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:41:26,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:26,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:26,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:26,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:26,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:26,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:26,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:26,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:26,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:26,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:26,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:26,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:26,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:26,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:26,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:26,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:26,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:26,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:26,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:26,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:26,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:26,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:26,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:26,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:26,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:26,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:26,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:26,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:26,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:26,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:26,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:26,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:26,733 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:26,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:26,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:26,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:26,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:26,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:26,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:26,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:26,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:26,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:26,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:26,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:26,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:26,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:26,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:26,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:26,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:26,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:26,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:26,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:26,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:26,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:26,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:26,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:26,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:26,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:26,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:26,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:26,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:26,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:26,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:26,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:26,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:26,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:26,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:26,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:26,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:26,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:26,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:26,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:26,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:26,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:26,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:26,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:26,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:26,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:26,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:26,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:26,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:26,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:26,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:26,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:26,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:26,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:26,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:26,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:26,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:26,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:26,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:26,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:26,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:26,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:26,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:26,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:26,779 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:41:26,819 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-28 23:41:26,819 INFO L444 ModelExtractionUtils]: 13 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 23:41:26,819 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:41:26,820 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-28 23:41:26,822 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:41:26,822 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~#v~0.offset) = -4*ULTIMATE.start_main_~k~0 - 1*ULTIMATE.start_main_~#v~0.offset + 17179869178 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_3 + 17179869180 >= 0] [2018-11-28 23:41:26,984 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2018-11-28 23:41:27,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:27,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:27,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-11-28 23:41:27,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:41:27,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-28 23:41:27,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:41:27,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 23:41:27,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-11-28 23:41:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:27,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:27,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:27,782 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 23:41:27,782 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-11-28 23:41:27,901 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 33 states and 43 transitions. Complement of second has 5 states. [2018-11-28 23:41:27,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:41:27,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:41:27,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-28 23:41:27,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 23:41:27,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:27,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-28 23:41:27,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:27,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-28 23:41:27,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:27,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2018-11-28 23:41:27,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:41:27,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 24 states and 32 transitions. [2018-11-28 23:41:27,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 23:41:27,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 23:41:27,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2018-11-28 23:41:27,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:41:27,909 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-11-28 23:41:27,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2018-11-28 23:41:27,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-28 23:41:27,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-28 23:41:27,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2018-11-28 23:41:27,912 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-11-28 23:41:27,912 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-11-28 23:41:27,912 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:41:27,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2018-11-28 23:41:27,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:41:27,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:27,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:27,914 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2018-11-28 23:41:27,914 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:41:27,914 INFO L794 eck$LassoCheckResult]: Stem: 573#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 567#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.alloc(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 568#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 574#L17-5 main_#t~short4 := main_~i~0 >= 0; 588#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 584#L17-3 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 578#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 579#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 575#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 576#L17-5 main_#t~short4 := main_~i~0 >= 0; 569#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 570#L17-3 [2018-11-28 23:41:27,914 INFO L796 eck$LassoCheckResult]: Loop: 570#L17-3 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;call main_#t~mem5 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem5;main_~i~0 := main_~i~0 - 1; 580#L17-5 main_#t~short4 := main_~i~0 >= 0; 581#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 570#L17-3 [2018-11-28 23:41:27,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:27,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1275302755, now seen corresponding path program 2 times [2018-11-28 23:41:27,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:27,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:27,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:27,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:27,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:27,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:27,964 INFO L82 PathProgramCache]: Analyzing trace with hash 55260, now seen corresponding path program 3 times [2018-11-28 23:41:27,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:27,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:27,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:27,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:27,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:27,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:27,980 INFO L82 PathProgramCache]: Analyzing trace with hash 736351680, now seen corresponding path program 1 times [2018-11-28 23:41:27,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:27,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:27,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:27,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:27,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:28,709 WARN L180 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2018-11-28 23:41:29,104 WARN L180 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 93 [2018-11-28 23:41:29,620 WARN L180 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2018-11-28 23:41:29,622 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:41:29,622 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:41:29,623 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:41:29,623 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:41:29,623 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:41:29,623 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:41:29,623 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:41:29,624 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:41:29,624 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_true-unreach-call_true-termination.i_Iteration7_Lasso [2018-11-28 23:41:29,624 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:41:29,624 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:41:29,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:30,101 WARN L180 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-11-28 23:41:30,329 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2018-11-28 23:41:30,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:30,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:30,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:30,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:30,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:30,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:30,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:30,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:30,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:30,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:30,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:30,743 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-11-28 23:41:30,847 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2018-11-28 23:41:30,869 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:41:30,869 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:41:30,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:30,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:30,875 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:41:30,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:30,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:30,876 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:41:30,876 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:30,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:30,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:30,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:30,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:30,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:30,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:30,886 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:30,886 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:30,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:30,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:30,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:30,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:30,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:30,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:30,895 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:30,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:30,909 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:41:30,922 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-28 23:41:30,923 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 23:41:30,923 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:41:30,925 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:41:30,926 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:41:30,926 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-28 23:41:31,094 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-28 23:41:31,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:31,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:31,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:31,894 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-28 23:41:31,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:31,895 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:41:31,895 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-28 23:41:32,236 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 52 states and 69 transitions. Complement of second has 9 states. [2018-11-28 23:41:32,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:41:32,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:41:32,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-11-28 23:41:32,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-28 23:41:32,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:32,238 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:41:32,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:32,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:32,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:32,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:32,332 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:41:32,333 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-28 23:41:32,381 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 43 states and 54 transitions. Complement of second has 9 states. [2018-11-28 23:41:32,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:41:32,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:41:32,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-11-28 23:41:32,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-28 23:41:32,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:32,384 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:41:32,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:32,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:32,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:32,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:32,489 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:41:32,489 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-28 23:41:32,548 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 77 states and 107 transitions. Complement of second has 10 states. [2018-11-28 23:41:32,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:41:32,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:41:32,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-28 23:41:32,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-28 23:41:32,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:32,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-28 23:41:32,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:32,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-28 23:41:32,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:32,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 107 transitions. [2018-11-28 23:41:32,558 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:41:32,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 0 states and 0 transitions. [2018-11-28 23:41:32,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:41:32,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:41:32,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:41:32,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:41:32,559 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:41:32,559 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:41:32,559 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:41:32,559 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 23:41:32,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:41:32,559 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:41:32,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:41:32,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:41:32 BoogieIcfgContainer [2018-11-28 23:41:32,567 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:41:32,568 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:41:32,568 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:41:32,568 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:41:32,568 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:41:17" (3/4) ... [2018-11-28 23:41:32,572 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:41:32,572 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:41:32,573 INFO L168 Benchmark]: Toolchain (without parser) took 16035.71 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 233.3 MB). Free memory was 948.7 MB in the beginning and 1.0 GB in the end (delta: -91.6 MB). Peak memory consumption was 141.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:41:32,574 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:41:32,574 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.93 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:41:32,575 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.97 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:41:32,576 INFO L168 Benchmark]: Boogie Preprocessor took 26.05 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:41:32,577 INFO L168 Benchmark]: RCFGBuilder took 556.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 64.0 MB). Free memory was 932.6 MB in the beginning and 1.0 GB in the end (delta: -105.0 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:41:32,578 INFO L168 Benchmark]: BuchiAutomizer took 15042.30 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 169.3 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -2.7 MB). Peak memory consumption was 166.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:41:32,579 INFO L168 Benchmark]: Witness Printer took 4.51 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:41:32,583 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 359.93 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.97 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.05 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 556.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 64.0 MB). Free memory was 932.6 MB in the beginning and 1.0 GB in the end (delta: -105.0 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15042.30 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 169.3 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -2.7 MB). Peak memory consumption was 166.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.51 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 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 7 terminating modules (3 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[v] + -1 * v + -4 * j and consists of 4 locations. One deterministic module has affine ranking function 2 * i + 1 and consists of 5 locations. One deterministic module has affine ranking function -4 * k + -1 * v + 17179869178 and consists of 4 locations. One nondeterministic module has affine ranking function i and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.9s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 11.3s. Construction of modules took 0.4s. Büchi inclusion checks took 3.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 38 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 112 SDtfs, 158 SDslu, 84 SDs, 0 SdLazy, 162 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital221 mio100 ax100 hnf99 lsp85 ukn78 mio100 lsp67 div196 bol100 ite100 ukn100 eq149 hnf60 smp89 dnf152 smp78 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 191ms VariablesStem: 6 VariablesLoop: 10 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...