./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrncpy_mixed_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2c2e91b2-b1d4-4aee-9503-9f7657f9cd17/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2c2e91b2-b1d4-4aee-9503-9f7657f9cd17/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2c2e91b2-b1d4-4aee-9503-9f7657f9cd17/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2c2e91b2-b1d4-4aee-9503-9f7657f9cd17/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrncpy_mixed_alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2c2e91b2-b1d4-4aee-9503-9f7657f9cd17/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2c2e91b2-b1d4-4aee-9503-9f7657f9cd17/bin/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 64bit --witnessprinter.graph.data.programhash 493d4075183da22c41b393b09f987b5f1b55266e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:56:22,078 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:56:22,080 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:56:22,090 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:56:22,090 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:56:22,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:56:22,092 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:56:22,094 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:56:22,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:56:22,097 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:56:22,098 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:56:22,099 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:56:22,099 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:56:22,100 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:56:22,101 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:56:22,102 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:56:22,103 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:56:22,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:56:22,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:56:22,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:56:22,109 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:56:22,110 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:56:22,111 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:56:22,112 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:56:22,114 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:56:22,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:56:22,118 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:56:22,120 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:56:22,120 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:56:22,123 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:56:22,123 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:56:22,124 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:56:22,124 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:56:22,125 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:56:22,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:56:22,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:56:22,131 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:56:22,131 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:56:22,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:56:22,135 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:56:22,137 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:56:22,138 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2c2e91b2-b1d4-4aee-9503-9f7657f9cd17/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 21:56:22,157 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:56:22,157 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:56:22,159 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:56:22,159 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:56:22,159 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:56:22,159 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:56:22,160 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:56:22,160 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:56:22,160 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:56:22,160 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:56:22,161 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:56:22,161 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:56:22,162 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:56:22,162 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:56:22,162 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:56:22,162 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:56:22,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:56:22,163 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:56:22,163 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:56:22,163 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:56:22,163 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:56:22,163 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:56:22,164 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:56:22,164 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:56:22,164 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:56:22,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:56:22,165 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:56:22,165 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:56:22,165 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:56:22,166 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_2c2e91b2-b1d4-4aee-9503-9f7657f9cd17/bin/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 493d4075183da22c41b393b09f987b5f1b55266e [2019-11-15 21:56:22,210 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:56:22,219 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:56:22,222 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:56:22,223 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:56:22,224 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:56:22,224 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2c2e91b2-b1d4-4aee-9503-9f7657f9cd17/bin/uautomizer/../../sv-benchmarks/c/termination-15/cstrncpy_mixed_alloca.i [2019-11-15 21:56:22,280 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2c2e91b2-b1d4-4aee-9503-9f7657f9cd17/bin/uautomizer/data/f16e09059/cef26e7c1f074f6084544eee17ee2d01/FLAGac4d92fef [2019-11-15 21:56:22,811 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:56:22,812 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2c2e91b2-b1d4-4aee-9503-9f7657f9cd17/sv-benchmarks/c/termination-15/cstrncpy_mixed_alloca.i [2019-11-15 21:56:22,828 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2c2e91b2-b1d4-4aee-9503-9f7657f9cd17/bin/uautomizer/data/f16e09059/cef26e7c1f074f6084544eee17ee2d01/FLAGac4d92fef [2019-11-15 21:56:23,297 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2c2e91b2-b1d4-4aee-9503-9f7657f9cd17/bin/uautomizer/data/f16e09059/cef26e7c1f074f6084544eee17ee2d01 [2019-11-15 21:56:23,299 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:56:23,300 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:56:23,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:56:23,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:56:23,305 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:56:23,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:56:23" (1/1) ... [2019-11-15 21:56:23,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64fee1ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:23, skipping insertion in model container [2019-11-15 21:56:23,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:56:23" (1/1) ... [2019-11-15 21:56:23,315 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:56:23,345 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:56:23,757 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:56:23,766 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:56:23,813 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:56:23,879 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:56:23,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:23 WrapperNode [2019-11-15 21:56:23,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:56:23,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:56:23,881 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:56:23,881 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:56:23,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:23" (1/1) ... [2019-11-15 21:56:23,900 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:23" (1/1) ... [2019-11-15 21:56:23,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:56:23,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:56:23,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:56:23,918 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:56:23,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:23" (1/1) ... [2019-11-15 21:56:23,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:23" (1/1) ... [2019-11-15 21:56:23,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:23" (1/1) ... [2019-11-15 21:56:23,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:23" (1/1) ... [2019-11-15 21:56:23,934 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:23" (1/1) ... [2019-11-15 21:56:23,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:23" (1/1) ... [2019-11-15 21:56:23,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:23" (1/1) ... [2019-11-15 21:56:23,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:56:23,953 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:56:23,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:56:23,953 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:56:23,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c2e91b2-b1d4-4aee-9503-9f7657f9cd17/bin/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 [2019-11-15 21:56:24,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:56:24,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:56:24,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:56:24,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:56:24,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:56:24,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:56:24,242 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:56:24,242 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 21:56:24,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:56:24 BoogieIcfgContainer [2019-11-15 21:56:24,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:56:24,244 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:56:24,244 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:56:24,247 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:56:24,248 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:56:24,248 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:56:23" (1/3) ... [2019-11-15 21:56:24,249 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37cfa483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:56:24, skipping insertion in model container [2019-11-15 21:56:24,249 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:56:24,249 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:23" (2/3) ... [2019-11-15 21:56:24,250 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37cfa483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:56:24, skipping insertion in model container [2019-11-15 21:56:24,250 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:56:24,250 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:56:24" (3/3) ... [2019-11-15 21:56:24,251 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrncpy_mixed_alloca.i [2019-11-15 21:56:24,290 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:56:24,290 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:56:24,290 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:56:24,290 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:56:24,291 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:56:24,291 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:56:24,291 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:56:24,291 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:56:24,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-15 21:56:24,322 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 21:56:24,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:56:24,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:56:24,328 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:56:24,328 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:56:24,328 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:56:24,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-15 21:56:24,330 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 21:56:24,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:56:24,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:56:24,331 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:56:24,331 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:56:24,337 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet211;havoc main_#t~nondet211;main_~n~0 := main_#t~nondet212;havoc main_#t~nondet212; 5#L385true assume !(main_~length~0 < 1); 7#L385-2true assume !(main_~n~0 < 1); 3#L388-1true call main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;call main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset + (main_~n~0 - 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post205, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, cstrncpy_#t~mem208, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, cstrncpy_#t~post209, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 14#L370-2true [2019-11-15 21:56:24,338 INFO L793 eck$LassoCheckResult]: Loop: 14#L370-2true assume !!(cstrncpy_~n > 0);cstrncpy_#t~post205 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post205 - 1;havoc cstrncpy_#t~post205;cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset - 1;cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post207.base, 1 + cstrncpy_#t~post207.offset;call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1);call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); 9#L372true assume !(0 == cstrncpy_#t~mem208);havoc cstrncpy_#t~mem208;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset; 14#L370-2true [2019-11-15 21:56:24,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:24,343 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-15 21:56:24,350 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:24,350 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835954365] [2019-11-15 21:56:24,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:24,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:24,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:24,505 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:56:24,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:24,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1747, now seen corresponding path program 1 times [2019-11-15 21:56:24,506 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:24,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664997624] [2019-11-15 21:56:24,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:24,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:24,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:24,529 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:56:24,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:24,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935768, now seen corresponding path program 1 times [2019-11-15 21:56:24,531 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:24,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932633373] [2019-11-15 21:56:24,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:24,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:24,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:24,598 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:56:25,117 WARN L191 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 93 [2019-11-15 21:56:25,289 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-15 21:56:25,301 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:56:25,302 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:56:25,303 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:56:25,303 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:56:25,303 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:56:25,303 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:56:25,303 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:56:25,303 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:56:25,304 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_mixed_alloca.i_Iteration1_Lasso [2019-11-15 21:56:25,304 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:56:25,304 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:56:25,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:25,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:25,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:25,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:25,760 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-11-15 21:56:25,945 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-11-15 21:56:25,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:25,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:25,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:25,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:25,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:25,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:25,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:25,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:25,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:25,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:25,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:25,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:25,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:25,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:25,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:25,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:25,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:25,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:26,808 WARN L191 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 21:56:26,889 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:56:26,893 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:56:26,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:56:26,896 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:26,897 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:26,897 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:26,897 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:26,897 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:26,899 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:26,899 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:26,901 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:26,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:56:26,903 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:26,903 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:26,903 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:26,903 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:26,903 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:26,904 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:26,904 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:26,904 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:26,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:56:26,905 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:26,905 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:26,906 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:26,906 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:26,906 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:26,906 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:26,906 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:26,907 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:26,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:56:26,908 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:26,908 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:26,909 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:26,909 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:26,909 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:26,909 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:26,910 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:26,910 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:26,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:56:26,911 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:26,912 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:26,912 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:26,912 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:26,915 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:56:26,915 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:56:26,922 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:26,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:56:26,924 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:26,924 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:26,924 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:26,924 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:26,926 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:56:26,926 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:56:26,929 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:26,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:56:26,931 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:26,931 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:26,931 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:26,931 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:26,940 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:56:26,940 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:56:27,060 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:56:27,115 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 21:56:27,116 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-15 21:56:27,118 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:56:27,119 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:56:27,120 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:56:27,120 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~n) = 1*ULTIMATE.start_cstrncpy_~n Supporting invariants [] [2019-11-15 21:56:27,158 INFO L297 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2019-11-15 21:56:27,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:27,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:56:27,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:56:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:27,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:56:27,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:56:27,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:56:27,264 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:56:27,265 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2019-11-15 21:56:27,299 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 5 states. [2019-11-15 21:56:27,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 21:56:27,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:56:27,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-11-15 21:56:27,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 21:56:27,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:56:27,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 21:56:27,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:56:27,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-15 21:56:27,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:56:27,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-11-15 21:56:27,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:56:27,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 11 states and 14 transitions. [2019-11-15 21:56:27,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-15 21:56:27,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 21:56:27,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-11-15 21:56:27,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:56:27,317 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-15 21:56:27,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-11-15 21:56:27,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-11-15 21:56:27,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-15 21:56:27,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-11-15 21:56:27,340 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-15 21:56:27,340 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-15 21:56:27,341 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:56:27,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-11-15 21:56:27,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:56:27,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:56:27,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:56:27,342 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:56:27,342 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:56:27,342 INFO L791 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 140#L-1 havoc main_#res;havoc main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet211;havoc main_#t~nondet211;main_~n~0 := main_#t~nondet212;havoc main_#t~nondet212; 141#L385 assume !(main_~length~0 < 1); 146#L385-2 assume !(main_~n~0 < 1); 144#L388-1 call main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;call main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset + (main_~n~0 - 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post205, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, cstrncpy_#t~mem208, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, cstrncpy_#t~post209, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 145#L370-2 assume !!(cstrncpy_~n > 0);cstrncpy_#t~post205 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post205 - 1;havoc cstrncpy_#t~post205;cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset - 1;cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post207.base, 1 + cstrncpy_#t~post207.offset;call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1);call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); 137#L372 assume 0 == cstrncpy_#t~mem208;havoc cstrncpy_#t~mem208;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~n2~0 := cstrncpy_~n; 139#L375-3 [2019-11-15 21:56:27,342 INFO L793 eck$LassoCheckResult]: Loop: 139#L375-3 cstrncpy_#t~post209 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post209 - 1; 142#L375-1 assume !!(0 != cstrncpy_#t~post209);havoc cstrncpy_#t~post209;cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset := cstrncpy_~us~0.base, cstrncpy_~us~0.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset - 1;call write~int(0, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, 1);havoc cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset; 139#L375-3 [2019-11-15 21:56:27,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:27,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935753, now seen corresponding path program 1 times [2019-11-15 21:56:27,343 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:27,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567432508] [2019-11-15 21:56:27,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:27,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:27,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:27,385 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:56:27,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:27,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2019-11-15 21:56:27,386 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:27,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487823507] [2019-11-15 21:56:27,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:27,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:27,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:27,396 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:56:27,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:27,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1298472078, now seen corresponding path program 1 times [2019-11-15 21:56:27,397 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:27,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685696726] [2019-11-15 21:56:27,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:27,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:27,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:27,439 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:56:28,155 WARN L191 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 132 [2019-11-15 21:56:28,354 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-11-15 21:56:28,357 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:56:28,357 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:56:28,357 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:56:28,357 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:56:28,357 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:56:28,357 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:56:28,357 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:56:28,357 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:56:28,358 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_mixed_alloca.i_Iteration2_Lasso [2019-11-15 21:56:28,358 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:56:28,358 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:56:28,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:28,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:28,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:28,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:28,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:28,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:28,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:28,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:28,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:28,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:28,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:28,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:28,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:28,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:28,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:28,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:28,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:28,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:28,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:28,789 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2019-11-15 21:56:28,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:29,697 WARN L191 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-11-15 21:56:29,763 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:56:29,763 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:56:29,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:56:29,764 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:29,764 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:29,764 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:29,765 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:29,765 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:29,765 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:29,765 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:29,766 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:29,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:56:29,767 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:29,767 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:29,767 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:29,767 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:29,767 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:29,768 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:29,768 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:29,768 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:29,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:56:29,769 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:29,769 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:29,769 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:29,769 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:29,769 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:29,770 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:29,770 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:29,770 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:29,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:56:29,771 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:29,771 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:29,771 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:29,772 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:29,772 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:29,772 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:29,772 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:29,773 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:29,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:56:29,773 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:29,774 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:29,774 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:29,774 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:29,775 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:56:29,775 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:56:29,777 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:29,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:56:29,778 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:29,778 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:29,778 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:29,778 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:29,778 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:29,779 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:29,779 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:29,779 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:29,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:56:29,780 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:29,780 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:29,780 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:29,780 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:29,781 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:56:29,782 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:56:29,783 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:29,784 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:56:29,784 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:29,784 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:29,785 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:29,785 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:29,785 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:29,785 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:29,785 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:29,786 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:29,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:56:29,787 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:29,787 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:29,787 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:29,787 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:29,787 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:29,787 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:29,788 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:29,788 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:29,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:56:29,789 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:29,789 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:29,789 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:29,789 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:29,790 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:56:29,791 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:56:29,792 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:29,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:56:29,793 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:29,793 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:29,793 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:29,794 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:29,794 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:29,794 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:29,794 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:29,795 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:29,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:56:29,796 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:29,796 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:29,796 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:29,796 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:29,796 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:29,796 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:29,797 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:29,797 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:29,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:56:29,798 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:29,798 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:29,798 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:29,798 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:29,798 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:29,799 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:29,799 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:29,799 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:29,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:56:29,800 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:29,800 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:29,800 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:29,800 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:29,801 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:29,801 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:29,801 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:29,802 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:29,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:56:29,802 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:29,802 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:29,803 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:29,803 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:29,803 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:29,803 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:29,803 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:29,804 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:29,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:56:29,805 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:29,805 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:29,805 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:29,805 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:29,805 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:29,805 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:29,806 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:29,806 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:29,806 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:56:29,807 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:29,807 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:29,807 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:29,807 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:29,807 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:29,808 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:29,808 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:29,808 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:29,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:56:29,809 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:29,809 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:29,809 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:29,809 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:29,810 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:29,810 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:29,810 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:29,811 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:29,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:56:29,811 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:29,812 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:29,812 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:29,812 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:29,812 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:29,812 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:29,813 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:29,819 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:29,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:56:29,820 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:29,821 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:29,821 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:29,821 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:29,822 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:56:29,826 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:56:29,828 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:29,828 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:56:29,829 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:29,831 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:29,831 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 21:56:29,831 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:29,840 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-15 21:56:29,841 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 21:56:30,124 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:56:30,281 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 21:56:30,282 INFO L444 ModelExtractionUtils]: 58 out of 66 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-15 21:56:30,282 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:56:30,285 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-11-15 21:56:30,285 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:56:30,286 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~us~0.offset) = 2*ULTIMATE.start_cstrncpy_~us~0.offset + 1 Supporting invariants [] [2019-11-15 21:56:30,328 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2019-11-15 21:56:30,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:30,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:56:30,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:56:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:30,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:56:30,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:56:30,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:56:30,388 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-15 21:56:30,388 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 21:56:30,395 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 12 states and 16 transitions. Complement of second has 4 states. [2019-11-15 21:56:30,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 21:56:30,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:56:30,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-11-15 21:56:30,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 21:56:30,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:56:30,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-15 21:56:30,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:56:30,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-15 21:56:30,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:56:30,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2019-11-15 21:56:30,399 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:56:30,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2019-11-15 21:56:30,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 21:56:30,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 21:56:30,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 21:56:30,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:56:30,401 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:56:30,401 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:56:30,402 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:56:30,402 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:56:30,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:56:30,402 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:56:30,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 21:56:30,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:56:30 BoogieIcfgContainer [2019-11-15 21:56:30,408 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:56:30,408 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:56:30,408 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:56:30,408 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:56:30,409 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:56:24" (3/4) ... [2019-11-15 21:56:30,411 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 21:56:30,412 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:56:30,413 INFO L168 Benchmark]: Toolchain (without parser) took 7112.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.0 MB). Free memory was 938.0 MB in the beginning and 1.0 GB in the end (delta: -79.6 MB). Peak memory consumption was 115.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:56:30,413 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:56:30,414 INFO L168 Benchmark]: CACSL2BoogieTranslator took 579.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -186.1 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:56:30,421 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:56:30,422 INFO L168 Benchmark]: Boogie Preprocessor took 35.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:56:30,423 INFO L168 Benchmark]: RCFGBuilder took 290.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:56:30,424 INFO L168 Benchmark]: BuchiAutomizer took 6163.90 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 78.8 MB). Peak memory consumption was 127.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:56:30,424 INFO L168 Benchmark]: Witness Printer took 3.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:56:30,433 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 579.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -186.1 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 290.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6163.90 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 78.8 MB). Peak memory consumption was 127.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n and consists of 4 locations. One deterministic module has affine ranking function 2 * us + 1 and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 5.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 26 SDtfs, 26 SDslu, 9 SDs, 0 SdLazy, 6 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital242 mio100 ax100 hnf99 lsp96 ukn86 mio100 lsp34 div100 bol100 ite100 ukn100 eq197 hnf89 smp100 dnf237 smp97 tf100 neg97 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 457ms VariablesStem: 12 VariablesLoop: 7 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...