./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/working_dir_d081d32e-e24e-4daa-b8f8-b8d5f1e53eb5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d081d32e-e24e-4daa-b8f8-b8d5f1e53eb5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d081d32e-e24e-4daa-b8f8-b8d5f1e53eb5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d081d32e-e24e-4daa-b8f8-b8d5f1e53eb5/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d081d32e-e24e-4daa-b8f8-b8d5f1e53eb5/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d081d32e-e24e-4daa-b8f8-b8d5f1e53eb5/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 32bit --witnessprinter.graph.data.programhash df3db790fa8159689a8da2e25598b93c123cddf7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:59:06,124 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:59:06,125 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:59:06,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:59:06,138 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:59:06,138 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:59:06,139 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:59:06,141 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:59:06,142 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:59:06,143 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:59:06,144 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:59:06,144 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:59:06,145 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:59:06,146 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:59:06,146 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:59:06,147 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:59:06,148 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:59:06,149 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:59:06,151 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:59:06,157 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:59:06,158 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:59:06,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:59:06,160 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:59:06,161 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:59:06,166 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:59:06,167 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:59:06,168 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:59:06,168 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:59:06,169 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:59:06,170 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:59:06,170 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:59:06,170 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:59:06,171 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:59:06,172 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:59:06,173 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:59:06,173 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:59:06,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:59:06,173 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:59:06,174 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:59:06,175 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:59:06,175 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:59:06,176 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d081d32e-e24e-4daa-b8f8-b8d5f1e53eb5/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:59:06,192 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:59:06,192 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:59:06,193 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:59:06,193 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:59:06,193 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:59:06,193 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:59:06,194 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:59:06,194 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:59:06,194 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:59:06,194 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:59:06,194 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:59:06,195 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:59:06,195 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:59:06,195 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:59:06,195 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:59:06,195 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:59:06,195 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:59:06,195 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:59:06,196 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:59:06,196 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:59:06,196 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:59:06,196 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:59:06,196 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:59:06,196 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:59:06,196 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:59:06,197 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:59:06,197 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:59:06,197 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:59:06,197 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:59:06,197 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:59:06,197 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:59:06,198 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:59:06,199 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/working_dir_d081d32e-e24e-4daa-b8f8-b8d5f1e53eb5/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> df3db790fa8159689a8da2e25598b93c123cddf7 [2019-10-22 08:59:06,221 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:59:06,231 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:59:06,234 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:59:06,235 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:59:06,235 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:59:06,236 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d081d32e-e24e-4daa-b8f8-b8d5f1e53eb5/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.i [2019-10-22 08:59:06,279 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d081d32e-e24e-4daa-b8f8-b8d5f1e53eb5/bin/uautomizer/data/c6c825ab4/71cfb04d2b754db38bdc6312f90f326c/FLAG5c87b8219 [2019-10-22 08:59:06,737 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:59:06,738 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d081d32e-e24e-4daa-b8f8-b8d5f1e53eb5/sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.i [2019-10-22 08:59:06,755 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d081d32e-e24e-4daa-b8f8-b8d5f1e53eb5/bin/uautomizer/data/c6c825ab4/71cfb04d2b754db38bdc6312f90f326c/FLAG5c87b8219 [2019-10-22 08:59:07,257 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d081d32e-e24e-4daa-b8f8-b8d5f1e53eb5/bin/uautomizer/data/c6c825ab4/71cfb04d2b754db38bdc6312f90f326c [2019-10-22 08:59:07,259 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:59:07,260 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:59:07,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:07,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:59:07,265 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:59:07,265 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:07" (1/1) ... [2019-10-22 08:59:07,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ef670a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:07, skipping insertion in model container [2019-10-22 08:59:07,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:07" (1/1) ... [2019-10-22 08:59:07,272 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:59:07,314 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:59:07,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:07,671 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:59:07,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:07,746 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:59:07,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:07 WrapperNode [2019-10-22 08:59:07,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:07,747 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:07,747 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:59:07,747 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:59:07,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:07" (1/1) ... [2019-10-22 08:59:07,767 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:07" (1/1) ... [2019-10-22 08:59:07,790 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:07,790 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:59:07,790 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:59:07,790 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:59:07,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:07" (1/1) ... [2019-10-22 08:59:07,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:07" (1/1) ... [2019-10-22 08:59:07,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:07" (1/1) ... [2019-10-22 08:59:07,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:07" (1/1) ... [2019-10-22 08:59:07,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:07" (1/1) ... [2019-10-22 08:59:07,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:07" (1/1) ... [2019-10-22 08:59:07,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:07" (1/1) ... [2019-10-22 08:59:07,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:59:07,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:59:07,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:59:07,824 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:59:07,825 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d081d32e-e24e-4daa-b8f8-b8d5f1e53eb5/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-10-22 08:59:07,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:59:07,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:59:07,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:59:07,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:59:07,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:59:07,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:59:08,269 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:59:08,270 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-22 08:59:08,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:08 BoogieIcfgContainer [2019-10-22 08:59:08,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:59:08,271 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:59:08,271 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:59:08,275 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:59:08,276 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:08,276 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:59:07" (1/3) ... [2019-10-22 08:59:08,277 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5315988e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:08, skipping insertion in model container [2019-10-22 08:59:08,277 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:08,277 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:07" (2/3) ... [2019-10-22 08:59:08,277 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5315988e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:08, skipping insertion in model container [2019-10-22 08:59:08,277 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:08,278 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:08" (3/3) ... [2019-10-22 08:59:08,279 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrcmp-alloca-2.i [2019-10-22 08:59:08,321 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:59:08,321 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:59:08,321 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:59:08,321 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:59:08,321 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:59:08,321 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:59:08,321 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:59:08,321 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:59:08,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-10-22 08:59:08,352 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-10-22 08:59:08,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:08,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:08,357 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:59:08,357 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:08,357 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:59:08,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-10-22 08:59:08,359 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-10-22 08:59:08,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:08,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:08,359 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:59:08,359 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:08,364 INFO L791 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 20#L528true assume !(main_~length1~0 < 1); 4#L528-2true assume !(main_~length2~0 < 1); 16#L531-1true call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 7#L537-3true [2019-10-22 08:59:08,364 INFO L793 eck$LassoCheckResult]: Loop: 7#L537-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 6#L537-2true main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 7#L537-3true [2019-10-22 08:59:08,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:08,368 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-10-22 08:59:08,373 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:08,374 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821427674] [2019-10-22 08:59:08,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:08,477 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:08,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:08,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-10-22 08:59:08,478 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:08,478 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962966484] [2019-10-22 08:59:08,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:08,491 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:08,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:08,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-10-22 08:59:08,492 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:08,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748683052] [2019-10-22 08:59:08,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:08,526 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:08,716 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:08,717 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:08,717 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:08,717 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:08,718 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:08,718 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:08,718 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:08,718 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:08,718 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcmp-alloca-2.i_Iteration1_Lasso [2019-10-22 08:59:08,718 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:08,718 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:08,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,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-10-22 08:59:08,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-10-22 08:59:09,293 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-10-22 08:59:09,381 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:09,390 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:09,392 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-10-22 08:59:09,394 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:09,396 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:09,397 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:09,397 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:09,398 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:09,400 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:09,400 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:09,408 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:09,409 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-10-22 08:59:09,412 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:09,413 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:09,414 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:09,414 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:09,414 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:09,414 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:09,415 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:09,416 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:09,416 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-10-22 08:59:09,417 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:09,417 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:09,417 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:09,417 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:09,417 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:09,418 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:09,418 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:09,421 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:09,422 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-10-22 08:59:09,422 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:09,424 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:09,425 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:09,425 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:09,425 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:09,426 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:09,426 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:09,427 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:09,429 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-10-22 08:59:09,430 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:09,432 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:09,432 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:09,432 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:09,435 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:09,440 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:09,452 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:09,455 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-10-22 08:59:09,456 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:09,456 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:09,456 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:09,456 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:09,458 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:09,458 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:09,462 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:09,475 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-10-22 08:59:09,475 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:09,475 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:09,476 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:09,476 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:09,477 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:09,478 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:09,483 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:09,483 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-10-22 08:59:09,484 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:09,484 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:09,484 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:09,485 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:09,490 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:09,490 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:09,510 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:09,518 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-10-22 08:59:09,519 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:09,519 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:59:09,519 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:09,520 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:09,528 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:59:09,528 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:09,577 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:09,578 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-10-22 08:59:09,579 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:09,579 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:09,579 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:09,579 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:09,579 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:09,580 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:09,580 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:09,581 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:09,581 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-10-22 08:59:09,582 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:09,583 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:09,583 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:09,583 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:09,584 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:09,584 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:09,589 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:09,589 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-10-22 08:59:09,590 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:09,590 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:09,591 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:09,591 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:09,592 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:09,592 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:09,595 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:09,595 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-10-22 08:59:09,596 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:09,596 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:09,596 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:09,597 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:09,597 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:09,597 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:09,597 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:09,598 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:09,599 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-10-22 08:59:09,607 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:09,607 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:09,607 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:09,607 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:09,610 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:09,610 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:09,657 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:09,702 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:59:09,703 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:59:09,706 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:09,708 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:09,708 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:09,709 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-10-22 08:59:09,724 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 08:59:09,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:09,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:09,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:09,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:09,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:09,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:09,805 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-10-22 08:59:09,806 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 3 states. [2019-10-22 08:59:09,865 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 3 states. Result 51 states and 73 transitions. Complement of second has 7 states. [2019-10-22 08:59:09,868 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-10-22 08:59:09,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:09,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2019-10-22 08:59:09,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 49 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 08:59:09,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:09,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 49 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 08:59:09,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:09,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 49 transitions. Stem has 5 letters. Loop has 4 letters. [2019-10-22 08:59:09,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:09,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 73 transitions. [2019-10-22 08:59:09,879 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 08:59:09,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 15 states and 21 transitions. [2019-10-22 08:59:09,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 08:59:09,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 08:59:09,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2019-10-22 08:59:09,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:09,888 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-10-22 08:59:09,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2019-10-22 08:59:09,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-10-22 08:59:09,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 08:59:09,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2019-10-22 08:59:09,913 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-10-22 08:59:09,913 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-10-22 08:59:09,913 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:59:09,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2019-10-22 08:59:09,914 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 08:59:09,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:09,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:09,922 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:09,922 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:09,922 INFO L791 eck$LassoCheckResult]: Stem: 156#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 154#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 155#L528 assume !(main_~length1~0 < 1); 146#L528-2 assume !(main_~length2~0 < 1); 147#L531-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 151#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 152#L537-4 main_~i~1 := 0; 153#L542-3 [2019-10-22 08:59:09,923 INFO L793 eck$LassoCheckResult]: Loop: 153#L542-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 157#L542-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 153#L542-3 [2019-10-22 08:59:09,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:09,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2019-10-22 08:59:09,923 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:09,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349542966] [2019-10-22 08:59:09,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:09,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:09,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:09,961 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:09,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:09,962 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2019-10-22 08:59:09,962 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:09,962 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948142156] [2019-10-22 08:59:09,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:09,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:09,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:09,979 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:09,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:09,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2019-10-22 08:59:09,980 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:09,980 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15574078] [2019-10-22 08:59:09,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:09,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:09,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:10,022 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:10,206 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:10,206 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:10,206 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:10,206 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:10,207 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:10,207 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:10,207 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:10,207 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:10,207 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcmp-alloca-2.i_Iteration2_Lasso [2019-10-22 08:59:10,207 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:10,207 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:10,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:10,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:10,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:10,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:10,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:10,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:10,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:10,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:10,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:10,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:10,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:10,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:10,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:10,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-10-22 08:59:10,658 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-10-22 08:59:10,705 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:10,705 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:10,706 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-10-22 08:59:10,706 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,707 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:10,707 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,707 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,707 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,707 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:10,707 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:10,708 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,709 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-10-22 08:59:10,709 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,709 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:10,709 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,710 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,710 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,710 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:10,710 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:10,711 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,711 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-10-22 08:59:10,716 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,716 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,716 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,716 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,717 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:10,717 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:10,720 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,720 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-10-22 08:59:10,721 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,721 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:10,721 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,721 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,721 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,721 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:10,721 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:10,722 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,726 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-10-22 08:59:10,727 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,727 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,727 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,728 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,728 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:10,729 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:10,731 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,735 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-10-22 08:59:10,735 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,736 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:10,736 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,736 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,736 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,737 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:10,737 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:10,737 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,737 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-10-22 08:59:10,738 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,738 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:10,744 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,744 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,744 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,744 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:10,744 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:10,745 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,745 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-10-22 08:59:10,746 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,746 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,746 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,746 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,747 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:10,747 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:10,749 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,749 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-10-22 08:59:10,749 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,750 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,750 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,750 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,753 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:10,755 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:10,757 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,757 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-10-22 08:59:10,758 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,758 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:10,758 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,758 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,764 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,764 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:10,764 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:10,765 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,765 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-10-22 08:59:10,765 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,766 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,766 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,766 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,767 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:10,767 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:10,769 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,770 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-10-22 08:59:10,770 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,775 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,775 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,775 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,776 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:10,777 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:10,779 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,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-10-22 08:59:10,780 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,780 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:59:10,780 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,780 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,788 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:59:10,788 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:10,805 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,808 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-10-22 08:59:10,810 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,810 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,810 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,811 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,812 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:10,812 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:10,818 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,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-10-22 08:59:10,819 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,819 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:10,820 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,820 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,820 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,820 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:10,820 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:10,821 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,821 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-10-22 08:59:10,822 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,822 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,822 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,822 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,825 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:10,825 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:10,827 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,827 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-10-22 08:59:10,828 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,828 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:10,828 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,828 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,828 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,828 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:10,829 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:10,829 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,829 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-10-22 08:59:10,830 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,832 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,832 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,832 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,834 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:10,834 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:10,861 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:10,906 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:59:10,907 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:59:10,907 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:10,908 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:10,909 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:10,909 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~length2~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~length2~0 Supporting invariants [] [2019-10-22 08:59:10,927 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 08:59:10,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:10,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:10,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:10,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:10,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:10,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:10,973 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-10-22 08:59:10,974 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-10-22 08:59:11,003 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 21 states and 32 transitions. Complement of second has 6 states. [2019-10-22 08:59:11,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:11,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:11,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-10-22 08:59:11,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 08:59:11,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:11,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 9 letters. Loop has 2 letters. [2019-10-22 08:59:11,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:11,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 7 letters. Loop has 4 letters. [2019-10-22 08:59:11,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:11,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 32 transitions. [2019-10-22 08:59:11,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:11,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 23 transitions. [2019-10-22 08:59:11,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:59:11,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:59:11,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 23 transitions. [2019-10-22 08:59:11,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:11,010 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2019-10-22 08:59:11,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 23 transitions. [2019-10-22 08:59:11,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-22 08:59:11,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-22 08:59:11,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2019-10-22 08:59:11,013 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2019-10-22 08:59:11,013 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2019-10-22 08:59:11,013 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:59:11,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2019-10-22 08:59:11,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:11,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:11,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:11,014 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:11,015 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:11,015 INFO L791 eck$LassoCheckResult]: Stem: 266#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 264#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 265#L528 assume !(main_~length1~0 < 1); 256#L528-2 assume !(main_~length2~0 < 1); 257#L531-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 261#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 262#L537-4 main_~i~1 := 0; 263#L542-3 assume !(main_~i~1 < main_~length2~0 - 1); 269#L542-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset, cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset, cstrcmp_#t~mem2, cstrcmp_#t~mem3, cstrcmp_#t~mem4, cstrcmp_#t~short5, cstrcmp_#t~mem8, cstrcmp_#t~mem9, cstrcmp_#t~ite10, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 258#L517-5 [2019-10-22 08:59:11,015 INFO L793 eck$LassoCheckResult]: Loop: 258#L517-5 call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short5 := 0 != cstrcmp_#t~mem2; 254#L517-1 assume cstrcmp_#t~short5;call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem4 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short5 := cstrcmp_#t~mem3 == cstrcmp_#t~mem4; 255#L517-3 assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem2;havoc cstrcmp_#t~short5;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~mem4;cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post6.base, 1 + cstrcmp_#t~post6.offset;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset;cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post7.base, 1 + cstrcmp_#t~post7.offset;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset; 258#L517-5 [2019-10-22 08:59:11,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:11,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2019-10-22 08:59:11,015 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:11,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353161974] [2019-10-22 08:59:11,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:11,052 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:11,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:11,053 INFO L82 PathProgramCache]: Analyzing trace with hash 77559, now seen corresponding path program 1 times [2019-10-22 08:59:11,053 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:11,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536027966] [2019-10-22 08:59:11,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:11,070 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:11,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:11,077 INFO L82 PathProgramCache]: Analyzing trace with hash -296047742, now seen corresponding path program 1 times [2019-10-22 08:59:11,077 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:11,077 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560792365] [2019-10-22 08:59:11,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:11,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:11,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560792365] [2019-10-22 08:59:11,230 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:11,231 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:59:11,231 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511840810] [2019-10-22 08:59:11,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:11,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:59:11,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:59:11,354 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. cyclomatic complexity: 10 Second operand 7 states. [2019-10-22 08:59:11,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:11,460 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2019-10-22 08:59:11,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:59:11,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2019-10-22 08:59:11,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:11,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 17 states and 22 transitions. [2019-10-22 08:59:11,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 08:59:11,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:59:11,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2019-10-22 08:59:11,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:11,463 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-10-22 08:59:11,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2019-10-22 08:59:11,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-10-22 08:59:11,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-22 08:59:11,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2019-10-22 08:59:11,465 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-10-22 08:59:11,465 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-10-22 08:59:11,465 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:59:11,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2019-10-22 08:59:11,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:11,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:11,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:11,466 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:11,466 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:11,466 INFO L791 eck$LassoCheckResult]: Stem: 326#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 324#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 325#L528 assume !(main_~length1~0 < 1); 316#L528-2 assume !(main_~length2~0 < 1); 317#L531-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 321#L537-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 319#L537-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 320#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 322#L537-4 main_~i~1 := 0; 323#L542-3 assume !(main_~i~1 < main_~length2~0 - 1); 329#L542-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset, cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset, cstrcmp_#t~mem2, cstrcmp_#t~mem3, cstrcmp_#t~mem4, cstrcmp_#t~short5, cstrcmp_#t~mem8, cstrcmp_#t~mem9, cstrcmp_#t~ite10, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 318#L517-5 [2019-10-22 08:59:11,466 INFO L793 eck$LassoCheckResult]: Loop: 318#L517-5 call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short5 := 0 != cstrcmp_#t~mem2; 314#L517-1 assume cstrcmp_#t~short5;call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem4 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short5 := cstrcmp_#t~mem3 == cstrcmp_#t~mem4; 315#L517-3 assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem2;havoc cstrcmp_#t~short5;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~mem4;cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post6.base, 1 + cstrcmp_#t~post6.offset;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset;cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post7.base, 1 + cstrcmp_#t~post7.offset;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset; 318#L517-5 [2019-10-22 08:59:11,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:11,467 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2019-10-22 08:59:11,467 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:11,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170745354] [2019-10-22 08:59:11,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:11,484 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:11,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:11,484 INFO L82 PathProgramCache]: Analyzing trace with hash 77559, now seen corresponding path program 2 times [2019-10-22 08:59:11,484 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:11,484 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146521072] [2019-10-22 08:59:11,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:11,492 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:11,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:11,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1311502304, now seen corresponding path program 1 times [2019-10-22 08:59:11,493 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:11,493 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168317057] [2019-10-22 08:59:11,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:11,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:59:11,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168317057] [2019-10-22 08:59:11,637 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:11,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 08:59:11,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269813129] [2019-10-22 08:59:11,761 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:11,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 08:59:11,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:59:11,762 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand 9 states. [2019-10-22 08:59:11,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:11,847 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2019-10-22 08:59:11,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:59:11,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. [2019-10-22 08:59:11,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:11,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 21 transitions. [2019-10-22 08:59:11,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 08:59:11,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:59:11,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2019-10-22 08:59:11,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:11,849 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-10-22 08:59:11,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2019-10-22 08:59:11,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-10-22 08:59:11,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-22 08:59:11,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-10-22 08:59:11,851 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-10-22 08:59:11,851 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-10-22 08:59:11,851 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:59:11,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2019-10-22 08:59:11,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:11,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:11,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:11,852 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:11,852 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:11,852 INFO L791 eck$LassoCheckResult]: Stem: 383#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 381#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 382#L528 assume !(main_~length1~0 < 1); 373#L528-2 assume !(main_~length2~0 < 1); 374#L531-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 378#L537-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 376#L537-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 377#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 379#L537-4 main_~i~1 := 0; 380#L542-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 384#L542-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 385#L542-3 assume !(main_~i~1 < main_~length2~0 - 1); 386#L542-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset, cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset, cstrcmp_#t~mem2, cstrcmp_#t~mem3, cstrcmp_#t~mem4, cstrcmp_#t~short5, cstrcmp_#t~mem8, cstrcmp_#t~mem9, cstrcmp_#t~ite10, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 375#L517-5 [2019-10-22 08:59:11,852 INFO L793 eck$LassoCheckResult]: Loop: 375#L517-5 call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short5 := 0 != cstrcmp_#t~mem2; 371#L517-1 assume cstrcmp_#t~short5;call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem4 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short5 := cstrcmp_#t~mem3 == cstrcmp_#t~mem4; 372#L517-3 assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem2;havoc cstrcmp_#t~short5;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~mem4;cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post6.base, 1 + cstrcmp_#t~post6.offset;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset;cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post7.base, 1 + cstrcmp_#t~post7.offset;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset; 375#L517-5 [2019-10-22 08:59:11,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:11,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2019-10-22 08:59:11,853 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:11,853 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642786624] [2019-10-22 08:59:11,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:11,873 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:11,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:11,873 INFO L82 PathProgramCache]: Analyzing trace with hash 77559, now seen corresponding path program 3 times [2019-10-22 08:59:11,873 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:11,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899465122] [2019-10-22 08:59:11,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:11,884 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:11,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:11,885 INFO L82 PathProgramCache]: Analyzing trace with hash -718433154, now seen corresponding path program 1 times [2019-10-22 08:59:11,885 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:11,885 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385152770] [2019-10-22 08:59:11,885 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,885 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:11,923 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:12,353 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 111 [2019-10-22 08:59:12,463 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-10-22 08:59:12,482 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:12,482 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:12,483 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:12,483 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:12,483 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:12,483 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:12,483 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:12,483 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:12,483 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcmp-alloca-2.i_Iteration5_Lasso [2019-10-22 08:59:12,483 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:12,483 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:12,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,865 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 86 [2019-10-22 08:59:12,999 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-10-22 08:59:12,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,671 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-10-22 08:59:13,710 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:13,710 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:13,711 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-10-22 08:59:13,711 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:13,712 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:13,712 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:13,712 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:13,712 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:13,712 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:13,712 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:13,713 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:13,713 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-10-22 08:59:13,714 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:13,714 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:13,714 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:13,714 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:13,714 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:13,715 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:13,715 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:13,715 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:13,715 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-10-22 08:59:13,716 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:13,716 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:13,716 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:13,716 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:13,717 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:13,717 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:13,718 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:13,718 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-10-22 08:59:13,719 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:13,719 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:13,719 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:13,719 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:13,720 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:13,720 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:13,721 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:13,721 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-10-22 08:59:13,722 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:13,722 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:13,722 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:13,722 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:13,723 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:13,723 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:13,727 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:13,728 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-10-22 08:59:13,728 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:13,728 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:13,729 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:13,729 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:13,729 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:13,730 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:13,734 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:13,734 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-10-22 08:59:13,734 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:13,735 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:13,735 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:59:13,735 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:13,737 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-10-22 08:59:13,737 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 08:59:13,749 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:13,749 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-10-22 08:59:13,750 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:13,750 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:13,750 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:13,750 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:13,753 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:13,753 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:13,791 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:13,839 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:59:13,839 INFO L444 ModelExtractionUtils]: 40 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:59:13,840 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:13,841 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:13,841 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:13,841 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcmp_~s1.base)_1, ULTIMATE.start_cstrcmp_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcmp_~s1.base)_1 - 1*ULTIMATE.start_cstrcmp_~s1.offset Supporting invariants [] [2019-10-22 08:59:13,910 INFO L297 tatePredicateManager]: 22 out of 22 supporting invariants were superfluous and have been removed [2019-10-22 08:59:13,912 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:59:13,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:13,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:13,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:13,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:59:13,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:13,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:13,955 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-10-22 08:59:13,955 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-10-22 08:59:13,964 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 19 states and 24 transitions. Complement of second has 4 states. [2019-10-22 08:59:13,965 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-10-22 08:59:13,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:13,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-10-22 08:59:13,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 13 letters. Loop has 3 letters. [2019-10-22 08:59:13,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:13,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 16 letters. Loop has 3 letters. [2019-10-22 08:59:13,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:13,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 13 letters. Loop has 6 letters. [2019-10-22 08:59:13,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:13,966 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2019-10-22 08:59:13,967 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:13,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2019-10-22 08:59:13,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:59:13,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:59:13,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:59:13,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:13,967 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:13,967 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:13,968 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:13,968 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:59:13,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:59:13,968 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:13,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:59:13,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:59:13 BoogieIcfgContainer [2019-10-22 08:59:13,973 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:59:13,974 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:59:13,974 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:59:13,974 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:59:13,975 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:08" (3/4) ... [2019-10-22 08:59:13,978 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:59:13,978 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:59:13,980 INFO L168 Benchmark]: Toolchain (without parser) took 6719.41 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 303.0 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -120.1 MB). Peak memory consumption was 182.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:13,980 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:13,981 INFO L168 Benchmark]: CACSL2BoogieTranslator took 485.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:13,981 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.91 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-10-22 08:59:13,981 INFO L168 Benchmark]: Boogie Preprocessor took 33.57 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-10-22 08:59:13,982 INFO L168 Benchmark]: RCFGBuilder took 446.96 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: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:13,983 INFO L168 Benchmark]: BuchiAutomizer took 5702.10 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 192.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:13,983 INFO L168 Benchmark]: Witness Printer took 4.24 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:13,986 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 485.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.91 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. * Boogie Preprocessor took 33.57 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 446.96 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: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5702.10 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 192.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.24 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * i + length2 and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[s1] + -1 * s1 and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 5.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 16 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 75 SDtfs, 132 SDslu, 97 SDs, 0 SdLazy, 94 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital203 mio100 ax110 hnf98 lsp84 ukn74 mio100 lsp47 div100 bol100 ite100 ukn100 eq178 hnf89 smp100 dnf157 smp95 tf100 neg94 sie122 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 6 VariablesLoop: 2 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...