./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.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/run_dir_255618bc-b961-4caa-ab98-068be0400e72/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_255618bc-b961-4caa-ab98-068be0400e72/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_255618bc-b961-4caa-ab98-068be0400e72/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_255618bc-b961-4caa-ab98-068be0400e72/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_255618bc-b961-4caa-ab98-068be0400e72/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_255618bc-b961-4caa-ab98-068be0400e72/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 f68b319d77fa756392ca29e618a1e0accd9b6c9e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:54:40,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:54:40,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:54:40,215 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:54:40,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:54:40,217 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:54:40,218 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:54:40,220 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:54:40,222 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:54:40,223 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:54:40,224 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:54:40,225 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:54:40,225 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:54:40,226 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:54:40,227 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:54:40,228 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:54:40,228 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:54:40,229 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:54:40,231 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:54:40,233 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:54:40,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:54:40,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:54:40,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:54:40,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:54:40,240 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:54:40,240 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:54:40,240 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:54:40,241 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:54:40,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:54:40,242 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:54:40,243 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:54:40,243 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:54:40,244 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:54:40,245 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:54:40,246 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:54:40,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:54:40,247 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:54:40,247 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:54:40,247 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:54:40,248 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:54:40,249 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:54:40,250 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_255618bc-b961-4caa-ab98-068be0400e72/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 20:54:40,266 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:54:40,266 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:54:40,267 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:54:40,267 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:54:40,268 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:54:40,268 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 20:54:40,268 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 20:54:40,268 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 20:54:40,269 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 20:54:40,269 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 20:54:40,269 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 20:54:40,269 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:54:40,270 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:54:40,270 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:54:40,270 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:54:40,270 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:54:40,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:54:40,271 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 20:54:40,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 20:54:40,271 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 20:54:40,272 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:54:40,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:54:40,272 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 20:54:40,272 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:54:40,273 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 20:54:40,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:54:40,273 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:54:40,273 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 20:54:40,274 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:54:40,274 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:54:40,274 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 20:54:40,275 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 20:54:40,275 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_255618bc-b961-4caa-ab98-068be0400e72/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 -> f68b319d77fa756392ca29e618a1e0accd9b6c9e [2019-11-15 20:54:40,301 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:54:40,311 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:54:40,315 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:54:40,316 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:54:40,316 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:54:40,317 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_255618bc-b961-4caa-ab98-068be0400e72/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i [2019-11-15 20:54:40,365 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_255618bc-b961-4caa-ab98-068be0400e72/bin/uautomizer/data/eaa35af62/4f59b4b81ebb4426a3889b698949063f/FLAG6d5452aec [2019-11-15 20:54:40,859 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:54:40,861 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_255618bc-b961-4caa-ab98-068be0400e72/sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i [2019-11-15 20:54:40,880 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_255618bc-b961-4caa-ab98-068be0400e72/bin/uautomizer/data/eaa35af62/4f59b4b81ebb4426a3889b698949063f/FLAG6d5452aec [2019-11-15 20:54:41,386 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_255618bc-b961-4caa-ab98-068be0400e72/bin/uautomizer/data/eaa35af62/4f59b4b81ebb4426a3889b698949063f [2019-11-15 20:54:41,389 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:54:41,389 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:54:41,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:54:41,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:54:41,396 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:54:41,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:54:41" (1/1) ... [2019-11-15 20:54:41,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d726a5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:41, skipping insertion in model container [2019-11-15 20:54:41,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:54:41" (1/1) ... [2019-11-15 20:54:41,408 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:54:41,459 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:54:41,903 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:54:41,914 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:54:41,973 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:54:42,025 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:54:42,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:42 WrapperNode [2019-11-15 20:54:42,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:54:42,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:54:42,028 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:54:42,029 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:54:42,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:42" (1/1) ... [2019-11-15 20:54:42,056 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:42" (1/1) ... [2019-11-15 20:54:42,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:54:42,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:54:42,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:54:42,076 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:54:42,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:42" (1/1) ... [2019-11-15 20:54:42,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:42" (1/1) ... [2019-11-15 20:54:42,097 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:42" (1/1) ... [2019-11-15 20:54:42,097 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:42" (1/1) ... [2019-11-15 20:54:42,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:42" (1/1) ... [2019-11-15 20:54:42,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:42" (1/1) ... [2019-11-15 20:54:42,120 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:42" (1/1) ... [2019-11-15 20:54:42,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:54:42,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:54:42,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:54:42,123 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:54:42,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_255618bc-b961-4caa-ab98-068be0400e72/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:54:42,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:54:42,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:54:42,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:54:42,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:54:42,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:54:42,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:54:42,487 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:54:42,488 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 20:54:42,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:54:42 BoogieIcfgContainer [2019-11-15 20:54:42,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:54:42,489 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 20:54:42,490 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 20:54:42,493 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 20:54:42,494 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:54:42,494 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 08:54:41" (1/3) ... [2019-11-15 20:54:42,495 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7aa0a7dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:54:42, skipping insertion in model container [2019-11-15 20:54:42,495 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:54:42,495 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:42" (2/3) ... [2019-11-15 20:54:42,496 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7aa0a7dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:54:42, skipping insertion in model container [2019-11-15 20:54:42,496 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:54:42,496 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:54:42" (3/3) ... [2019-11-15 20:54:42,497 INFO L371 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrcmp-alloca-1.i [2019-11-15 20:54:42,536 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 20:54:42,537 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 20:54:42,537 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 20:54:42,537 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:54:42,537 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:54:42,537 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 20:54:42,538 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:54:42,538 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 20:54:42,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2019-11-15 20:54:42,569 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-11-15 20:54:42,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:54:42,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:54:42,574 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 20:54:42,574 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:54:42,574 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 20:54:42,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2019-11-15 20:54:42,576 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-11-15 20:54:42,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:54:42,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:54:42,576 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 20:54:42,576 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:54:42,582 INFO L791 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 6#L524true assume !(main_~length1~0 < 1); 12#L524-2true assume !(main_~length2~0 < 1); 3#L527-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 16#L533-3true [2019-11-15 20:54:42,583 INFO L793 eck$LassoCheckResult]: Loop: 16#L533-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 15#L533-2true main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 16#L533-3true [2019-11-15 20:54:42,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:42,588 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-15 20:54:42,594 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:42,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564988611] [2019-11-15 20:54:42,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:42,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:42,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:42,710 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:42,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:42,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-11-15 20:54:42,711 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:42,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116459645] [2019-11-15 20:54:42,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:42,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:42,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:42,729 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:42,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:42,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-11-15 20:54:42,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:42,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772863609] [2019-11-15 20:54:42,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:42,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:42,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:42,774 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:43,038 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:54:43,038 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:54:43,039 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:54:43,039 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:54:43,039 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:54:43,039 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:54:43,039 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:54:43,039 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:54:43,039 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcmp-alloca-1.i_Iteration1_Lasso [2019-11-15 20:54:43,040 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:54:43,040 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:54:43,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-11-15 20:54:43,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:43,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:43,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:43,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-11-15 20:54:43,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-11-15 20:54:43,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:43,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-11-15 20:54:43,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:43,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:43,240 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-11-15 20:54:43,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:43,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:43,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:43,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:43,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:43,680 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 20:54:43,781 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:54:43,788 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:54:43,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:43,792 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:43,793 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:43,794 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:43,794 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:43,794 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:43,797 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:43,797 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:43,803 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:43,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:43,806 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:43,807 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:43,807 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:43,808 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:43,808 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:43,809 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:43,809 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:43,816 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:43,817 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:43,821 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:43,822 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:43,823 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:43,823 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:43,824 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:43,825 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:43,826 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:43,827 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:43,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-11-15 20:54:43,828 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:43,829 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:43,829 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:43,830 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:43,833 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:54:43,834 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:54:43,841 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:43,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:43,856 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:43,857 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:43,857 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:43,857 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:43,859 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:54:43,859 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:54:43,863 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:43,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:43,866 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:43,867 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:43,867 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:43,868 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:43,868 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:43,868 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:43,869 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:43,870 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:43,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:43,872 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:43,872 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:43,872 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:43,872 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:43,874 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:54:43,876 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:54:43,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:43,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:43,887 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:43,887 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:43,888 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:43,888 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:43,892 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:54:43,893 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:54:43,902 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:43,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:43,906 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:43,907 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:43,907 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:43,907 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:43,907 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:43,908 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:43,908 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:43,915 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:43,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:43,917 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:43,919 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:43,919 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:43,920 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:43,922 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:54:43,929 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:54:43,934 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:43,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:43,938 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:43,938 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:43,938 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:43,938 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:43,940 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:54:43,940 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:54:43,944 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:43,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:43,945 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:43,945 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:43,946 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:43,946 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:43,946 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:43,947 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:43,947 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:43,948 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:43,948 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:43,949 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:43,949 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 20:54:43,949 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:43,950 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:43,953 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:54:43,953 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:54:43,978 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:43,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:43,979 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:43,980 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:43,980 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:43,980 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:43,983 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:54:43,983 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:54:44,024 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:54:44,062 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 20:54:44,071 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:54:44,073 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:54:44,075 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:54:44,075 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:54:44,076 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-11-15 20:54:44,091 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 20:54:44,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:44,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:54:44,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:54:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:44,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:54:44,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:54:44,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:44,196 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 20:54:44,197 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 3 states. [2019-11-15 20:54:44,250 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 3 states. Result 45 states and 64 transitions. Complement of second has 7 states. [2019-11-15 20:54:44,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 20:54:44,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:54:44,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2019-11-15 20:54:44,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 20:54:44,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:44,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 20:54:44,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:44,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-15 20:54:44,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:44,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 64 transitions. [2019-11-15 20:54:44,261 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 20:54:44,265 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 15 states and 20 transitions. [2019-11-15 20:54:44,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 20:54:44,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 20:54:44,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2019-11-15 20:54:44,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:54:44,268 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-15 20:54:44,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2019-11-15 20:54:44,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-15 20:54:44,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 20:54:44,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-11-15 20:54:44,304 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-15 20:54:44,305 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-15 20:54:44,305 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 20:54:44,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-11-15 20:54:44,307 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 20:54:44,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:54:44,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:54:44,308 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:44,308 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:54:44,309 INFO L791 eck$LassoCheckResult]: Stem: 149#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 146#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 142#L524 assume !(main_~length1~0 < 1); 143#L524-2 assume !(main_~length2~0 < 1); 136#L527-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 137#L533-3 assume !(main_~i~0 < main_~length1~0 - 1); 150#L533-4 main_~i~1 := 0; 141#L537-3 [2019-11-15 20:54:44,309 INFO L793 eck$LassoCheckResult]: Loop: 141#L537-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 140#L537-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 141#L537-3 [2019-11-15 20:54:44,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:44,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2019-11-15 20:54:44,310 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:44,310 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324924296] [2019-11-15 20:54:44,311 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:44,311 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:44,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:44,357 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:44,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:44,360 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2019-11-15 20:54:44,360 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:44,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195776176] [2019-11-15 20:54:44,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:44,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:44,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:44,373 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:44,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:44,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2019-11-15 20:54:44,374 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:44,374 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238437791] [2019-11-15 20:54:44,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:44,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:44,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:44,398 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:44,611 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:54:44,611 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:54:44,611 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:54:44,612 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:54:44,612 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:54:44,612 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:54:44,612 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:54:44,612 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:54:44,612 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcmp-alloca-1.i_Iteration2_Lasso [2019-11-15 20:54:44,612 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:54:44,612 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:54:44,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:44,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:44,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:44,802 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-15 20:54:44,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:44,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:44,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:44,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:44,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:44,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:44,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:44,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:44,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:44,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:44,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:45,196 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 20:54:45,262 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:54:45,262 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:54:45,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:45,263 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:45,264 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:45,264 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:45,264 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:45,264 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:45,264 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:45,264 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:45,265 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:45,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:45,266 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:45,266 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:45,267 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:45,267 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:45,267 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:45,267 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:45,267 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:45,268 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:45,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:45,269 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:45,269 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:45,269 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:45,269 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:45,270 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:54:45,271 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:54:45,274 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:45,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:45,275 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:45,276 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:45,276 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:45,276 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:45,278 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:54:45,278 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:54:45,302 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:54:45,333 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 20:54:45,333 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 20:54:45,334 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:54:45,335 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:54:45,335 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:54:45,335 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-11-15 20:54:45,350 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 20:54:45,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:45,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:54:45,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:54:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:45,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:54:45,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:54:45,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:45,401 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 20:54:45,401 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-15 20:54:45,430 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 21 states and 30 transitions. Complement of second has 6 states. [2019-11-15 20:54:45,431 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-11-15 20:54:45,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:54:45,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-11-15 20:54:45,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 20:54:45,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:45,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-15 20:54:45,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:45,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-15 20:54:45,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:45,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 30 transitions. [2019-11-15 20:54:45,434 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:54:45,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 22 transitions. [2019-11-15 20:54:45,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 20:54:45,435 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 20:54:45,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-11-15 20:54:45,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:54:45,436 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-15 20:54:45,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-11-15 20:54:45,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-15 20:54:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 20:54:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-11-15 20:54:45,438 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-15 20:54:45,438 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-15 20:54:45,438 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 20:54:45,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-11-15 20:54:45,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:54:45,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:54:45,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:54:45,439 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:45,442 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:54:45,442 INFO L791 eck$LassoCheckResult]: Stem: 258#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 257#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 252#L524 assume !(main_~length1~0 < 1); 253#L524-2 assume !(main_~length2~0 < 1); 246#L527-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 247#L533-3 assume !(main_~i~0 < main_~length1~0 - 1); 261#L533-4 main_~i~1 := 0; 255#L537-3 assume !(main_~i~1 < main_~length2~0 - 1); 256#L537-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~post5.base, cstrcmp_#t~post5.offset, cstrcmp_#t~mem6, cstrcmp_#t~mem3, cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, cstrcmp_#t~mem4, cstrcmp_#t~mem8, cstrcmp_#t~pre7.base, cstrcmp_#t~pre7.offset, cstrcmp_#t~mem9, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset;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; 254#L516-3 [2019-11-15 20:54:45,442 INFO L793 eck$LassoCheckResult]: Loop: 254#L516-3 call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post2.base, 1 + cstrcmp_#t~post2.offset;call cstrcmp_#t~mem4 := read~int(cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, 1); 248#L516-1 assume !!(cstrcmp_#t~mem3 == cstrcmp_#t~mem4);havoc cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~mem4;cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post5.base, 1 + cstrcmp_#t~post5.offset;call cstrcmp_#t~mem6 := read~int(cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset, 1); 249#L517 assume !(0 == cstrcmp_#t~mem6);havoc cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset;havoc cstrcmp_#t~mem6; 254#L516-3 [2019-11-15 20:54:45,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:45,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2019-11-15 20:54:45,443 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:45,443 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806425623] [2019-11-15 20:54:45,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:45,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:45,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:45,498 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:45,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:45,503 INFO L82 PathProgramCache]: Analyzing trace with hash 77620, now seen corresponding path program 1 times [2019-11-15 20:54:45,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:45,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854167547] [2019-11-15 20:54:45,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:45,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:45,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:45,523 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:45,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:45,524 INFO L82 PathProgramCache]: Analyzing trace with hash -296047681, now seen corresponding path program 1 times [2019-11-15 20:54:45,526 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:45,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372248775] [2019-11-15 20:54:45,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:45,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:45,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:45,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:45,727 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372248775] [2019-11-15 20:54:45,728 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:45,728 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:54:45,728 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549155009] [2019-11-15 20:54:45,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:45,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:54:45,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:54:45,862 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 7 states. [2019-11-15 20:54:45,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:45,972 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2019-11-15 20:54:45,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:54:45,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2019-11-15 20:54:45,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:54:45,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 17 states and 22 transitions. [2019-11-15 20:54:45,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 20:54:45,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 20:54:45,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2019-11-15 20:54:45,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:54:45,975 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-11-15 20:54:45,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2019-11-15 20:54:45,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-15 20:54:45,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 20:54:45,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2019-11-15 20:54:45,977 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-15 20:54:45,977 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-15 20:54:45,977 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 20:54:45,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2019-11-15 20:54:45,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:54:45,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:54:45,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:54:45,978 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:45,978 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:54:45,979 INFO L791 eck$LassoCheckResult]: Stem: 315#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 314#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 309#L524 assume !(main_~length1~0 < 1); 310#L524-2 assume !(main_~length2~0 < 1); 303#L527-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 304#L533-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 316#L533-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 317#L533-3 assume !(main_~i~0 < main_~length1~0 - 1); 318#L533-4 main_~i~1 := 0; 312#L537-3 assume !(main_~i~1 < main_~length2~0 - 1); 313#L537-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~post5.base, cstrcmp_#t~post5.offset, cstrcmp_#t~mem6, cstrcmp_#t~mem3, cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, cstrcmp_#t~mem4, cstrcmp_#t~mem8, cstrcmp_#t~pre7.base, cstrcmp_#t~pre7.offset, cstrcmp_#t~mem9, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset;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; 311#L516-3 [2019-11-15 20:54:45,979 INFO L793 eck$LassoCheckResult]: Loop: 311#L516-3 call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post2.base, 1 + cstrcmp_#t~post2.offset;call cstrcmp_#t~mem4 := read~int(cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, 1); 305#L516-1 assume !!(cstrcmp_#t~mem3 == cstrcmp_#t~mem4);havoc cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~mem4;cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post5.base, 1 + cstrcmp_#t~post5.offset;call cstrcmp_#t~mem6 := read~int(cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset, 1); 306#L517 assume !(0 == cstrcmp_#t~mem6);havoc cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset;havoc cstrcmp_#t~mem6; 311#L516-3 [2019-11-15 20:54:45,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:45,979 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2019-11-15 20:54:45,979 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:45,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635490810] [2019-11-15 20:54:45,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:45,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:45,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:46,016 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:46,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:46,016 INFO L82 PathProgramCache]: Analyzing trace with hash 77620, now seen corresponding path program 2 times [2019-11-15 20:54:46,017 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:46,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073261664] [2019-11-15 20:54:46,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:46,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:46,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:46,038 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:46,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:46,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1311502365, now seen corresponding path program 1 times [2019-11-15 20:54:46,038 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:46,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614497869] [2019-11-15 20:54:46,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:46,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:46,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:46,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 20:54:46,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614497869] [2019-11-15 20:54:46,262 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:46,262 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 20:54:46,262 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311238140] [2019-11-15 20:54:46,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:46,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 20:54:46,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:54:46,394 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand 9 states. [2019-11-15 20:54:46,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:46,505 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2019-11-15 20:54:46,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:54:46,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. [2019-11-15 20:54:46,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:54:46,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 21 transitions. [2019-11-15 20:54:46,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 20:54:46,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 20:54:46,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2019-11-15 20:54:46,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:54:46,508 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-15 20:54:46,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2019-11-15 20:54:46,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-15 20:54:46,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 20:54:46,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-11-15 20:54:46,510 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-15 20:54:46,510 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-15 20:54:46,510 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 20:54:46,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2019-11-15 20:54:46,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:54:46,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:54:46,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:54:46,512 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:46,512 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:54:46,512 INFO L791 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 371#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 366#L524 assume !(main_~length1~0 < 1); 367#L524-2 assume !(main_~length2~0 < 1); 360#L527-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 361#L533-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 373#L533-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 374#L533-3 assume !(main_~i~0 < main_~length1~0 - 1); 375#L533-4 main_~i~1 := 0; 369#L537-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 364#L537-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 365#L537-3 assume !(main_~i~1 < main_~length2~0 - 1); 370#L537-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~post5.base, cstrcmp_#t~post5.offset, cstrcmp_#t~mem6, cstrcmp_#t~mem3, cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, cstrcmp_#t~mem4, cstrcmp_#t~mem8, cstrcmp_#t~pre7.base, cstrcmp_#t~pre7.offset, cstrcmp_#t~mem9, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset;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; 368#L516-3 [2019-11-15 20:54:46,512 INFO L793 eck$LassoCheckResult]: Loop: 368#L516-3 call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post2.base, 1 + cstrcmp_#t~post2.offset;call cstrcmp_#t~mem4 := read~int(cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, 1); 362#L516-1 assume !!(cstrcmp_#t~mem3 == cstrcmp_#t~mem4);havoc cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~mem4;cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post5.base, 1 + cstrcmp_#t~post5.offset;call cstrcmp_#t~mem6 := read~int(cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset, 1); 363#L517 assume !(0 == cstrcmp_#t~mem6);havoc cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset;havoc cstrcmp_#t~mem6; 368#L516-3 [2019-11-15 20:54:46,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:46,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2019-11-15 20:54:46,513 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:46,513 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536916308] [2019-11-15 20:54:46,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:46,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:46,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:46,543 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:46,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:46,546 INFO L82 PathProgramCache]: Analyzing trace with hash 77620, now seen corresponding path program 3 times [2019-11-15 20:54:46,546 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:46,546 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408274688] [2019-11-15 20:54:46,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:46,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:46,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:46,574 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:46,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:46,575 INFO L82 PathProgramCache]: Analyzing trace with hash -718433093, now seen corresponding path program 1 times [2019-11-15 20:54:46,575 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:46,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830208668] [2019-11-15 20:54:46,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:46,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:46,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:46,622 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:46,743 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-11-15 20:54:47,113 WARN L191 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 111 [2019-11-15 20:54:47,263 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-11-15 20:54:47,265 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:54:47,265 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:54:47,265 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:54:47,265 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:54:47,266 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:54:47,266 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:54:47,266 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:54:47,266 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:54:47,266 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcmp-alloca-1.i_Iteration5_Lasso [2019-11-15 20:54:47,266 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:54:47,266 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:54:47,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:47,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:47,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:47,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:47,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:47,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:47,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:47,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:47,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:47,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:47,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:47,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:47,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:47,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:47,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:47,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:47,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:47,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:47,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:47,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:47,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:47,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:47,724 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 86 [2019-11-15 20:54:47,885 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-11-15 20:54:47,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:47,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:47,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:47,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:48,469 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-11-15 20:54:48,645 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:54:48,645 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:54:48,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:48,646 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:48,646 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:48,647 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:48,647 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:48,647 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:48,647 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:48,647 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:48,648 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:48,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:48,649 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:48,649 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:48,649 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:48,649 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:48,650 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:48,650 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:48,650 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:48,651 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:48,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:48,651 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:48,651 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:48,652 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:48,652 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:48,652 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:48,652 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:48,652 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:48,652 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:48,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:48,653 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:48,653 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:48,654 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:48,654 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:48,654 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:54:48,654 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:54:48,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:48,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:48,657 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:48,657 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:48,657 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:48,657 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:48,657 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:48,658 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:48,658 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:48,658 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:48,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:48,659 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:48,659 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:48,659 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:48,660 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:48,660 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:48,660 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:48,660 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:48,660 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:48,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:48,661 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:48,661 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:48,662 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:48,662 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:48,662 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:48,662 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:48,662 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:48,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:48,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:48,664 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:48,664 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:48,664 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:48,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:48,664 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:48,665 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:48,665 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:48,665 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:48,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:48,666 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:48,666 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:48,666 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:48,666 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:48,667 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:48,667 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:48,667 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:48,667 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:48,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:48,668 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:48,668 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:48,669 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:48,669 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:48,669 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:48,669 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:48,669 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:48,670 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:48,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:48,671 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:48,671 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:48,671 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:48,671 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:48,671 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:48,671 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:48,672 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:48,672 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:48,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:48,673 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:48,673 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:48,673 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:48,673 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:48,673 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:48,674 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:48,674 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:48,674 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:48,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:48,675 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:48,675 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:48,675 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:48,676 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:48,676 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:48,676 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:48,676 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:48,676 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:48,677 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:48,677 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:48,677 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:48,677 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:48,678 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:48,678 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:48,678 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:48,678 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:48,679 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:48,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:48,679 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:48,680 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:48,680 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:48,680 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:48,681 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:54:48,681 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:54:48,682 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:48,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:48,683 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:48,683 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:48,683 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:48,684 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:48,684 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:48,684 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:48,684 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:48,685 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:48,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:48,685 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:48,686 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:48,686 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:48,686 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:48,687 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:54:48,687 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:54:48,688 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:48,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:48,689 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:48,689 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:48,689 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:48,689 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:48,689 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:48,689 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:48,690 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:48,690 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:48,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:48,691 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:48,691 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:48,691 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:48,691 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:48,692 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:48,692 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:48,692 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:48,693 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:48,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:48,693 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:48,694 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:48,694 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:48,694 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:48,694 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:54:48,695 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:54:48,696 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:48,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:48,696 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:48,697 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:48,697 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:48,697 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:48,697 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:48,697 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:48,697 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:48,699 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:48,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:48,700 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:48,700 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:48,700 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:48,700 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:48,701 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:54:48,701 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:54:48,705 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:48,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-11-15 20:54:48,706 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:48,706 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:48,706 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:48,707 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:48,707 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:54:48,707 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:54:48,709 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:48,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-11-15 20:54:48,710 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:48,710 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 20:54:48,710 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:48,711 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:48,714 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:54:48,714 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:54:48,728 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:48,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:48,729 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:48,730 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:48,730 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:48,730 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:48,731 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:54:48,731 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:54:48,732 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:48,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:48,733 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:48,733 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:48,733 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:48,733 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:48,734 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:54:48,734 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:54:48,738 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:48,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:48,739 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:48,739 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:48,739 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:48,740 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:48,740 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:54:48,740 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:54:48,742 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:48,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:48,743 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:48,743 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:48,743 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:54:48,743 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:48,746 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-15 20:54:48,746 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:54:48,758 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:48,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:48,759 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:48,775 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:48,776 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:48,776 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:48,780 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:54:48,780 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:54:48,889 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:54:49,005 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 20:54:49,013 INFO L444 ModelExtractionUtils]: 39 out of 49 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-11-15 20:54:49,014 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:54:49,015 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:54:49,015 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:54:49,015 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcmp_~s2.offset, v_rep(select #length ULTIMATE.start_cstrcmp_~s2.base)_1) = -1*ULTIMATE.start_cstrcmp_~s2.offset + 1*v_rep(select #length ULTIMATE.start_cstrcmp_~s2.base)_1 Supporting invariants [] [2019-11-15 20:54:49,079 INFO L297 tatePredicateManager]: 22 out of 22 supporting invariants were superfluous and have been removed [2019-11-15 20:54:49,081 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 20:54:49,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:49,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:54:49,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:54:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:49,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 20:54:49,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:54:49,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:49,139 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 20:54:49,139 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-15 20:54:49,148 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 19 states and 23 transitions. Complement of second has 4 states. [2019-11-15 20:54:49,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 20:54:49,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:54:49,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2019-11-15 20:54:49,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 13 letters. Loop has 3 letters. [2019-11-15 20:54:49,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:49,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 16 letters. Loop has 3 letters. [2019-11-15 20:54:49,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:49,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 13 letters. Loop has 6 letters. [2019-11-15 20:54:49,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:49,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2019-11-15 20:54:49,154 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:54:49,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2019-11-15 20:54:49,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 20:54:49,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 20:54:49,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 20:54:49,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:54:49,155 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:54:49,155 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:54:49,155 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:54:49,155 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 20:54:49,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:54:49,155 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:54:49,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 20:54:49,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 08:54:49 BoogieIcfgContainer [2019-11-15 20:54:49,161 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 20:54:49,162 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:54:49,162 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:54:49,162 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:54:49,163 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:54:42" (3/4) ... [2019-11-15 20:54:49,166 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 20:54:49,166 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:54:49,167 INFO L168 Benchmark]: Toolchain (without parser) took 7777.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Free memory was 935.7 MB in the beginning and 984.0 MB in the end (delta: -48.4 MB). Peak memory consumption was 147.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:54:49,168 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:54:49,168 INFO L168 Benchmark]: CACSL2BoogieTranslator took 635.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -190.6 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:54:49,169 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:54:49,169 INFO L168 Benchmark]: Boogie Preprocessor took 46.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:54:49,170 INFO L168 Benchmark]: RCFGBuilder took 365.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:54:49,170 INFO L168 Benchmark]: BuchiAutomizer took 6672.06 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.4 MB). Free memory was 1.1 GB in the beginning and 984.0 MB in the end (delta: 114.5 MB). Peak memory consumption was 166.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:54:49,171 INFO L168 Benchmark]: Witness Printer took 4.09 ms. Allocated memory is still 1.2 GB. Free memory is still 984.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:54:49,174 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 635.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -190.6 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.92 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 365.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6672.06 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.4 MB). Free memory was 1.1 GB in the beginning and 984.0 MB in the end (delta: 114.5 MB). Peak memory consumption was 166.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.09 ms. Allocated memory is still 1.2 GB. Free memory is still 984.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 -1 * s2 + unknown-#length-unknown[s2] 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 6.6s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 5.9s. 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: 70 SDtfs, 117 SDslu, 99 SDs, 0 SdLazy, 99 SolverSat, 21 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 dnf156 smp95 tf100 neg94 sie122 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms 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...