./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/loops/insertion_sort_false-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_false-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 9722a10940ebd7a5d75170225a40cd37454d0528 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:14,840 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:41:14,842 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:41:14,855 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:41:14,855 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:41:14,856 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:41:14,857 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:41:14,859 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:41:14,861 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:41:14,861 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:41:14,862 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:41:14,863 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:41:14,864 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:41:14,865 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:41:14,866 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:41:14,867 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:41:14,868 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:41:14,869 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:41:14,871 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:41:14,873 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:41:14,874 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:41:14,876 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:41:14,878 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:41:14,879 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:41:14,879 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:41:14,880 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:41:14,881 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:41:14,882 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:41:14,883 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:41:14,884 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:41:14,884 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:41:14,885 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:41:14,885 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:41:14,885 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:41:14,886 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:41:14,887 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:41:14,887 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:14,909 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:41:14,909 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:41:14,913 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:41:14,914 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:41:14,914 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:41:14,914 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:41:14,914 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:41:14,914 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:41:14,915 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:41:14,915 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:41:14,915 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:41:14,915 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:41:14,915 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:41:14,915 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:41:14,918 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:41:14,918 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:41:14,918 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:41:14,918 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:41:14,918 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:41:14,918 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:41:14,920 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:41:14,920 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:41:14,920 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:41:14,920 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:41:14,921 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:41:14,922 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:41:14,922 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:41:14,922 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:41:14,922 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:41:14,922 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:41:14,922 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:41:14,923 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:41:14,925 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 -> 9722a10940ebd7a5d75170225a40cd37454d0528 [2018-11-28 23:41:14,983 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:41:15,001 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:41:15,006 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:41:15,008 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:41:15,008 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:41:15,009 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/insertion_sort_false-unreach-call_true-termination.i [2018-11-28 23:41:15,072 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/603f291e4/a94e0c294f5e4acd8a58d7abde9bbaff/FLAG053a4c86b [2018-11-28 23:41:15,557 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:41:15,558 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/insertion_sort_false-unreach-call_true-termination.i [2018-11-28 23:41:15,565 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/603f291e4/a94e0c294f5e4acd8a58d7abde9bbaff/FLAG053a4c86b [2018-11-28 23:41:15,902 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/603f291e4/a94e0c294f5e4acd8a58d7abde9bbaff [2018-11-28 23:41:15,906 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:41:15,908 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:41:15,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:41:15,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:41:15,913 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:41:15,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:41:15" (1/1) ... [2018-11-28 23:41:15,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ac9139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:15, skipping insertion in model container [2018-11-28 23:41:15,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:41:15" (1/1) ... [2018-11-28 23:41:15,927 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:41:15,950 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:41:16,153 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:41:16,159 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:41:16,185 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:41:16,205 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:41:16,205 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,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:41:16,206 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:41:16,206 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:41:16,206 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:41:16,215 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,225 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,248 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:41:16,249 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:41:16,249 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:41:16,249 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:41:16,257 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,257 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,260 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,260 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,267 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,273 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,275 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,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:41:16,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:41:16,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:41:16,278 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:41:16,279 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:16,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:41:16,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:41:16,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:41:16,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:41:16,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:41:16,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:41:16,793 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:41:16,793 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-28 23:41:16,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:41:16 BoogieIcfgContainer [2018-11-28 23:41:16,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:41:16,795 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:41:16,795 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:41:16,799 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:41:16,800 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:41:16,800 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:41:15" (1/3) ... [2018-11-28 23:41:16,801 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@384aed21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:41:16, skipping insertion in model container [2018-11-28 23:41:16,802 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:41:16,802 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:16,802 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@384aed21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:41:16, skipping insertion in model container [2018-11-28 23:41:16,802 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:41:16,803 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:41:16" (3/3) ... [2018-11-28 23:41:16,805 INFO L375 chiAutomizerObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2018-11-28 23:41:16,877 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:41:16,878 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:41:16,878 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:41:16,878 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:41:16,878 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:41:16,878 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:41:16,878 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:41:16,880 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:41:16,880 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:41:16,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-28 23:41:16,921 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-28 23:41:16,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:16,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:16,928 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:41:16,928 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:41:16,928 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:41:16,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-28 23:41:16,930 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-28 23:41:16,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:16,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:16,931 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:41:16,931 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:41:16,939 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#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; 13#L14-3true [2018-11-28 23:41:16,939 INFO L796 eck$LassoCheckResult]: Loop: 13#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; 16#L17-5true assume !true; 14#L17-6true call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 17#L14-2true main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 13#L14-3true [2018-11-28 23:41:16,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:16,945 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 23:41:16,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:16,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:17,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:17,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:17,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:17,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:17,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1256252, now seen corresponding path program 1 times [2018-11-28 23:41:17,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:17,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:17,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:17,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:17,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:17,125 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,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:41:17,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:41:17,131 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:41:17,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 23:41:17,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 23:41:17,150 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-28 23:41:17,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:41:17,158 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-11-28 23:41:17,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:41:17,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2018-11-28 23:41:17,163 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-28 23:41:17,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 19 transitions. [2018-11-28 23:41:17,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-28 23:41:17,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 23:41:17,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-11-28 23:41:17,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:41:17,170 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 23:41:17,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-11-28 23:41:17,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-28 23:41:17,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 23:41:17,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-11-28 23:41:17,201 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 23:41:17,201 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 23:41:17,201 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:41:17,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-11-28 23:41:17,202 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-28 23:41:17,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:17,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:17,203 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:41:17,203 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:41:17,204 INFO L794 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 53#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; 54#L14-3 [2018-11-28 23:41:17,204 INFO L796 eck$LassoCheckResult]: Loop: 54#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; 51#L17-5 main_#t~short4 := main_~i~0 >= 0; 48#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; 49#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 59#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 60#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 54#L14-3 [2018-11-28 23:41:17,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:17,204 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-28 23:41:17,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:17,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:17,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:17,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:17,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:17,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:17,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1188208494, now seen corresponding path program 1 times [2018-11-28 23:41:17,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:17,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:17,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:17,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:17,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:17,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:17,302 INFO L82 PathProgramCache]: Analyzing trace with hash 268257712, now seen corresponding path program 1 times [2018-11-28 23:41:17,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:17,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:17,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:17,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:17,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:17,907 WARN L180 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2018-11-28 23:41:18,184 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-28 23:41:18,379 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-28 23:41:18,405 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:41:18,406 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:41:18,406 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:41:18,407 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:41:18,407 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:41:18,407 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:41:18,407 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:41:18,407 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:41:18,408 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_false-unreach-call_true-termination.i_Iteration2_Lasso [2018-11-28 23:41:18,408 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:41:18,409 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:41:18,438 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:18,453 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:18,468 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:18,472 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:18,476 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:18,500 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:18,508 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:18,528 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:18,556 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:18,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:18,570 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,175 WARN L180 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2018-11-28 23:41:19,176 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,202 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,240 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,480 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-11-28 23:41:19,596 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-11-28 23:41:20,090 WARN L180 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-11-28 23:41:20,175 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:41:20,185 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:41:20,187 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:20,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:20,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:20,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:20,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:20,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:20,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:20,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:20,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:20,203 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:20,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:20,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:20,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:20,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:20,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:20,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:20,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:20,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:20,211 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:20,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:20,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:20,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:20,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:20,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:20,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:20,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:20,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:20,224 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:20,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:20,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:20,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:20,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:20,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:20,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:20,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:20,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:20,234 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:20,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:20,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:20,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:20,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:20,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:20,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:20,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:20,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:20,243 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:20,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:20,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:20,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:20,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:20,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:20,248 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:20,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:20,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:20,251 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:20,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:20,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:20,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:20,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:20,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:20,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:20,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:20,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:20,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:20,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:20,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:20,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:20,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:20,259 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:20,259 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:20,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:20,264 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:20,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:20,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:20,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:20,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:20,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:20,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:20,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:20,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:20,268 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:20,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:20,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:20,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:20,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:20,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:20,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:20,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:20,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:20,271 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:20,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:20,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:20,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:20,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:20,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:20,273 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:20,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:20,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:20,275 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:20,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:20,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:20,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:20,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:20,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:20,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:20,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:20,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:20,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:20,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:20,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:20,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:20,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:20,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:20,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:20,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:20,302 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:20,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:20,305 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:41:20,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:20,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:20,325 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:41:20,326 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:20,409 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:41:20,492 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:41:20,492 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 23:41:20,495 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:41:20,498 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:41:20,500 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:41:20,501 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:20,564 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-28 23:41:20,584 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:41:20,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:20,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:20,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:20,931 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:20,935 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:20,936 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 23:41:21,133 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 29 states and 40 transitions. Complement of second has 6 states. [2018-11-28 23:41:21,134 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,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:41:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-28 23:41:21,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-28 23:41:21,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:21,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-28 23:41:21,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:21,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 2 letters. Loop has 12 letters. [2018-11-28 23:41:21,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:21,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 40 transitions. [2018-11-28 23:41:21,146 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 23:41:21,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 22 states and 31 transitions. [2018-11-28 23:41:21,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 23:41:21,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 23:41:21,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2018-11-28 23:41:21,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:41:21,149 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-11-28 23:41:21,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2018-11-28 23:41:21,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-28 23:41:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 23:41:21,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2018-11-28 23:41:21,154 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-11-28 23:41:21,154 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-11-28 23:41:21,154 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:41:21,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2018-11-28 23:41:21,156 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 23:41:21,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:21,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:21,156 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:41:21,156 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:41:21,158 INFO L794 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 157#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; 158#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; 152#L17-5 [2018-11-28 23:41:21,159 INFO L796 eck$LassoCheckResult]: Loop: 152#L17-5 main_#t~short4 := main_~i~0 >= 0; 147#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; 148#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 155#L18 assume main_~i~0 < 2;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; 151#L18-2 main_~i~0 := main_~i~0 - 1; 152#L17-5 [2018-11-28 23:41:21,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:21,160 INFO L82 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2018-11-28 23:41:21,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:21,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:21,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:21,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:21,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:21,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:21,197 INFO L82 PathProgramCache]: Analyzing trace with hash 43044122, now seen corresponding path program 1 times [2018-11-28 23:41:21,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:21,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:21,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:21,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:21,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:21,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:21,223 INFO L82 PathProgramCache]: Analyzing trace with hash 268259380, now seen corresponding path program 1 times [2018-11-28 23:41:21,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:21,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:21,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:21,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:21,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:21,558 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2018-11-28 23:41:21,726 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2018-11-28 23:41:21,843 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2018-11-28 23:41:21,854 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:41:21,854 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:41:21,854 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:41:21,854 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:41:21,854 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:41:21,854 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:41:21,855 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:41:21,855 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:41:21,855 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_false-unreach-call_true-termination.i_Iteration3_Lasso [2018-11-28 23:41:21,855 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:41:21,855 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:41:21,861 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:21,865 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:21,868 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:21,874 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:21,876 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:21,879 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,090 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-11-28 23:41:22,267 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2018-11-28 23:41:22,268 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,270 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,271 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,273 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,275 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,278 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,287 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,289 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,570 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:41:22,570 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:41:22,571 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:22,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:22,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:22,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:22,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:22,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:22,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:22,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:22,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:22,578 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:22,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:22,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:22,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:22,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:22,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:22,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:22,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:22,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:22,587 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:22,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:22,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:22,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:22,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:22,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:22,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:22,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:22,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:22,594 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:22,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:22,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:22,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:22,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:22,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:22,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:22,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:22,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:22,602 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:22,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:22,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:22,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:22,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:22,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:22,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:22,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:22,617 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:22,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:22,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:22,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:22,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:22,622 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:22,623 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:22,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:22,634 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:22,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:22,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:22,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:22,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:22,640 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:22,646 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:22,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:22,659 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:22,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:22,661 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:41:22,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:22,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:22,664 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:41:22,665 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:22,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:22,673 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:22,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:22,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:22,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:22,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:22,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:22,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:22,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:22,686 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:22,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:22,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:22,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:22,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:22,693 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:22,693 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:22,710 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:41:22,722 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:41:22,722 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:41:22,722 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:41:22,724 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-28 23:41:22,725 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:41:22,725 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~j~0 Supporting invariants [1*ULTIMATE.start_main_~j~0 - 1 >= 0] [2018-11-28 23:41:22,781 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:41:22,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:22,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:22,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:23,106 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,108 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-28 23:41:23,108 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-28 23:41:23,238 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 57 states and 77 transitions. Complement of second has 10 states. [2018-11-28 23:41:23,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:41:23,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:41:23,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-28 23:41:23,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 3 letters. Loop has 5 letters. [2018-11-28 23:41:23,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:23,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-28 23:41:23,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:23,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 3 letters. Loop has 10 letters. [2018-11-28 23:41:23,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:23,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 77 transitions. [2018-11-28 23:41:23,246 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-28 23:41:23,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 39 states and 51 transitions. [2018-11-28 23:41:23,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-28 23:41:23,249 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-28 23:41:23,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions. [2018-11-28 23:41:23,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:41:23,250 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2018-11-28 23:41:23,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions. [2018-11-28 23:41:23,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2018-11-28 23:41:23,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 23:41:23,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-11-28 23:41:23,254 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-11-28 23:41:23,255 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-11-28 23:41:23,256 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:41:23,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 40 transitions. [2018-11-28 23:41:23,257 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 23:41:23,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:23,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:23,257 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:41:23,257 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:41:23,257 INFO L794 eck$LassoCheckResult]: Stem: 311#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 306#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; 307#L14-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 308#L14-4 main_~k~0 := 1; 309#L24-3 [2018-11-28 23:41:23,259 INFO L796 eck$LassoCheckResult]: Loop: 309#L24-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; 310#L4 assume !(0 == __VERIFIER_assert_~cond); 318#L4-2 havoc main_#t~mem8;havoc main_#t~mem7; 316#L24-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 309#L24-3 [2018-11-28 23:41:23,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:23,259 INFO L82 PathProgramCache]: Analyzing trace with hash 925734, now seen corresponding path program 1 times [2018-11-28 23:41:23,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:23,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:23,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:23,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:23,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:23,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:23,276 INFO L82 PathProgramCache]: Analyzing trace with hash 2500554, now seen corresponding path program 1 times [2018-11-28 23:41:23,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:23,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:23,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:23,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:23,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:23,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:23,291 INFO L82 PathProgramCache]: Analyzing trace with hash 237874543, now seen corresponding path program 1 times [2018-11-28 23:41:23,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:23,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:23,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:23,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:23,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:23,744 WARN L180 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 34 [2018-11-28 23:41:24,001 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2018-11-28 23:41:24,024 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,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:41:24,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:41:24,154 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-11-28 23:41:24,276 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2018-11-28 23:41:24,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:41:24,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:41:24,277 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-11-28 23:41:24,520 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-11-28 23:41:24,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:41:24,590 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2018-11-28 23:41:24,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:41:24,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 43 transitions. [2018-11-28 23:41:24,594 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 23:41:24,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 30 states and 41 transitions. [2018-11-28 23:41:24,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 23:41:24,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 23:41:24,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 41 transitions. [2018-11-28 23:41:24,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:41:24,596 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2018-11-28 23:41:24,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 41 transitions. [2018-11-28 23:41:24,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-28 23:41:24,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 23:41:24,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2018-11-28 23:41:24,600 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2018-11-28 23:41:24,600 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2018-11-28 23:41:24,609 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:41:24,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2018-11-28 23:41:24,610 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 23:41:24,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:24,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:24,613 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:41:24,613 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:41:24,613 INFO L794 eck$LassoCheckResult]: Stem: 385#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 380#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; 381#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; 386#L17-5 main_#t~short4 := main_~i~0 >= 0; 372#L17-1 assume !main_#t~short4; 373#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 388#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 389#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 387#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; 375#L17-5 [2018-11-28 23:41:24,613 INFO L796 eck$LassoCheckResult]: Loop: 375#L17-5 main_#t~short4 := main_~i~0 >= 0; 370#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; 371#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 378#L18 assume main_~i~0 < 2;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; 374#L18-2 main_~i~0 := main_~i~0 - 1; 375#L17-5 [2018-11-28 23:41:24,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:24,613 INFO L82 PathProgramCache]: Analyzing trace with hash -272098468, now seen corresponding path program 1 times [2018-11-28 23:41:24,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:24,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:24,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:24,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:24,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:24,681 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,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:41:24,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:41:24,682 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:41:24,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:24,682 INFO L82 PathProgramCache]: Analyzing trace with hash 43044122, now seen corresponding path program 2 times [2018-11-28 23:41:24,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:24,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:24,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:24,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:24,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:25,421 WARN L180 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2018-11-28 23:41:25,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:41:25,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:41:25,451 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-11-28 23:41:25,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:41:25,564 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2018-11-28 23:41:25,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:41:25,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 71 transitions. [2018-11-28 23:41:25,567 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-28 23:41:25,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 71 transitions. [2018-11-28 23:41:25,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-28 23:41:25,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-28 23:41:25,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 71 transitions. [2018-11-28 23:41:25,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:41:25,570 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2018-11-28 23:41:25,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 71 transitions. [2018-11-28 23:41:25,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2018-11-28 23:41:25,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-28 23:41:25,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2018-11-28 23:41:25,574 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2018-11-28 23:41:25,574 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2018-11-28 23:41:25,574 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:41:25,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 47 transitions. [2018-11-28 23:41:25,576 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 23:41:25,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:25,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:25,577 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:41:25,577 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:41:25,577 INFO L794 eck$LassoCheckResult]: Stem: 478#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 473#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; 474#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; 479#L17-5 main_#t~short4 := main_~i~0 >= 0; 494#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; 491#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 483#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 484#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 480#L14-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 475#L14-4 main_~k~0 := 1; 476#L24-3 [2018-11-28 23:41:25,578 INFO L796 eck$LassoCheckResult]: Loop: 476#L24-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; 477#L4 assume !(0 == __VERIFIER_assert_~cond); 487#L4-2 havoc main_#t~mem8;havoc main_#t~mem7; 485#L24-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 476#L24-3 [2018-11-28 23:41:25,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:25,579 INFO L82 PathProgramCache]: Analyzing trace with hash 97623763, now seen corresponding path program 1 times [2018-11-28 23:41:25,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:25,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:25,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:25,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:25,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:25,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:25,603 INFO L82 PathProgramCache]: Analyzing trace with hash 2500554, now seen corresponding path program 2 times [2018-11-28 23:41:25,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:25,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:25,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:25,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:25,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:25,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:25,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1938296220, now seen corresponding path program 1 times [2018-11-28 23:41:25,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:25,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:25,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:25,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:25,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:26,068 WARN L180 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-11-28 23:41:26,343 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 75 [2018-11-28 23:41:26,581 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2018-11-28 23:41:26,583 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:41:26,583 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:41:26,583 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:41:26,584 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:41:26,584 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:41:26,584 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:41:26,584 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:41:26,584 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:41:26,584 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_false-unreach-call_true-termination.i_Iteration6_Lasso [2018-11-28 23:41:26,584 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:41:26,584 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:41:26,590 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,635 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,646 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,647 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,653 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,655 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,656 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,659 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,668 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,669 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,910 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,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:26,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:26,926 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:27,359 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:41:27,359 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:41:27,360 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:27,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:27,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:27,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:27,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:27,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:27,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:27,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:27,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:27,366 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:27,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:27,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:27,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:27,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:27,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:27,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:27,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:27,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:27,372 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:27,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:27,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:27,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:27,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:27,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:27,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:27,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:27,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:27,378 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:27,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:27,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:27,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:27,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:27,382 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:27,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:27,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:27,385 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:27,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:27,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:27,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:27,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:27,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:27,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:27,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:27,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:27,391 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:27,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:27,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:27,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:27,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:27,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:27,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:27,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:27,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:27,398 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:27,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:27,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:27,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:27,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:27,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:27,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:27,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:27,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:27,404 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:27,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:27,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:27,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:27,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:27,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:27,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:27,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:27,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:27,410 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:27,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:27,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:27,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:27,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:27,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:27,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:27,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:27,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:27,415 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:27,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:27,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:27,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:27,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:27,423 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:27,423 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:27,445 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:41:27,475 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:41:27,475 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 23:41:27,475 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:41:27,477 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:41:27,477 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:41:27,477 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, v_rep(select #length ULTIMATE.start_main_~#v~0.base)_3, ULTIMATE.start_main_~#v~0.offset) = -4*ULTIMATE.start_main_~k~0 + 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_3 - 1*ULTIMATE.start_main_~#v~0.offset Supporting invariants [] [2018-11-28 23:41:27,626 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-28 23:41:27,641 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:41:27,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:27,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:27,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:27,704 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,705 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:27,705 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 47 transitions. cyclomatic complexity: 16 Second operand 3 states. [2018-11-28 23:41:27,719 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 47 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 39 states and 52 transitions. Complement of second has 4 states. [2018-11-28 23:41:27,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:41:27,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:41:27,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-28 23:41:27,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 23:41:27,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:27,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-28 23:41:27,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:27,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-28 23:41:27,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:27,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 52 transitions. [2018-11-28 23:41:27,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:41:27,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 30 states and 41 transitions. [2018-11-28 23:41:27,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:41:27,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:41:27,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 41 transitions. [2018-11-28 23:41:27,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:41:27,726 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2018-11-28 23:41:27,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 41 transitions. [2018-11-28 23:41:27,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-28 23:41:27,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 23:41:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2018-11-28 23:41:27,729 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2018-11-28 23:41:27,729 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2018-11-28 23:41:27,729 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:41:27,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 41 transitions. [2018-11-28 23:41:27,730 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:41:27,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:27,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:27,731 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2018-11-28 23:41:27,731 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:41:27,731 INFO L794 eck$LassoCheckResult]: Stem: 629#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 619#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; 620#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; 632#L17-5 main_#t~short4 := main_~i~0 >= 0; 644#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; 640#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 630#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 631#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 633#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; 634#L17-5 main_#t~short4 := main_~i~0 >= 0; 621#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; 622#L17-3 [2018-11-28 23:41:27,731 INFO L796 eck$LassoCheckResult]: Loop: 622#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 637#L18 assume main_~i~0 < 2;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; 625#L18-2 main_~i~0 := main_~i~0 - 1; 626#L17-5 main_#t~short4 := main_~i~0 >= 0; 639#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; 622#L17-3 [2018-11-28 23:41:27,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:27,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1268629571, now seen corresponding path program 2 times [2018-11-28 23:41:27,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:27,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:27,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:27,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:27,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:27,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:27,758 INFO L82 PathProgramCache]: Analyzing trace with hash 53536832, now seen corresponding path program 3 times [2018-11-28 23:41:27,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:27,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:27,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:27,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:27,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:27,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:27,777 INFO L82 PathProgramCache]: Analyzing trace with hash 2116886020, now seen corresponding path program 1 times [2018-11-28 23:41:27,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:27,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:27,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:27,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:27,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:28,102 WARN L180 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2018-11-28 23:41:28,501 WARN L180 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 93 [2018-11-28 23:41:28,830 WARN L180 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2018-11-28 23:41:28,833 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:41:28,833 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:41:28,833 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:41:28,834 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:41:28,834 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:41:28,834 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:41:28,834 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:41:28,834 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:41:28,835 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_false-unreach-call_true-termination.i_Iteration7_Lasso [2018-11-28 23:41:28,835 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:41:28,835 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:41:28,840 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:28,842 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:28,846 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:28,848 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:28,851 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:28,853 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:29,242 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2018-11-28 23:41:29,581 WARN L180 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2018-11-28 23:41:29,582 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:29,585 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:29,588 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:29,593 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:29,596 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:29,602 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,174 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-11-28 23:41:30,394 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2018-11-28 23:41:30,669 WARN L180 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-11-28 23:41:30,680 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:41:30,680 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:41:30,681 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,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:30,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:30,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:30,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:30,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:30,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:30,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:30,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:30,686 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,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:30,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:30,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:30,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:30,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:30,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:30,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:30,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:30,697 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,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:30,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:30,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:30,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:30,699 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:30,701 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:30,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:30,703 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,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:30,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:30,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:30,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:30,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:30,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:30,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:30,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:30,713 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,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:30,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:30,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:30,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:30,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:30,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:30,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:30,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:30,718 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,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:30,719 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:41:30,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:30,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:30,722 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:41:30,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:30,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:30,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:30,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:30,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:30,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:30,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:30,730 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:30,730 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:30,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:30,736 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,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:30,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:30,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:30,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:30,742 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:30,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:30,753 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:41:30,759 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:41:30,759 INFO L444 ModelExtractionUtils]: 16 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:41:30,759 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:41:30,762 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:41:30,762 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:41:30,762 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:30,966 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2018-11-28 23:41:31,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:31,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:31,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:31,188 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,188 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,188 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-11-28 23:41:31,252 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 52 states and 69 transitions. Complement of second has 9 states. [2018-11-28 23:41:31,253 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:31,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:41:31,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-11-28 23:41:31,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 11 letters. Loop has 5 letters. [2018-11-28 23:41:31,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:31,255 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:41:31,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:31,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:31,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:31,312 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,312 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:31,312 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-11-28 23:41:31,372 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 55 states and 72 transitions. Complement of second has 9 states. [2018-11-28 23:41:31,373 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:31,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:41:31,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-11-28 23:41:31,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 11 letters. Loop has 5 letters. [2018-11-28 23:41:31,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:31,374 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:41:31,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:31,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:31,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:31,433 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,433 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:31,433 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-11-28 23:41:31,542 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 65 states and 93 transitions. Complement of second has 8 states. [2018-11-28 23:41:31,545 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:31,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:41:31,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2018-11-28 23:41:31,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 11 letters. Loop has 5 letters. [2018-11-28 23:41:31,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:31,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 16 letters. Loop has 5 letters. [2018-11-28 23:41:31,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:31,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 11 letters. Loop has 10 letters. [2018-11-28 23:41:31,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:31,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 93 transitions. [2018-11-28 23:41:31,551 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:41:31,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 0 states and 0 transitions. [2018-11-28 23:41:31,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:41:31,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:41:31,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:41:31,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:41:31,553 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:41:31,553 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:41:31,553 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:41:31,553 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 23:41:31,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:41:31,553 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:41:31,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:41:31,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:41:31 BoogieIcfgContainer [2018-11-28 23:41:31,562 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:41:31,562 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:41:31,562 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:41:31,563 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:41:31,563 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:16" (3/4) ... [2018-11-28 23:41:31,567 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:41:31,567 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:41:31,568 INFO L168 Benchmark]: Toolchain (without parser) took 15661.23 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 296.2 MB). Free memory was 951.4 MB in the beginning and 912.8 MB in the end (delta: 38.5 MB). Peak memory consumption was 334.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:41:31,570 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:41:31,571 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.40 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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:31,572 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.37 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:41:31,573 INFO L168 Benchmark]: Boogie Preprocessor took 28.68 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 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:31,574 INFO L168 Benchmark]: RCFGBuilder took 516.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -151.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:41:31,576 INFO L168 Benchmark]: BuchiAutomizer took 14767.29 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 912.8 MB in the end (delta: 173.9 MB). Peak memory consumption was 357.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:41:31,577 INFO L168 Benchmark]: Witness Printer took 4.98 ms. Allocated memory is still 1.3 GB. Free memory is still 912.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:41:31,582 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 296.40 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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 42.37 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.68 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 516.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -151.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14767.29 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 912.8 MB in the end (delta: 173.9 MB). Peak memory consumption was 357.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.98 ms. Allocated memory is still 1.3 GB. Free memory is still 912.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (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 + j and consists of 6 locations. One deterministic module has affine ranking function -4 * k + unknown-#length-unknown[v] + -1 * v and consists of 3 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.7s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 12.3s. Construction of modules took 0.5s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 32 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 126 SDtfs, 173 SDslu, 86 SDs, 0 SdLazy, 201 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital223 mio100 ax100 hnf99 lsp85 ukn82 mio100 lsp68 div189 bol100 ite100 ukn100 eq148 hnf64 smp87 dnf183 smp78 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 198ms 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...