./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_31a2eab9-bbc5-4529-8455-a5bdc84c3646/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_31a2eab9-bbc5-4529-8455-a5bdc84c3646/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_31a2eab9-bbc5-4529-8455-a5bdc84c3646/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_31a2eab9-bbc5-4529-8455-a5bdc84c3646/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_31a2eab9-bbc5-4529-8455-a5bdc84c3646/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_31a2eab9-bbc5-4529-8455-a5bdc84c3646/bin-2019/uautomizer --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.23-635dfa2 [2018-12-02 20:42:14,900 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 20:42:14,901 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 20:42:14,909 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 20:42:14,909 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 20:42:14,910 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 20:42:14,911 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 20:42:14,912 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 20:42:14,912 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 20:42:14,913 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 20:42:14,913 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 20:42:14,913 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 20:42:14,914 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 20:42:14,914 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 20:42:14,915 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 20:42:14,915 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 20:42:14,916 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 20:42:14,917 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 20:42:14,919 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 20:42:14,920 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 20:42:14,920 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 20:42:14,921 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 20:42:14,923 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 20:42:14,923 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 20:42:14,923 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 20:42:14,924 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 20:42:14,925 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 20:42:14,925 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 20:42:14,926 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 20:42:14,927 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 20:42:14,927 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 20:42:14,927 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 20:42:14,927 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 20:42:14,927 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 20:42:14,928 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 20:42:14,928 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 20:42:14,929 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_31a2eab9-bbc5-4529-8455-a5bdc84c3646/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 20:42:14,936 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 20:42:14,936 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 20:42:14,937 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 20:42:14,937 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 20:42:14,937 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 20:42:14,937 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 20:42:14,937 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 20:42:14,937 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 20:42:14,938 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 20:42:14,938 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 20:42:14,938 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 20:42:14,938 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 20:42:14,938 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 20:42:14,938 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 20:42:14,938 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 20:42:14,938 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 20:42:14,938 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 20:42:14,939 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 20:42:14,939 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 20:42:14,939 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 20:42:14,939 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 20:42:14,939 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 20:42:14,939 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 20:42:14,939 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 20:42:14,939 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 20:42:14,940 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 20:42:14,940 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 20:42:14,940 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 20:42:14,940 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 20:42:14,940 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 20:42:14,940 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 20:42:14,941 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 20:42:14,941 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_31a2eab9-bbc5-4529-8455-a5bdc84c3646/bin-2019/uautomizer 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-12-02 20:42:14,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 20:42:14,970 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 20:42:14,973 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 20:42:14,974 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 20:42:14,974 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 20:42:14,975 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_31a2eab9-bbc5-4529-8455-a5bdc84c3646/bin-2019/uautomizer/../../sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i [2018-12-02 20:42:15,021 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_31a2eab9-bbc5-4529-8455-a5bdc84c3646/bin-2019/uautomizer/data/5d3f84baa/f5cb018ba1e846aea72b06ce9c06a131/FLAG32b41cb93 [2018-12-02 20:42:15,341 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 20:42:15,341 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_31a2eab9-bbc5-4529-8455-a5bdc84c3646/sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i [2018-12-02 20:42:15,344 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_31a2eab9-bbc5-4529-8455-a5bdc84c3646/bin-2019/uautomizer/data/5d3f84baa/f5cb018ba1e846aea72b06ce9c06a131/FLAG32b41cb93 [2018-12-02 20:42:15,783 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_31a2eab9-bbc5-4529-8455-a5bdc84c3646/bin-2019/uautomizer/data/5d3f84baa/f5cb018ba1e846aea72b06ce9c06a131 [2018-12-02 20:42:15,785 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 20:42:15,786 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 20:42:15,786 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 20:42:15,786 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 20:42:15,788 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 20:42:15,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:42:15" (1/1) ... [2018-12-02 20:42:15,790 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@211fd2b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:15, skipping insertion in model container [2018-12-02 20:42:15,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:42:15" (1/1) ... [2018-12-02 20:42:15,795 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 20:42:15,803 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 20:42:15,890 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:42:15,892 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 20:42:15,904 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:42:15,919 INFO L195 MainTranslator]: Completed translation [2018-12-02 20:42:15,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:15 WrapperNode [2018-12-02 20:42:15,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 20:42:15,920 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 20:42:15,920 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 20:42:15,920 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 20:42:15,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:15" (1/1) ... [2018-12-02 20:42:15,929 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:15" (1/1) ... [2018-12-02 20:42:15,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 20:42:15,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 20:42:15,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 20:42:15,942 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 20:42:15,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:15" (1/1) ... [2018-12-02 20:42:15,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:15" (1/1) ... [2018-12-02 20:42:15,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:15" (1/1) ... [2018-12-02 20:42:15,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:15" (1/1) ... [2018-12-02 20:42:15,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:15" (1/1) ... [2018-12-02 20:42:15,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:15" (1/1) ... [2018-12-02 20:42:15,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:15" (1/1) ... [2018-12-02 20:42:15,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 20:42:15,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 20:42:15,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 20:42:15,988 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 20:42:15,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_31a2eab9-bbc5-4529-8455-a5bdc84c3646/bin-2019/uautomizer/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-12-02 20:42:16,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 20:42:16,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 20:42:16,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 20:42:16,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 20:42:16,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 20:42:16,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 20:42:16,148 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 20:42:16,148 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-12-02 20:42:16,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:42:16 BoogieIcfgContainer [2018-12-02 20:42:16,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 20:42:16,149 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 20:42:16,149 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 20:42:16,152 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 20:42:16,152 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 20:42:16,152 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 08:42:15" (1/3) ... [2018-12-02 20:42:16,153 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4438402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 08:42:16, skipping insertion in model container [2018-12-02 20:42:16,153 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 20:42:16,153 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:15" (2/3) ... [2018-12-02 20:42:16,153 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4438402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 08:42:16, skipping insertion in model container [2018-12-02 20:42:16,153 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 20:42:16,153 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:42:16" (3/3) ... [2018-12-02 20:42:16,154 INFO L375 chiAutomizerObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2018-12-02 20:42:16,187 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 20:42:16,188 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 20:42:16,188 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 20:42:16,188 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 20:42:16,188 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 20:42:16,188 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 20:42:16,188 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 20:42:16,188 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 20:42:16,188 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 20:42:16,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-12-02 20:42:16,211 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-12-02 20:42:16,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 20:42:16,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 20:42:16,215 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 20:42:16,215 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 20:42:16,215 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 20:42:16,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-12-02 20:42:16,216 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-12-02 20:42:16,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 20:42:16,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 20:42:16,216 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 20:42:16,216 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 20:42:16,221 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-12-02 20:42:16,221 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-12-02 20:42:16,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:42:16,224 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-02 20:42:16,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:42:16,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:42:16,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:16,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:42:16,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:16,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:42:16,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1256252, now seen corresponding path program 1 times [2018-12-02 20:42:16,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:42:16,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:42:16,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:16,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:42:16,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:16,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:42:16,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:42:16,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:42:16,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 20:42:16,318 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 20:42:16,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 20:42:16,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 20:42:16,328 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-12-02 20:42:16,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:42:16,332 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-12-02 20:42:16,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 20:42:16,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2018-12-02 20:42:16,334 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-12-02 20:42:16,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 19 transitions. [2018-12-02 20:42:16,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-12-02 20:42:16,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-12-02 20:42:16,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-12-02 20:42:16,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 20:42:16,338 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-02 20:42:16,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-12-02 20:42:16,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-02 20:42:16,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-02 20:42:16,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-12-02 20:42:16,354 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-02 20:42:16,354 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-02 20:42:16,354 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 20:42:16,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-12-02 20:42:16,354 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-12-02 20:42:16,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 20:42:16,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 20:42:16,355 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 20:42:16,355 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 20:42:16,355 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-12-02 20:42:16,355 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-12-02 20:42:16,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:42:16,355 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-02 20:42:16,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:42:16,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:42:16,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:16,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:42:16,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:16,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:42:16,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1188208494, now seen corresponding path program 1 times [2018-12-02 20:42:16,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:42:16,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:42:16,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:16,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:42:16,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:16,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:42:16,392 INFO L82 PathProgramCache]: Analyzing trace with hash 268257712, now seen corresponding path program 1 times [2018-12-02 20:42:16,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:42:16,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:42:16,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:16,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:42:16,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:16,631 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 20:42:16,632 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 20:42:16,632 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 20:42:16,632 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 20:42:16,632 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 20:42:16,632 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 20:42:16,632 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 20:42:16,632 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 20:42:16,632 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_false-unreach-call_true-termination.i_Iteration2_Lasso [2018-12-02 20:42:16,633 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 20:42:16,633 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 20:42:16,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:16,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:16,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:16,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:16,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:16,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-12-02 20:42:16,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:16,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:16,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:16,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:16,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:16,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:16,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:16,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:17,018 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 20:42:17,021 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 20:42:17,022 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-12-02 20:42:17,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:17,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:42:17,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:17,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:17,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:17,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:42:17,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:42:17,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:17,026 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-12-02 20:42:17,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:17,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:42:17,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:17,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:17,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:17,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:42:17,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:42:17,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:17,029 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-12-02 20:42:17,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:17,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:42:17,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:17,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:17,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:17,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:42:17,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:42:17,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:17,030 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-12-02 20:42:17,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:17,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:42:17,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:17,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:17,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:17,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:42:17,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:42:17,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:17,032 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-12-02 20:42:17,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:17,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:42:17,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:17,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:17,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:17,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:42:17,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:42:17,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:17,034 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-12-02 20:42:17,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:17,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:42:17,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:17,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:17,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:17,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:42:17,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:42:17,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:17,036 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-12-02 20:42:17,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:17,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:42:17,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:17,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:17,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:17,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:42:17,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:42:17,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:17,038 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-12-02 20:42:17,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:17,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:17,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:17,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:17,039 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 20:42:17,039 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 20:42:17,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:17,042 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-12-02 20:42:17,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:17,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:42:17,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:17,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:17,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:17,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:42:17,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:42:17,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:17,043 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-12-02 20:42:17,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:17,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:42:17,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:17,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:17,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:17,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:42:17,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:42:17,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:17,045 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-12-02 20:42:17,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:17,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:42:17,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:17,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:17,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:17,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:42:17,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:42:17,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:17,047 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-12-02 20:42:17,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:17,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:42:17,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:17,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:17,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:17,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:42:17,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:42:17,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:17,049 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-12-02 20:42:17,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:17,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:17,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:17,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:17,051 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 20:42:17,051 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 20:42:17,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:17,055 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-12-02 20:42:17,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:17,056 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 20:42:17,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:17,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:17,059 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 20:42:17,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 20:42:17,085 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 20:42:17,113 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 20:42:17,113 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-02 20:42:17,115 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 20:42:17,116 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 20:42:17,116 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 20:42:17,117 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-12-02 20:42:17,123 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-12-02 20:42:17,128 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 20:42:17,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:42:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:42:17,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:42:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:42:17,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:42:17,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:42:17,184 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-12-02 20:42:17,184 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-02 20:42:17,222 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-12-02 20:42:17,223 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-12-02 20:42:17,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 20:42:17,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-12-02 20:42:17,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 2 letters. Loop has 6 letters. [2018-12-02 20:42:17,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 20:42:17,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 8 letters. Loop has 6 letters. [2018-12-02 20:42:17,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 20:42:17,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 2 letters. Loop has 12 letters. [2018-12-02 20:42:17,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 20:42:17,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 40 transitions. [2018-12-02 20:42:17,229 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-02 20:42:17,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 22 states and 31 transitions. [2018-12-02 20:42:17,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-02 20:42:17,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-02 20:42:17,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2018-12-02 20:42:17,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 20:42:17,231 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-12-02 20:42:17,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2018-12-02 20:42:17,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-12-02 20:42:17,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 20:42:17,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2018-12-02 20:42:17,232 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-12-02 20:42:17,233 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-12-02 20:42:17,233 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 20:42:17,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2018-12-02 20:42:17,233 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-02 20:42:17,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 20:42:17,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 20:42:17,234 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 20:42:17,234 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 20:42:17,234 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-12-02 20:42:17,234 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-12-02 20:42:17,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:42:17,235 INFO L82 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2018-12-02 20:42:17,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:42:17,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:42:17,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:17,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:42:17,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:17,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:42:17,251 INFO L82 PathProgramCache]: Analyzing trace with hash 43044122, now seen corresponding path program 1 times [2018-12-02 20:42:17,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:42:17,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:42:17,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:17,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:42:17,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:17,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:42:17,261 INFO L82 PathProgramCache]: Analyzing trace with hash 268259380, now seen corresponding path program 1 times [2018-12-02 20:42:17,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:42:17,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:42:17,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:17,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:42:17,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:17,459 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 20:42:17,459 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 20:42:17,459 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 20:42:17,459 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 20:42:17,459 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 20:42:17,459 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 20:42:17,459 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 20:42:17,459 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 20:42:17,459 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_false-unreach-call_true-termination.i_Iteration3_Lasso [2018-12-02 20:42:17,459 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 20:42:17,459 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 20:42:17,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:17,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:17,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:17,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:17,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:17,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-12-02 20:42:17,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:17,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:17,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:17,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:17,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:17,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:17,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:17,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:17,657 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 20:42:17,657 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 20:42:17,658 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-12-02 20:42:17,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:17,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:42:17,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:17,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:17,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:17,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:42:17,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:42:17,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:17,661 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-12-02 20:42:17,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:17,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:42:17,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:17,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:17,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:17,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:42:17,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:42:17,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:17,663 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-12-02 20:42:17,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:17,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:42:17,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:17,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:17,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:17,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:42:17,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:42:17,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:17,665 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-12-02 20:42:17,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:17,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:42:17,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:17,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:17,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:17,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:42:17,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:42:17,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:17,668 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-12-02 20:42:17,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:17,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:17,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:17,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:17,669 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 20:42:17,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 20:42:17,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:17,672 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-12-02 20:42:17,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:17,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:17,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:17,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:17,673 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 20:42:17,673 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 20:42:17,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:17,677 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-12-02 20:42:17,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:17,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:17,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:17,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:17,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 20:42:17,680 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 20:42:17,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:17,685 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-12-02 20:42:17,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:17,685 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 20:42:17,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:17,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:17,699 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 20:42:17,699 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 20:42:17,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:17,702 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-12-02 20:42:17,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:17,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:17,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:17,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:17,703 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 20:42:17,703 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 20:42:17,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:17,705 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-12-02 20:42:17,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:17,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:17,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:17,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:17,707 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 20:42:17,707 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 20:42:17,718 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 20:42:17,726 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 20:42:17,726 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 20:42:17,726 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 20:42:17,728 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-02 20:42:17,728 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 20:42:17,728 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-12-02 20:42:17,738 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2018-12-02 20:42:17,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:42:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:42:17,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:42:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:42:17,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:42:17,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:42:17,800 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-12-02 20:42:17,800 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-12-02 20:42:17,849 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-12-02 20:42:17,849 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-12-02 20:42:17,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 20:42:17,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-12-02 20:42:17,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 3 letters. Loop has 5 letters. [2018-12-02 20:42:17,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 20:42:17,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 8 letters. Loop has 5 letters. [2018-12-02 20:42:17,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 20:42:17,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 3 letters. Loop has 10 letters. [2018-12-02 20:42:17,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 20:42:17,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 77 transitions. [2018-12-02 20:42:17,852 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-12-02 20:42:17,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 39 states and 51 transitions. [2018-12-02 20:42:17,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-12-02 20:42:17,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-12-02 20:42:17,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions. [2018-12-02 20:42:17,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 20:42:17,853 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2018-12-02 20:42:17,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions. [2018-12-02 20:42:17,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2018-12-02 20:42:17,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 20:42:17,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-12-02 20:42:17,856 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-12-02 20:42:17,856 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-12-02 20:42:17,856 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 20:42:17,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 40 transitions. [2018-12-02 20:42:17,856 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-02 20:42:17,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 20:42:17,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 20:42:17,857 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 20:42:17,857 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 20:42:17,857 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-12-02 20:42:17,857 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~mem7;havoc main_#t~mem8; 316#L24-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 309#L24-3 [2018-12-02 20:42:17,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:42:17,858 INFO L82 PathProgramCache]: Analyzing trace with hash 925734, now seen corresponding path program 1 times [2018-12-02 20:42:17,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:42:17,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:42:17,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:17,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:42:17,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:17,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:42:17,868 INFO L82 PathProgramCache]: Analyzing trace with hash 2500554, now seen corresponding path program 1 times [2018-12-02 20:42:17,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:42:17,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:42:17,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:17,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:42:17,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:17,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:42:17,876 INFO L82 PathProgramCache]: Analyzing trace with hash 237874543, now seen corresponding path program 1 times [2018-12-02 20:42:17,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:42:17,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:42:17,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:17,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:42:17,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:42:18,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:42:18,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:42:18,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:42:18,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:42:18,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:42:18,125 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-12-02 20:42:18,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:42:18,246 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2018-12-02 20:42:18,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:42:18,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 43 transitions. [2018-12-02 20:42:18,247 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-02 20:42:18,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 30 states and 41 transitions. [2018-12-02 20:42:18,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-02 20:42:18,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-02 20:42:18,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 41 transitions. [2018-12-02 20:42:18,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 20:42:18,247 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2018-12-02 20:42:18,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 41 transitions. [2018-12-02 20:42:18,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-12-02 20:42:18,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 20:42:18,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2018-12-02 20:42:18,248 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2018-12-02 20:42:18,248 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2018-12-02 20:42:18,249 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 20:42:18,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2018-12-02 20:42:18,249 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-02 20:42:18,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 20:42:18,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 20:42:18,249 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:42:18,249 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 20:42:18,249 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-12-02 20:42:18,249 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-12-02 20:42:18,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:42:18,250 INFO L82 PathProgramCache]: Analyzing trace with hash -272098468, now seen corresponding path program 1 times [2018-12-02 20:42:18,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:42:18,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:42:18,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:18,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:42:18,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:42:18,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:42:18,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:42:18,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:42:18,261 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 20:42:18,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:42:18,261 INFO L82 PathProgramCache]: Analyzing trace with hash 43044122, now seen corresponding path program 2 times [2018-12-02 20:42:18,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:42:18,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:42:18,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:18,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:42:18,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:18,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:42:18,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:42:18,314 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-12-02 20:42:18,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:42:18,347 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2018-12-02 20:42:18,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:42:18,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 71 transitions. [2018-12-02 20:42:18,348 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-12-02 20:42:18,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 71 transitions. [2018-12-02 20:42:18,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-02 20:42:18,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-02 20:42:18,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 71 transitions. [2018-12-02 20:42:18,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 20:42:18,349 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2018-12-02 20:42:18,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 71 transitions. [2018-12-02 20:42:18,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2018-12-02 20:42:18,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-02 20:42:18,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2018-12-02 20:42:18,351 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2018-12-02 20:42:18,351 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2018-12-02 20:42:18,351 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 20:42:18,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 47 transitions. [2018-12-02 20:42:18,352 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-02 20:42:18,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 20:42:18,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 20:42:18,352 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:42:18,352 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 20:42:18,352 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-12-02 20:42:18,352 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~mem7;havoc main_#t~mem8; 485#L24-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 476#L24-3 [2018-12-02 20:42:18,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:42:18,353 INFO L82 PathProgramCache]: Analyzing trace with hash 97623763, now seen corresponding path program 1 times [2018-12-02 20:42:18,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:42:18,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:42:18,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:18,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:42:18,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:18,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:42:18,365 INFO L82 PathProgramCache]: Analyzing trace with hash 2500554, now seen corresponding path program 2 times [2018-12-02 20:42:18,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:42:18,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:42:18,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:18,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:42:18,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:18,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:42:18,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1938296220, now seen corresponding path program 1 times [2018-12-02 20:42:18,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:42:18,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:42:18,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:18,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:42:18,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:18,552 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 75 [2018-12-02 20:42:18,632 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 20:42:18,632 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 20:42:18,632 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 20:42:18,632 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 20:42:18,633 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 20:42:18,633 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 20:42:18,633 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 20:42:18,633 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 20:42:18,633 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_false-unreach-call_true-termination.i_Iteration6_Lasso [2018-12-02 20:42:18,633 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 20:42:18,633 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 20:42:18,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:18,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:18,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:18,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:18,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:18,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:18,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:18,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:18,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:18,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:18,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:18,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:18,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:18,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:18,903 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 20:42:18,903 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 20:42:18,904 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-12-02 20:42:18,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:18,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:42:18,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:18,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:18,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:18,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:42:18,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:42:18,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:18,906 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-12-02 20:42:18,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:18,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:42:18,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:18,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:18,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:18,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:42:18,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:42:18,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:18,908 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-12-02 20:42:18,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:18,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:42:18,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:18,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:18,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:18,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:42:18,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:42:18,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:18,909 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-12-02 20:42:18,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:18,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:18,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:18,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:18,910 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 20:42:18,910 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 20:42:18,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:18,912 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-12-02 20:42:18,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:18,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:42:18,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:18,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:18,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:18,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:42:18,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:42:18,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:18,913 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-12-02 20:42:18,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:18,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:42:18,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:18,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:18,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:18,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:42:18,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:42:18,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:18,915 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-12-02 20:42:18,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:18,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:42:18,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:18,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:18,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:18,916 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:42:18,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:42:18,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:18,916 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-12-02 20:42:18,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:18,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:42:18,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:18,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:18,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:18,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:42:18,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:42:18,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:18,919 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-12-02 20:42:18,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:18,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:42:18,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:18,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:18,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:18,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:42:18,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:42:18,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:18,920 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-12-02 20:42:18,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:18,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:18,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:18,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:18,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 20:42:18,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 20:42:18,939 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 20:42:18,960 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-02 20:42:18,960 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-02 20:42:18,961 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 20:42:18,961 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 20:42:18,962 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 20:42:18,962 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-12-02 20:42:18,974 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-12-02 20:42:18,975 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 20:42:18,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:42:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:42:18,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:42:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:42:19,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:42:19,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:42:19,009 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-12-02 20:42:19,009 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 47 transitions. cyclomatic complexity: 16 Second operand 3 states. [2018-12-02 20:42:19,017 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-12-02 20:42:19,018 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-12-02 20:42:19,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 20:42:19,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-12-02 20:42:19,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 10 letters. Loop has 4 letters. [2018-12-02 20:42:19,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 20:42:19,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 14 letters. Loop has 4 letters. [2018-12-02 20:42:19,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 20:42:19,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 10 letters. Loop has 8 letters. [2018-12-02 20:42:19,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 20:42:19,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 52 transitions. [2018-12-02 20:42:19,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 20:42:19,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 30 states and 41 transitions. [2018-12-02 20:42:19,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 20:42:19,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 20:42:19,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 41 transitions. [2018-12-02 20:42:19,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 20:42:19,021 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2018-12-02 20:42:19,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 41 transitions. [2018-12-02 20:42:19,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-02 20:42:19,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-02 20:42:19,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2018-12-02 20:42:19,023 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2018-12-02 20:42:19,023 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2018-12-02 20:42:19,023 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 20:42:19,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 41 transitions. [2018-12-02 20:42:19,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 20:42:19,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 20:42:19,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 20:42:19,024 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2018-12-02 20:42:19,024 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 20:42:19,025 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-12-02 20:42:19,025 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-12-02 20:42:19,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:42:19,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1268629571, now seen corresponding path program 2 times [2018-12-02 20:42:19,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:42:19,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:42:19,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:19,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:42:19,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:19,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:42:19,043 INFO L82 PathProgramCache]: Analyzing trace with hash 53536832, now seen corresponding path program 3 times [2018-12-02 20:42:19,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:42:19,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:42:19,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:19,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:42:19,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:19,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:42:19,050 INFO L82 PathProgramCache]: Analyzing trace with hash 2116886020, now seen corresponding path program 1 times [2018-12-02 20:42:19,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:42:19,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:42:19,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:19,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:42:19,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:42:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:42:19,342 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 93 [2018-12-02 20:42:19,488 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2018-12-02 20:42:19,489 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 20:42:19,490 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 20:42:19,490 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 20:42:19,490 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 20:42:19,490 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 20:42:19,490 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 20:42:19,490 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 20:42:19,490 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 20:42:19,490 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_false-unreach-call_true-termination.i_Iteration7_Lasso [2018-12-02 20:42:19,490 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 20:42:19,490 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 20:42:19,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:19,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:19,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:19,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:19,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:19,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:19,664 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2018-12-02 20:42:19,810 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2018-12-02 20:42:19,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:19,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:19,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:19,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:19,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:19,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:42:20,160 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-12-02 20:42:20,165 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 20:42:20,165 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 20:42:20,166 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-12-02 20:42:20,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:20,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:42:20,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:20,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:20,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:20,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:42:20,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:42:20,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:20,167 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-12-02 20:42:20,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:20,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:42:20,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:20,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:20,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:20,168 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:42:20,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:42:20,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:20,168 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-12-02 20:42:20,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:20,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:20,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:20,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:20,169 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 20:42:20,169 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 20:42:20,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:20,170 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-12-02 20:42:20,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:20,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:42:20,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:20,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:20,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:20,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:42:20,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:42:20,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:20,171 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-12-02 20:42:20,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:20,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:42:20,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:20,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:20,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:20,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:42:20,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:42:20,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:20,172 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-12-02 20:42:20,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:20,172 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 20:42:20,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:20,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:20,173 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 20:42:20,173 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 20:42:20,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:20,174 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-12-02 20:42:20,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:20,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:20,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:20,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:20,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 20:42:20,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 20:42:20,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:42:20,176 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-12-02 20:42:20,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:42:20,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:42:20,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:42:20,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:42:20,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 20:42:20,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 20:42:20,182 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 20:42:20,184 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 20:42:20,184 INFO L444 ModelExtractionUtils]: 16 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 20:42:20,184 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 20:42:20,185 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 20:42:20,185 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 20:42:20,185 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-12-02 20:42:20,201 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2018-12-02 20:42:20,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:42:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:42:20,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:42:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:42:20,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:42:20,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:42:20,249 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-12-02 20:42:20,249 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-12-02 20:42:20,280 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-12-02 20:42:20,280 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-12-02 20:42:20,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 20:42:20,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-12-02 20:42:20,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 11 letters. Loop has 5 letters. [2018-12-02 20:42:20,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 20:42:20,281 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 20:42:20,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:42:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:42:20,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:42:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:42:20,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:42:20,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:42:20,314 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-12-02 20:42:20,314 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-12-02 20:42:20,345 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-12-02 20:42:20,345 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-12-02 20:42:20,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 20:42:20,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-12-02 20:42:20,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 11 letters. Loop has 5 letters. [2018-12-02 20:42:20,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 20:42:20,346 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 20:42:20,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:42:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:42:20,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:42:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:42:20,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:42:20,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:42:20,373 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-12-02 20:42:20,373 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-12-02 20:42:20,400 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-12-02 20:42:20,400 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-12-02 20:42:20,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 20:42:20,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2018-12-02 20:42:20,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 11 letters. Loop has 5 letters. [2018-12-02 20:42:20,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 20:42:20,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 16 letters. Loop has 5 letters. [2018-12-02 20:42:20,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 20:42:20,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 11 letters. Loop has 10 letters. [2018-12-02 20:42:20,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 20:42:20,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 93 transitions. [2018-12-02 20:42:20,402 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 20:42:20,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 0 states and 0 transitions. [2018-12-02 20:42:20,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 20:42:20,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 20:42:20,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 20:42:20,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 20:42:20,403 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 20:42:20,403 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 20:42:20,403 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 20:42:20,403 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 20:42:20,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 20:42:20,403 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 20:42:20,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 20:42:20,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 08:42:20 BoogieIcfgContainer [2018-12-02 20:42:20,407 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 20:42:20,407 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 20:42:20,407 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 20:42:20,407 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 20:42:20,407 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:42:16" (3/4) ... [2018-12-02 20:42:20,410 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 20:42:20,410 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 20:42:20,410 INFO L168 Benchmark]: Toolchain (without parser) took 4625.08 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 295.7 MB). Free memory was 961.4 MB in the beginning and 919.7 MB in the end (delta: 41.6 MB). Peak memory consumption was 337.3 MB. Max. memory is 11.5 GB. [2018-12-02 20:42:20,411 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 20:42:20,411 INFO L168 Benchmark]: CACSL2BoogieTranslator took 133.29 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 950.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 20:42:20,411 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.54 ms. Allocated memory is still 1.0 GB. Free memory was 950.6 MB in the beginning and 945.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 20:42:20,411 INFO L168 Benchmark]: Boogie Preprocessor took 46.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -151.0 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-12-02 20:42:20,412 INFO L168 Benchmark]: RCFGBuilder took 161.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2018-12-02 20:42:20,412 INFO L168 Benchmark]: BuchiAutomizer took 4257.72 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 191.4 MB). Free memory was 1.1 GB in the beginning and 919.7 MB in the end (delta: 148.7 MB). Peak memory consumption was 340.0 MB. Max. memory is 11.5 GB. [2018-12-02 20:42:20,412 INFO L168 Benchmark]: Witness Printer took 2.68 ms. Allocated memory is still 1.3 GB. Free memory is still 919.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 20:42:20,414 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 133.29 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 950.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 21.54 ms. Allocated memory is still 1.0 GB. Free memory was 950.6 MB in the beginning and 945.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -151.0 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 161.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4257.72 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 191.4 MB). Free memory was 1.1 GB in the beginning and 919.7 MB in the end (delta: 148.7 MB). Peak memory consumption was 340.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.68 ms. Allocated memory is still 1.3 GB. Free memory is still 919.7 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 4.2s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 3.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. 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.1s 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: 60ms 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...