./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrncat_malloc.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_aaa9ce67-8dca-44ed-a7ad-a5445b02c195/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_aaa9ce67-8dca-44ed-a7ad-a5445b02c195/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_aaa9ce67-8dca-44ed-a7ad-a5445b02c195/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_aaa9ce67-8dca-44ed-a7ad-a5445b02c195/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrncat_malloc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_aaa9ce67-8dca-44ed-a7ad-a5445b02c195/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_aaa9ce67-8dca-44ed-a7ad-a5445b02c195/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 57af49b15bb2f44ef5afe346e632fe87804775c2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:10:55,092 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:10:55,094 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:10:55,106 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:10:55,106 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:10:55,107 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:10:55,109 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:10:55,111 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:10:55,113 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:10:55,114 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:10:55,116 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:10:55,117 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:10:55,117 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:10:55,118 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:10:55,119 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:10:55,121 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:10:55,121 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:10:55,122 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:10:55,124 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:10:55,127 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:10:55,128 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:10:55,130 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:10:55,131 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:10:55,132 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:10:55,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:10:55,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:10:55,136 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:10:55,137 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:10:55,137 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:10:55,138 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:10:55,139 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:10:55,140 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:10:55,140 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:10:55,141 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:10:55,143 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:10:55,143 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:10:55,144 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:10:55,144 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:10:55,144 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:10:55,145 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:10:55,146 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:10:55,147 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_aaa9ce67-8dca-44ed-a7ad-a5445b02c195/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:10:55,164 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:10:55,165 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:10:55,166 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:10:55,166 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:10:55,166 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:10:55,167 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:10:55,167 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:10:55,167 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:10:55,168 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:10:55,168 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:10:55,168 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:10:55,168 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:10:55,169 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:10:55,169 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:10:55,169 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:10:55,169 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:10:55,170 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:10:55,170 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:10:55,170 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:10:55,170 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:10:55,171 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:10:55,171 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:10:55,171 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:10:55,172 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:10:55,172 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:10:55,172 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:10:55,172 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:10:55,173 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:10:55,174 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:10:55,174 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_aaa9ce67-8dca-44ed-a7ad-a5445b02c195/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 -> 57af49b15bb2f44ef5afe346e632fe87804775c2 [2019-11-16 00:10:55,202 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:10:55,211 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:10:55,214 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:10:55,225 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:10:55,226 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:10:55,227 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_aaa9ce67-8dca-44ed-a7ad-a5445b02c195/bin/uautomizer/../../sv-benchmarks/c/termination-15/cstrncat_malloc.i [2019-11-16 00:10:55,316 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aaa9ce67-8dca-44ed-a7ad-a5445b02c195/bin/uautomizer/data/5ed103504/ee2dc6b291e248749ad29077895dcf25/FLAG537544d5c [2019-11-16 00:10:55,744 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:10:55,745 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_aaa9ce67-8dca-44ed-a7ad-a5445b02c195/sv-benchmarks/c/termination-15/cstrncat_malloc.i [2019-11-16 00:10:55,757 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aaa9ce67-8dca-44ed-a7ad-a5445b02c195/bin/uautomizer/data/5ed103504/ee2dc6b291e248749ad29077895dcf25/FLAG537544d5c [2019-11-16 00:10:56,064 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_aaa9ce67-8dca-44ed-a7ad-a5445b02c195/bin/uautomizer/data/5ed103504/ee2dc6b291e248749ad29077895dcf25 [2019-11-16 00:10:56,067 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:10:56,070 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:10:56,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:10:56,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:10:56,076 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:10:56,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:10:56" (1/1) ... [2019-11-16 00:10:56,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16cc098d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:56, skipping insertion in model container [2019-11-16 00:10:56,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:10:56" (1/1) ... [2019-11-16 00:10:56,087 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:10:56,126 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:10:56,624 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:10:56,637 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:10:56,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:10:56,774 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:10:56,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:56 WrapperNode [2019-11-16 00:10:56,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:10:56,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:10:56,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:10:56,776 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:10:56,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:56" (1/1) ... [2019-11-16 00:10:56,800 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:56" (1/1) ... [2019-11-16 00:10:56,823 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:10:56,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:10:56,824 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:10:56,824 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:10:56,832 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:56" (1/1) ... [2019-11-16 00:10:56,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:56" (1/1) ... [2019-11-16 00:10:56,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:56" (1/1) ... [2019-11-16 00:10:56,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:56" (1/1) ... [2019-11-16 00:10:56,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:56" (1/1) ... [2019-11-16 00:10:56,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:56" (1/1) ... [2019-11-16 00:10:56,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:56" (1/1) ... [2019-11-16 00:10:56,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:10:56,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:10:56,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:10:56,858 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:10:56,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aaa9ce67-8dca-44ed-a7ad-a5445b02c195/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-16 00:10:56,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:10:56,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:10:56,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:10:56,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:10:56,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:10:56,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:10:57,247 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:10:57,247 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:10:57,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:10:57 BoogieIcfgContainer [2019-11-16 00:10:57,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:10:57,249 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:10:57,249 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:10:57,253 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:10:57,254 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:10:57,254 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:10:56" (1/3) ... [2019-11-16 00:10:57,255 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67e6f0a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:10:57, skipping insertion in model container [2019-11-16 00:10:57,255 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:10:57,255 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:56" (2/3) ... [2019-11-16 00:10:57,255 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67e6f0a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:10:57, skipping insertion in model container [2019-11-16 00:10:57,255 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:10:57,256 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:10:57" (3/3) ... [2019-11-16 00:10:57,257 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrncat_malloc.i [2019-11-16 00:10:57,301 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:10:57,301 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:10:57,301 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:10:57,301 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:10:57,302 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:10:57,302 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:10:57,302 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:10:57,302 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:10:57,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-16 00:10:57,337 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-16 00:10:57,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:10:57,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:10:57,344 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:10:57,344 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:10:57,344 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:10:57,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-16 00:10:57,346 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-16 00:10:57,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:10:57,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:10:57,347 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:10:57,347 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:10:57,355 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218.base, main_#t~ret218.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~n~0 := main_#t~nondet215;havoc main_#t~nondet215; 15#L381true assume !(main_~length1~0 < 1); 18#L381-2true assume !(main_~length2~0 < 1); 11#L384-1true assume !(main_~n~0 < 1); 6#L387-1true assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset, cstrncat_#t~mem205, cstrncat_#t~post210, cstrncat_#t~post211.base, cstrncat_#t~post211.offset, cstrncat_#t~post207.base, cstrncat_#t~post207.offset, cstrncat_#t~mem208, cstrncat_#t~short209, cstrncat_#t~mem212, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 8#L367-3true [2019-11-16 00:10:57,355 INFO L793 eck$LassoCheckResult]: Loop: 8#L367-3true call cstrncat_#t~mem205 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 4#L367-1true assume !!(0 != cstrncat_#t~mem205);havoc cstrncat_#t~mem205;cstrncat_#t~post206.base, cstrncat_#t~post206.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post206.base, 1 + cstrncat_#t~post206.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset; 8#L367-3true [2019-11-16 00:10:57,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:57,361 INFO L82 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2019-11-16 00:10:57,370 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:57,370 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495086928] [2019-11-16 00:10:57,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:57,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:57,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:57,538 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:10:57,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:57,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2019-11-16 00:10:57,539 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:57,540 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803538160] [2019-11-16 00:10:57,540 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:57,540 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:57,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:57,557 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:10:57,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:57,562 INFO L82 PathProgramCache]: Analyzing trace with hash 180553748, now seen corresponding path program 1 times [2019-11-16 00:10:57,562 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:57,562 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364136794] [2019-11-16 00:10:57,563 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:57,563 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:57,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:57,622 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:10:58,177 WARN L191 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 98 [2019-11-16 00:10:58,379 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-16 00:10:58,392 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:10:58,394 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:10:58,394 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:10:58,394 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:10:58,394 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:10:58,394 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:10:58,395 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:10:58,395 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:10:58,395 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncat_malloc.i_Iteration1_Lasso [2019-11-16 00:10:58,395 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:10:58,395 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:10:58,434 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-16 00:10:58,446 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-16 00:10:58,452 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-16 00:10:58,455 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-16 00:10:58,458 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-16 00:10:58,461 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-16 00:10:58,464 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-16 00:10:58,467 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-16 00:10:58,471 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-16 00:10:58,476 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-16 00:10:58,478 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-16 00:10:58,481 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-16 00:10:58,483 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-16 00:10:58,485 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-16 00:10:58,488 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-16 00:10:58,490 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-16 00:10:58,492 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-16 00:10:58,495 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-16 00:10:58,501 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-16 00:10:58,504 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-16 00:10:58,506 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-16 00:10:58,509 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-16 00:10:58,890 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-11-16 00:10:59,888 WARN L191 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-16 00:10:59,968 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:10:59,973 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:10:59,975 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-16 00:10:59,978 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:59,978 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:59,979 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:59,980 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:59,980 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:59,982 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:59,982 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:59,986 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:59,989 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-16 00:10:59,990 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:59,994 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:59,994 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:59,995 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:59,999 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:59,999 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:11:00,017 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:00,018 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-16 00:11:00,019 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:00,019 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:00,019 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:00,019 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:00,019 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:00,020 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:00,020 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:00,021 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:00,022 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-16 00:11:00,023 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:00,023 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:00,023 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:00,023 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:00,024 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:00,024 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:00,024 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:00,026 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:00,027 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-16 00:11:00,028 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:00,028 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:00,028 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:00,028 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:00,029 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:00,029 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:00,029 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:00,030 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:00,031 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-16 00:11:00,031 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:00,032 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:00,032 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:00,032 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:00,032 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:00,033 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:00,033 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:00,034 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:00,034 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-16 00:11:00,035 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:00,035 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:00,035 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:00,036 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:00,036 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:00,036 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:00,036 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:00,038 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:00,038 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-16 00:11:00,039 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:00,039 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:00,039 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:00,039 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:00,040 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:00,040 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:00,040 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:00,041 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:00,042 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-16 00:11:00,042 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:00,043 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:00,043 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:00,043 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:00,045 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:11:00,045 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:11:00,049 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:00,050 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-16 00:11:00,050 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:00,051 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:00,051 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:00,051 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:00,051 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:00,052 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:00,052 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:00,053 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:00,053 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-16 00:11:00,054 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:00,054 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:00,054 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:00,054 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:00,055 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:00,055 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:00,055 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:00,056 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:00,057 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-16 00:11:00,057 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:00,057 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:00,058 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:00,058 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:00,058 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:00,058 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:00,059 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:00,059 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:00,060 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-16 00:11:00,061 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:00,061 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:00,061 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:00,061 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:00,061 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:00,062 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:00,062 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:00,063 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:00,064 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-16 00:11:00,064 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:00,064 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:00,065 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:00,065 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:00,065 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:00,066 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:00,066 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:00,067 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:00,067 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-16 00:11:00,068 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:00,068 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:00,068 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:00,069 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:00,069 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:00,069 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:00,069 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:00,077 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:00,077 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-16 00:11:00,078 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:00,080 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:00,080 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:00,080 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:00,084 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:00,085 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:00,085 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:00,086 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:00,087 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-16 00:11:00,088 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:00,088 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:00,088 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:00,091 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:00,092 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:00,092 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:00,093 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:00,094 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:00,094 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-16 00:11:00,095 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:00,102 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:00,102 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:00,103 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:00,103 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:00,103 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:00,104 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:00,105 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:00,106 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-16 00:11:00,106 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:00,107 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:00,107 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:00,107 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:00,107 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:00,108 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:00,108 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:00,109 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:00,112 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-16 00:11:00,113 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:00,113 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:00,114 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:00,116 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:00,116 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:00,117 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:00,117 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:00,118 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:00,120 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-16 00:11:00,121 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:00,123 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:00,123 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:00,124 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:00,124 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:00,125 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:00,125 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:00,126 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:00,127 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-16 00:11:00,128 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:00,129 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:00,129 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:00,129 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:00,137 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:11:00,145 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:11:00,227 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:11:00,300 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:11:00,300 INFO L444 ModelExtractionUtils]: 39 out of 43 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:11:00,302 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:11:00,304 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:11:00,304 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:11:00,305 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrncat_~s~0.base)_1, ULTIMATE.start_cstrncat_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrncat_~s~0.base)_1 - 1*ULTIMATE.start_cstrncat_~s~0.offset Supporting invariants [] [2019-11-16 00:11:00,332 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-16 00:11:00,340 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:11:00,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:00,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:11:00,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:00,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:11:00,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:00,428 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-16 00:11:00,446 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-16 00:11:00,448 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2019-11-16 00:11:00,535 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 53 states and 76 transitions. Complement of second has 7 states. [2019-11-16 00:11:00,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:11:00,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:11:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2019-11-16 00:11:00,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-16 00:11:00,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:00,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-16 00:11:00,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:00,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-16 00:11:00,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:00,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 76 transitions. [2019-11-16 00:11:00,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:11:00,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 20 states and 27 transitions. [2019-11-16 00:11:00,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-16 00:11:00,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-16 00:11:00,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2019-11-16 00:11:00,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:11:00,557 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-16 00:11:00,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2019-11-16 00:11:00,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-11-16 00:11:00,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-16 00:11:00,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-11-16 00:11:00,586 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-16 00:11:00,587 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-16 00:11:00,587 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:11:00,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2019-11-16 00:11:00,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:11:00,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:11:00,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:11:00,589 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:00,589 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:11:00,589 INFO L791 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 158#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218.base, main_#t~ret218.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~n~0 := main_#t~nondet215;havoc main_#t~nondet215; 159#L381 assume !(main_~length1~0 < 1); 164#L381-2 assume !(main_~length2~0 < 1); 174#L384-1 assume !(main_~n~0 < 1); 169#L387-1 assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset, cstrncat_#t~mem205, cstrncat_#t~post210, cstrncat_#t~post211.base, cstrncat_#t~post211.offset, cstrncat_#t~post207.base, cstrncat_#t~post207.offset, cstrncat_#t~mem208, cstrncat_#t~short209, cstrncat_#t~mem212, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 170#L367-3 call cstrncat_#t~mem205 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 160#L367-1 assume !(0 != cstrncat_#t~mem205);havoc cstrncat_#t~mem205; 161#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 176#L369 assume !cstrncat_#t~short209; 172#L369-2 assume !!cstrncat_#t~short209;havoc cstrncat_#t~post207.base, cstrncat_#t~post207.offset;havoc cstrncat_#t~mem208;havoc cstrncat_#t~short209;cstrncat_#t~post210 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post210 - 1;havoc cstrncat_#t~post210;cstrncat_#t~post211.base, cstrncat_#t~post211.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post211.base, 1 + cstrncat_#t~post211.offset;havoc cstrncat_#t~post211.base, cstrncat_#t~post211.offset; 175#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 166#L369 [2019-11-16 00:11:00,590 INFO L793 eck$LassoCheckResult]: Loop: 166#L369 assume !cstrncat_#t~short209; 171#L369-2 assume !!cstrncat_#t~short209;havoc cstrncat_#t~post207.base, cstrncat_#t~post207.offset;havoc cstrncat_#t~mem208;havoc cstrncat_#t~short209;cstrncat_#t~post210 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post210 - 1;havoc cstrncat_#t~post210;cstrncat_#t~post211.base, cstrncat_#t~post211.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post211.base, 1 + cstrncat_#t~post211.offset;havoc cstrncat_#t~post211.base, cstrncat_#t~post211.offset; 165#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 166#L369 [2019-11-16 00:11:00,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:00,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1662025132, now seen corresponding path program 1 times [2019-11-16 00:11:00,590 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:00,590 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665123490] [2019-11-16 00:11:00,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:00,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:00,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:00,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:00,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665123490] [2019-11-16 00:11:00,684 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:00,685 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:11:00,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927494922] [2019-11-16 00:11:00,688 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:11:00,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:00,688 INFO L82 PathProgramCache]: Analyzing trace with hash 76643, now seen corresponding path program 1 times [2019-11-16 00:11:00,688 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:00,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389555058] [2019-11-16 00:11:00,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:00,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:00,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:00,709 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-16 00:11:00,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389555058] [2019-11-16 00:11:00,710 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:00,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:11:00,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461056348] [2019-11-16 00:11:00,710 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:11:00,711 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:00,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:11:00,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:11:00,715 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-16 00:11:00,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:00,737 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-11-16 00:11:00,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:11:00,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2019-11-16 00:11:00,740 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:11:00,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2019-11-16 00:11:00,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:11:00,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:11:00,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:11:00,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:11:00,741 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:11:00,741 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:11:00,741 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:11:00,742 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:11:00,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:11:00,742 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:11:00,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:11:00,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:11:00 BoogieIcfgContainer [2019-11-16 00:11:00,748 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:11:00,748 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:11:00,748 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:11:00,749 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:11:00,749 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:10:57" (3/4) ... [2019-11-16 00:11:00,752 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:11:00,752 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:11:00,754 INFO L168 Benchmark]: Toolchain (without parser) took 4684.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 939.4 MB in the beginning and 966.8 MB in the end (delta: -27.5 MB). Peak memory consumption was 112.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:11:00,754 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:11:00,755 INFO L168 Benchmark]: CACSL2BoogieTranslator took 702.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -176.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:11:00,756 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.16 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-16 00:11:00,756 INFO L168 Benchmark]: Boogie Preprocessor took 33.03 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-16 00:11:00,757 INFO L168 Benchmark]: RCFGBuilder took 391.07 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-16 00:11:00,757 INFO L168 Benchmark]: BuchiAutomizer took 3499.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 966.8 MB in the end (delta: 120.8 MB). Peak memory consumption was 120.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:11:00,758 INFO L168 Benchmark]: Witness Printer took 3.81 ms. Allocated memory is still 1.2 GB. Free memory is still 966.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:11:00,764 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 702.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -176.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.16 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 33.03 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 391.07 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 3499.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 966.8 MB in the end (delta: 120.8 MB). Peak memory consumption was 120.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.81 ms. Allocated memory is still 1.2 GB. Free memory is still 966.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 3 iterations. TraceHistogramMax:2. Analysis of lassos took 3.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. 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 19 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 37 SDtfs, 26 SDslu, 23 SDs, 0 SdLazy, 16 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital203 mio100 ax100 hnf98 lsp97 ukn76 mio100 lsp41 div100 bol100 ite100 ukn100 eq187 hnf88 smp100 dnf240 smp97 tf100 neg96 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...