./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcat-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ecf6bc3a-92b4-40c8-9901-c04545e97d31/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ecf6bc3a-92b4-40c8-9901-c04545e97d31/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ecf6bc3a-92b4-40c8-9901-c04545e97d31/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ecf6bc3a-92b4-40c8-9901-c04545e97d31/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcat-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ecf6bc3a-92b4-40c8-9901-c04545e97d31/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ecf6bc3a-92b4-40c8-9901-c04545e97d31/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 cb6ff0b2d9abd29a15d3eb2d5a86a23b460e9725 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 23:05:21,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:05:21,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:05:21,648 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:05:21,649 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:05:21,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:05:21,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:05:21,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:05:21,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:05:21,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:05:21,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:05:21,658 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:05:21,658 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:05:21,659 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:05:21,660 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:05:21,661 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:05:21,662 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:05:21,663 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:05:21,666 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:05:21,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:05:21,669 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:05:21,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:05:21,672 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:05:21,673 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:05:21,675 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:05:21,676 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:05:21,676 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:05:21,677 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:05:21,677 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:05:21,679 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:05:21,679 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:05:21,680 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:05:21,681 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:05:21,681 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:05:21,683 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:05:21,683 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:05:21,684 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:05:21,684 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:05:21,684 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:05:21,686 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:05:21,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:05:21,687 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ecf6bc3a-92b4-40c8-9901-c04545e97d31/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 23:05:21,703 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:05:21,703 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:05:21,704 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:05:21,704 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:05:21,705 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:05:21,705 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:05:21,705 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:05:21,705 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:05:21,706 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:05:21,706 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:05:21,706 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:05:21,706 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:05:21,706 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:05:21,707 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:05:21,707 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:05:21,707 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:05:21,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:05:21,707 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:05:21,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:05:21,708 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:05:21,708 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:05:21,708 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:05:21,708 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:05:21,709 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:05:21,709 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:05:21,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:05:21,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:05:21,710 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:05:21,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:05:21,710 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:05:21,710 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:05:21,711 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:05:21,711 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_ecf6bc3a-92b4-40c8-9901-c04545e97d31/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 -> cb6ff0b2d9abd29a15d3eb2d5a86a23b460e9725 [2019-11-15 23:05:21,736 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:05:21,746 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:05:21,749 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:05:21,751 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:05:21,751 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:05:21,752 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ecf6bc3a-92b4-40c8-9901-c04545e97d31/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrcat-alloca-2.i [2019-11-15 23:05:21,821 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ecf6bc3a-92b4-40c8-9901-c04545e97d31/bin/uautomizer/data/abe016115/0a768ebc691f44d5a9e4de5d95174a6c/FLAG6462819ec [2019-11-15 23:05:22,275 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:05:22,275 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ecf6bc3a-92b4-40c8-9901-c04545e97d31/sv-benchmarks/c/array-memsafety/openbsd_cstrcat-alloca-2.i [2019-11-15 23:05:22,293 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ecf6bc3a-92b4-40c8-9901-c04545e97d31/bin/uautomizer/data/abe016115/0a768ebc691f44d5a9e4de5d95174a6c/FLAG6462819ec [2019-11-15 23:05:22,646 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ecf6bc3a-92b4-40c8-9901-c04545e97d31/bin/uautomizer/data/abe016115/0a768ebc691f44d5a9e4de5d95174a6c [2019-11-15 23:05:22,649 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:05:22,650 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:05:22,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:05:22,655 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:05:22,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:05:22,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:05:22" (1/1) ... [2019-11-15 23:05:22,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ade499c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:05:22, skipping insertion in model container [2019-11-15 23:05:22,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:05:22" (1/1) ... [2019-11-15 23:05:22,669 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:05:22,720 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:05:23,079 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:05:23,090 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:05:23,140 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:05:23,192 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:05:23,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:05:23 WrapperNode [2019-11-15 23:05:23,193 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:05:23,193 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:05:23,194 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:05:23,194 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:05:23,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:05:23" (1/1) ... [2019-11-15 23:05:23,232 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:05:23" (1/1) ... [2019-11-15 23:05:23,256 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:05:23,257 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:05:23,257 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:05:23,257 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:05:23,264 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:05:23" (1/1) ... [2019-11-15 23:05:23,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:05:23" (1/1) ... [2019-11-15 23:05:23,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:05:23" (1/1) ... [2019-11-15 23:05:23,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:05:23" (1/1) ... [2019-11-15 23:05:23,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:05:23" (1/1) ... [2019-11-15 23:05:23,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:05:23" (1/1) ... [2019-11-15 23:05:23,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:05:23" (1/1) ... [2019-11-15 23:05:23,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:05:23,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:05:23,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:05:23,289 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:05:23,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:05:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ecf6bc3a-92b4-40c8-9901-c04545e97d31/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 23:05:23,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:05:23,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:05:23,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:05:23,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:05:23,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:05:23,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:05:23,671 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:05:23,671 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-15 23:05:23,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:05:23 BoogieIcfgContainer [2019-11-15 23:05:23,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:05:23,673 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:05:23,673 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:05:23,676 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:05:23,677 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:05:23,678 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:05:22" (1/3) ... [2019-11-15 23:05:23,678 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30ba250b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:05:23, skipping insertion in model container [2019-11-15 23:05:23,679 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:05:23,679 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:05:23" (2/3) ... [2019-11-15 23:05:23,679 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30ba250b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:05:23, skipping insertion in model container [2019-11-15 23:05:23,679 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:05:23,679 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:05:23" (3/3) ... [2019-11-15 23:05:23,681 INFO L371 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrcat-alloca-2.i [2019-11-15 23:05:23,720 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:05:23,720 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:05:23,720 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:05:23,721 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:05:23,721 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:05:23,721 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:05:23,721 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:05:23,721 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:05:23,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-11-15 23:05:23,756 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2019-11-15 23:05:23,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:05:23,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:05:23,763 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 23:05:23,764 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:05:23,764 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:05:23,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-11-15 23:05:23,766 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2019-11-15 23:05:23,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:05:23,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:05:23,767 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 23:05:23,767 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:05:23,774 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~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 7#L525true assume !(main_~length1~0 < 1); 12#L525-2true assume !(main_~length2~0 < 2); 24#L528-1true assume !(main_~length3~0 < 1); 15#L531-1true assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 9#L538-3true [2019-11-15 23:05:23,775 INFO L793 eck$LassoCheckResult]: Loop: 9#L538-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet13, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 6#L538-2true main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 9#L538-3true [2019-11-15 23:05:23,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:05:23,780 INFO L82 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2019-11-15 23:05:23,786 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:05:23,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62760479] [2019-11-15 23:05:23,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:23,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:23,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:05:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:23,916 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:05:23,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:05:23,918 INFO L82 PathProgramCache]: Analyzing trace with hash 2019, now seen corresponding path program 1 times [2019-11-15 23:05:23,918 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:05:23,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279936036] [2019-11-15 23:05:23,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:23,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:23,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:05:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:23,935 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:05:23,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:05:23,937 INFO L82 PathProgramCache]: Analyzing trace with hash 180553841, now seen corresponding path program 1 times [2019-11-15 23:05:23,937 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:05:23,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515021775] [2019-11-15 23:05:23,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:23,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:23,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:05:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:23,988 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:05:24,284 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-11-15 23:05:24,383 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:05:24,384 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:05:24,384 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:05:24,384 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:05:24,384 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:05:24,385 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:05:24,385 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:05:24,385 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:05:24,385 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcat-alloca-2.i_Iteration1_Lasso [2019-11-15 23:05:24,385 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:05:24,386 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:05:24,410 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 23:05:24,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:05:24,418 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 23:05:24,423 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 23:05:24,427 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 23:05:24,429 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 23:05:24,438 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 23:05:24,443 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 23:05:24,445 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 23:05:24,449 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 23:05:24,454 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 23:05:24,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:05:24,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:05:24,465 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 23:05:24,468 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 23:05:24,629 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-11-15 23:05:24,654 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 23:05:24,657 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 23:05:25,134 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 23:05:25,163 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:05:25,169 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:05:25,172 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 23:05:25,173 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:25,174 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:05:25,175 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:25,175 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:25,175 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:25,177 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:05:25,177 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:05:25,181 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:25,184 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 23:05:25,186 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:25,187 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:05:25,187 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:25,188 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:25,192 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:25,193 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:05:25,193 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:05:25,198 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:25,199 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 23:05:25,200 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:25,200 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:05:25,201 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:25,201 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:25,201 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:25,202 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:05:25,202 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:05:25,211 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:25,214 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 23:05:25,215 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:25,215 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:25,215 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:25,216 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:25,219 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:05:25,219 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:05:25,224 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:25,232 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 23:05:25,233 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:25,234 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:05:25,234 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:25,234 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:25,234 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:25,235 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:05:25,235 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:05:25,236 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:25,237 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 23:05:25,238 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:25,239 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:25,239 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:25,239 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:25,241 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:05:25,242 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:05:25,258 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:25,267 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 23:05:25,268 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:25,268 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:05:25,268 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:25,269 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:25,269 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:25,270 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:05:25,270 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:05:25,271 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:25,272 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 23:05:25,273 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:25,273 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:05:25,273 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:25,273 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:25,274 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:25,274 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:05:25,278 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:05:25,279 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:25,282 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 23:05:25,283 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:25,284 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:25,284 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:25,284 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:25,287 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:05:25,290 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:05:25,294 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:25,296 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 23:05:25,298 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:25,298 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:05:25,299 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:25,299 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:25,300 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:25,300 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:05:25,301 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:05:25,302 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:25,302 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 23:05:25,306 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:25,306 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:05:25,307 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:25,307 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:25,308 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:25,309 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:05:25,315 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:05:25,316 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:25,317 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 23:05:25,317 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:25,318 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:05:25,318 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:25,318 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:25,318 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:25,319 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:05:25,319 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:05:25,320 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:25,322 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 23:05:25,323 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:25,324 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:25,324 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:25,324 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:25,326 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:05:25,329 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:05:25,332 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:25,333 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 23:05:25,334 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:25,335 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:05:25,335 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:25,335 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:25,335 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:25,336 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:05:25,336 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:05:25,337 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:25,338 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 23:05:25,339 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:25,340 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:25,340 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:25,340 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:25,345 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:05:25,347 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:05:25,368 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:25,377 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 23:05:25,378 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:25,378 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:05:25,378 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:25,378 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:25,379 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:25,379 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:05:25,380 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:05:25,383 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:25,383 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 23:05:25,384 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:25,386 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:25,387 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:25,387 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:25,392 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:05:25,392 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:05:25,565 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:05:25,601 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:05:25,601 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:05:25,603 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:05:25,607 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:05:25,607 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:05:25,608 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1 - 1*ULTIMATE.start_main_~nondetString1~0.offset - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-15 23:05:25,630 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 23:05:25,640 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 23:05:25,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:05:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:05:25,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:05:25,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:05:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:05:25,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:05:25,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:05:25,734 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 23:05:25,750 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 23:05:25,752 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 3 states. [2019-11-15 23:05:25,838 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 3 states. Result 55 states and 77 transitions. Complement of second has 7 states. [2019-11-15 23:05:25,840 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 23:05:25,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:05:25,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2019-11-15 23:05:25,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-15 23:05:25,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:05:25,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-15 23:05:25,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:05:25,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-15 23:05:25,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:05:25,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 77 transitions. [2019-11-15 23:05:25,852 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-11-15 23:05:25,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 18 states and 25 transitions. [2019-11-15 23:05:25,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-15 23:05:25,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-15 23:05:25,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-11-15 23:05:25,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:05:25,862 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 23:05:25,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-11-15 23:05:25,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-15 23:05:25,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 23:05:25,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-11-15 23:05:25,893 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 23:05:25,893 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 23:05:25,893 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:05:25,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-11-15 23:05:25,897 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-11-15 23:05:25,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:05:25,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:05:25,898 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:05:25,898 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:05:25,899 INFO L791 eck$LassoCheckResult]: Stem: 166#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 165#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 158#L525 assume !(main_~length1~0 < 1); 159#L525-2 assume !(main_~length2~0 < 2); 164#L528-1 assume !(main_~length3~0 < 1); 167#L531-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 161#L538-3 assume !(main_~i~0 < main_~length1~0 - 1); 162#L538-4 main_~i~1 := 0; 163#L542-3 [2019-11-15 23:05:25,899 INFO L793 eck$LassoCheckResult]: Loop: 163#L542-3 assume !!(main_~i~1 < main_~length3~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 168#L542-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 163#L542-3 [2019-11-15 23:05:25,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:05:25,899 INFO L82 PathProgramCache]: Analyzing trace with hash 180553783, now seen corresponding path program 1 times [2019-11-15 23:05:25,899 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:05:25,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853139363] [2019-11-15 23:05:25,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:25,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:25,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:05:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:25,955 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:05:25,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:05:25,956 INFO L82 PathProgramCache]: Analyzing trace with hash 2467, now seen corresponding path program 1 times [2019-11-15 23:05:25,956 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:05:25,956 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854777100] [2019-11-15 23:05:25,957 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:25,957 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:25,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:05:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:25,973 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:05:25,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:05:25,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1713495129, now seen corresponding path program 1 times [2019-11-15 23:05:25,974 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:05:25,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214349720] [2019-11-15 23:05:25,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:25,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:25,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:05:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:26,056 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:05:26,284 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-11-15 23:05:26,361 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:05:26,361 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:05:26,361 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:05:26,361 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:05:26,361 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:05:26,362 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:05:26,362 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:05:26,362 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:05:26,362 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcat-alloca-2.i_Iteration2_Lasso [2019-11-15 23:05:26,362 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:05:26,362 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:05:26,366 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 23:05:26,369 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 23:05:26,511 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-11-15 23:05:26,532 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 23:05:26,534 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 23:05:26,536 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 23:05:26,537 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 23:05:26,539 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 23:05:26,542 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 23:05:26,544 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 23:05:26,548 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 23:05:26,550 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 23:05:26,552 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 23:05:26,554 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 23:05:26,555 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 23:05:26,557 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 23:05:26,558 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 23:05:26,983 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 23:05:27,040 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:05:27,040 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:05:27,040 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 23:05:27,041 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:27,041 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:05:27,041 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:27,041 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:27,042 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:27,042 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:05:27,042 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:05:27,042 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:27,043 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 23:05:27,043 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:27,043 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:27,043 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:27,044 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:27,045 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:05:27,045 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:05:27,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:27,069 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 23:05:27,070 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:27,070 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:05:27,070 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:27,070 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:27,071 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:27,071 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:05:27,071 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:05:27,072 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:27,072 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 23:05:27,072 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:27,073 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:27,073 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:27,073 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:27,076 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:05:27,076 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:05:27,118 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:05:27,157 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 23:05:27,158 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 23:05:27,158 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:05:27,160 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:05:27,160 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:05:27,160 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~length3~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~length3~0 Supporting invariants [] [2019-11-15 23:05:27,175 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 23:05:27,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:05:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:05:27,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:05:27,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:05:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:05:27,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:05:27,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:05:27,224 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 23:05:27,225 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 23:05:27,225 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 23:05:27,250 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 26 states and 38 transitions. Complement of second has 6 states. [2019-11-15 23:05:27,252 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 23:05:27,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:05:27,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-11-15 23:05:27,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-15 23:05:27,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:05:27,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-15 23:05:27,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:05:27,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 8 letters. Loop has 4 letters. [2019-11-15 23:05:27,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:05:27,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 38 transitions. [2019-11-15 23:05:27,255 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 23:05:27,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 19 states and 27 transitions. [2019-11-15 23:05:27,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 23:05:27,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-15 23:05:27,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 27 transitions. [2019-11-15 23:05:27,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:05:27,256 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-11-15 23:05:27,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 27 transitions. [2019-11-15 23:05:27,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-15 23:05:27,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 23:05:27,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2019-11-15 23:05:27,263 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-11-15 23:05:27,263 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-11-15 23:05:27,263 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:05:27,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2019-11-15 23:05:27,264 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 23:05:27,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:05:27,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:05:27,265 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:05:27,265 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:05:27,266 INFO L791 eck$LassoCheckResult]: Stem: 287#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 286#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 279#L525 assume !(main_~length1~0 < 1); 280#L525-2 assume !(main_~length2~0 < 2); 285#L528-1 assume !(main_~length3~0 < 1); 288#L531-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 282#L538-3 assume !(main_~i~0 < main_~length1~0 - 1); 283#L538-4 main_~i~1 := 0; 284#L542-3 assume !(main_~i~1 < main_~length3~0 - 1); 291#L542-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1), 1);cstrcat_#in~s.base, cstrcat_#in~s.offset, cstrcat_#in~append.base, cstrcat_#in~append.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset, cstrcat_#t~mem3, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s.base, cstrcat_~s.offset, cstrcat_~append.base, cstrcat_~append.offset, cstrcat_~save~0.base, cstrcat_~save~0.offset;cstrcat_~s.base, cstrcat_~s.offset := cstrcat_#in~s.base, cstrcat_#in~s.offset;cstrcat_~append.base, cstrcat_~append.offset := cstrcat_#in~append.base, cstrcat_#in~append.offset;cstrcat_~save~0.base, cstrcat_~save~0.offset := cstrcat_~s.base, cstrcat_~s.offset; 281#L517-4 [2019-11-15 23:05:27,266 INFO L793 eck$LassoCheckResult]: Loop: 281#L517-4 call cstrcat_#t~mem3 := read~int(cstrcat_~s.base, cstrcat_~s.offset, 1); 273#L517-1 assume !!(0 != cstrcat_#t~mem3);havoc cstrcat_#t~mem3; 275#L517-3 cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset := cstrcat_~s.base, 1 + cstrcat_~s.offset;cstrcat_~s.base, cstrcat_~s.offset := cstrcat_~s.base, 1 + cstrcat_~s.offset;havoc cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset; 281#L517-4 [2019-11-15 23:05:27,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:05:27,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1713495071, now seen corresponding path program 1 times [2019-11-15 23:05:27,267 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:05:27,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683779483] [2019-11-15 23:05:27,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:27,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:27,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:05:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:27,312 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:05:27,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:05:27,314 INFO L82 PathProgramCache]: Analyzing trace with hash 86554, now seen corresponding path program 1 times [2019-11-15 23:05:27,314 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:05:27,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310400514] [2019-11-15 23:05:27,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:27,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:27,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:05:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:27,325 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:05:27,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:05:27,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1045403964, now seen corresponding path program 1 times [2019-11-15 23:05:27,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:05:27,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527904333] [2019-11-15 23:05:27,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:27,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:27,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:05:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:05:27,501 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 23:05:27,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527904333] [2019-11-15 23:05:27,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:05:27,502 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:05:27,503 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78758778] [2019-11-15 23:05:27,536 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:05:27,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:05:27,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:05:27,539 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. cyclomatic complexity: 12 Second operand 8 states. [2019-11-15 23:05:27,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:05:27,636 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-11-15 23:05:27,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:05:27,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2019-11-15 23:05:27,639 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-11-15 23:05:27,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 34 transitions. [2019-11-15 23:05:27,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-15 23:05:27,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-15 23:05:27,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2019-11-15 23:05:27,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:05:27,640 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-11-15 23:05:27,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2019-11-15 23:05:27,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2019-11-15 23:05:27,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 23:05:27,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2019-11-15 23:05:27,642 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-11-15 23:05:27,644 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-11-15 23:05:27,644 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:05:27,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2019-11-15 23:05:27,645 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 23:05:27,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:05:27,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:05:27,646 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:05:27,646 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:05:27,646 INFO L791 eck$LassoCheckResult]: Stem: 350#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 349#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 340#L525 assume !(main_~length1~0 < 1); 341#L525-2 assume !(main_~length2~0 < 2); 348#L528-1 assume !(main_~length3~0 < 1); 351#L531-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 344#L538-3 assume !(main_~i~0 < main_~length1~0 - 1); 345#L538-4 main_~i~1 := 0; 347#L542-3 assume !(main_~i~1 < main_~length3~0 - 1); 354#L542-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1), 1);cstrcat_#in~s.base, cstrcat_#in~s.offset, cstrcat_#in~append.base, cstrcat_#in~append.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset, cstrcat_#t~mem3, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s.base, cstrcat_~s.offset, cstrcat_~append.base, cstrcat_~append.offset, cstrcat_~save~0.base, cstrcat_~save~0.offset;cstrcat_~s.base, cstrcat_~s.offset := cstrcat_#in~s.base, cstrcat_#in~s.offset;cstrcat_~append.base, cstrcat_~append.offset := cstrcat_#in~append.base, cstrcat_#in~append.offset;cstrcat_~save~0.base, cstrcat_~save~0.offset := cstrcat_~s.base, cstrcat_~s.offset; 346#L517-4 call cstrcat_#t~mem3 := read~int(cstrcat_~s.base, cstrcat_~s.offset, 1); 335#L517-1 assume !(0 != cstrcat_#t~mem3);havoc cstrcat_#t~mem3; 336#L518-2 [2019-11-15 23:05:27,646 INFO L793 eck$LassoCheckResult]: Loop: 336#L518-2 cstrcat_#t~post4.base, cstrcat_#t~post4.offset := cstrcat_~s.base, cstrcat_~s.offset;cstrcat_~s.base, cstrcat_~s.offset := cstrcat_#t~post4.base, 1 + cstrcat_#t~post4.offset;cstrcat_#t~post5.base, cstrcat_#t~post5.offset := cstrcat_~append.base, cstrcat_~append.offset;cstrcat_~append.base, cstrcat_~append.offset := cstrcat_#t~post5.base, 1 + cstrcat_#t~post5.offset;call cstrcat_#t~mem6 := read~int(cstrcat_#t~post5.base, cstrcat_#t~post5.offset, 1);call write~int(cstrcat_#t~mem6, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, 1); 337#L518 assume !!(0 != cstrcat_#t~mem6);havoc cstrcat_#t~mem6;havoc cstrcat_#t~post5.base, cstrcat_#t~post5.offset;havoc cstrcat_#t~post4.base, cstrcat_#t~post4.offset; 336#L518-2 [2019-11-15 23:05:27,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:05:27,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1696290690, now seen corresponding path program 1 times [2019-11-15 23:05:27,647 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:05:27,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091438855] [2019-11-15 23:05:27,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:27,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:27,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:05:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:27,666 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:05:27,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:05:27,666 INFO L82 PathProgramCache]: Analyzing trace with hash 3238, now seen corresponding path program 1 times [2019-11-15 23:05:27,666 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:05:27,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741268878] [2019-11-15 23:05:27,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:27,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:27,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:05:27,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:27,674 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:05:27,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:05:27,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1952217113, now seen corresponding path program 1 times [2019-11-15 23:05:27,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:05:27,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333436921] [2019-11-15 23:05:27,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:27,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:27,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:05:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:05:27,796 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 23:05:27,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333436921] [2019-11-15 23:05:27,796 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:05:27,796 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:05:27,796 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500609288] [2019-11-15 23:05:27,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:05:27,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:05:27,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:05:27,901 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-15 23:05:28,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:05:28,007 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2019-11-15 23:05:28,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:05:28,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 46 transitions. [2019-11-15 23:05:28,009 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-15 23:05:28,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 31 states and 40 transitions. [2019-11-15 23:05:28,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-15 23:05:28,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-15 23:05:28,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2019-11-15 23:05:28,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:05:28,011 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-11-15 23:05:28,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2019-11-15 23:05:28,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-11-15 23:05:28,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-15 23:05:28,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2019-11-15 23:05:28,013 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-11-15 23:05:28,013 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-11-15 23:05:28,014 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:05:28,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2019-11-15 23:05:28,015 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-15 23:05:28,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:05:28,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:05:28,015 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:05:28,016 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:05:28,016 INFO L791 eck$LassoCheckResult]: Stem: 427#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 426#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 415#L525 assume !(main_~length1~0 < 1); 416#L525-2 assume !(main_~length2~0 < 2); 425#L528-1 assume !(main_~length3~0 < 1); 428#L531-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 419#L538-3 assume !(main_~i~0 < main_~length1~0 - 1); 420#L538-4 main_~i~1 := 0; 438#L542-3 assume !!(main_~i~1 < main_~length3~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 436#L542-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 435#L542-3 assume !(main_~i~1 < main_~length3~0 - 1); 434#L542-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1), 1);cstrcat_#in~s.base, cstrcat_#in~s.offset, cstrcat_#in~append.base, cstrcat_#in~append.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset, cstrcat_#t~mem3, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s.base, cstrcat_~s.offset, cstrcat_~append.base, cstrcat_~append.offset, cstrcat_~save~0.base, cstrcat_~save~0.offset;cstrcat_~s.base, cstrcat_~s.offset := cstrcat_#in~s.base, cstrcat_#in~s.offset;cstrcat_~append.base, cstrcat_~append.offset := cstrcat_#in~append.base, cstrcat_#in~append.offset;cstrcat_~save~0.base, cstrcat_~save~0.offset := cstrcat_~s.base, cstrcat_~s.offset; 433#L517-4 [2019-11-15 23:05:28,016 INFO L793 eck$LassoCheckResult]: Loop: 433#L517-4 call cstrcat_#t~mem3 := read~int(cstrcat_~s.base, cstrcat_~s.offset, 1); 409#L517-1 assume !!(0 != cstrcat_#t~mem3);havoc cstrcat_#t~mem3; 410#L517-3 cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset := cstrcat_~s.base, 1 + cstrcat_~s.offset;cstrcat_~s.base, cstrcat_~s.offset := cstrcat_~s.base, 1 + cstrcat_~s.offset;havoc cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset; 433#L517-4 [2019-11-15 23:05:28,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:05:28,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1696346049, now seen corresponding path program 1 times [2019-11-15 23:05:28,017 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:05:28,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830439624] [2019-11-15 23:05:28,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:28,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:28,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:05:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:28,036 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:05:28,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:05:28,037 INFO L82 PathProgramCache]: Analyzing trace with hash 86554, now seen corresponding path program 2 times [2019-11-15 23:05:28,037 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:05:28,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772929269] [2019-11-15 23:05:28,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:28,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:28,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:05:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:28,043 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:05:28,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:05:28,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1259997786, now seen corresponding path program 1 times [2019-11-15 23:05:28,044 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:05:28,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491781567] [2019-11-15 23:05:28,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:28,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:28,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:05:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:28,065 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:05:28,547 WARN L191 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 113 [2019-11-15 23:05:28,708 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-11-15 23:05:28,710 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:05:28,711 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:05:28,711 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:05:28,711 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:05:28,711 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:05:28,711 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:05:28,711 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:05:28,711 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:05:28,711 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcat-alloca-2.i_Iteration5_Lasso [2019-11-15 23:05:28,711 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:05:28,711 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:05:28,715 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 23:05:28,725 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 23:05:28,727 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 23:05:28,729 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 23:05:28,731 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 23:05:29,066 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-11-15 23:05:29,163 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 23:05:29,166 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 23:05:29,167 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 23:05:29,169 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 23:05:29,171 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 23:05:29,173 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 23:05:29,174 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 23:05:29,175 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 23:05:29,177 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 23:05:29,178 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 23:05:29,179 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 23:05:29,181 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 23:05:29,184 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 23:05:29,185 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 23:05:29,188 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 23:05:29,189 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 23:05:29,191 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 23:05:29,193 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 23:05:29,195 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 23:05:29,196 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 23:05:29,198 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 23:05:29,199 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 23:05:29,341 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-15 23:05:29,954 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-15 23:05:30,006 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:05:30,007 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:05:30,007 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 23:05:30,008 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:30,008 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:30,008 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:30,008 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:30,009 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:05:30,009 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:05:30,011 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:30,011 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 23:05:30,012 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:30,012 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:05:30,012 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:30,012 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:30,013 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:30,013 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:05:30,013 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:05:30,013 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:30,014 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 23:05:30,014 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:30,014 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:05:30,015 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:30,015 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:30,015 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:30,015 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:05:30,015 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:05:30,016 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:30,016 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 23:05:30,017 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:30,017 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:05:30,017 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:30,017 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:30,017 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:30,018 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:05:30,018 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:05:30,018 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:30,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:05:30,019 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:30,019 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:30,020 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:30,020 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:30,024 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:05:30,024 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:05:30,052 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:05:30,081 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 23:05:30,081 INFO L444 ModelExtractionUtils]: 46 out of 52 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 23:05:30,082 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:05:30,083 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:05:30,083 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:05:30,083 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcat_~s.offset, v_rep(select #length ULTIMATE.start_cstrcat_~s.base)_1) = -1*ULTIMATE.start_cstrcat_~s.offset + 1*v_rep(select #length ULTIMATE.start_cstrcat_~s.base)_1 Supporting invariants [] [2019-11-15 23:05:30,121 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2019-11-15 23:05:30,122 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 23:05:30,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:05:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:05:30,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:05:30,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:05:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:05:30,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:05:30,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:05:30,175 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 23:05:30,175 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 23:05:30,175 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 15 Second operand 3 states. [2019-11-15 23:05:30,193 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 15. Second operand 3 states. Result 40 states and 52 transitions. Complement of second has 6 states. [2019-11-15 23:05:30,193 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 23:05:30,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:05:30,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2019-11-15 23:05:30,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 12 letters. Loop has 3 letters. [2019-11-15 23:05:30,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:05:30,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 23:05:30,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:05:30,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 12 letters. Loop has 6 letters. [2019-11-15 23:05:30,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:05:30,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 52 transitions. [2019-11-15 23:05:30,196 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:05:30,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2019-11-15 23:05:30,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:05:30,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:05:30,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:05:30,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:05:30,197 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:05:30,197 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:05:30,197 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:05:30,197 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:05:30,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:05:30,197 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:05:30,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:05:30,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:05:30 BoogieIcfgContainer [2019-11-15 23:05:30,203 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:05:30,203 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:05:30,203 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:05:30,203 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:05:30,204 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:05:23" (3/4) ... [2019-11-15 23:05:30,207 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:05:30,207 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:05:30,209 INFO L168 Benchmark]: Toolchain (without parser) took 7558.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.6 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -145.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:05:30,209 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:05:30,210 INFO L168 Benchmark]: CACSL2BoogieTranslator took 542.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:05:30,210 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.01 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 23:05:30,211 INFO L168 Benchmark]: Boogie Preprocessor took 32.18 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:05:30,212 INFO L168 Benchmark]: RCFGBuilder took 383.46 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 23:05:30,212 INFO L168 Benchmark]: BuchiAutomizer took 6529.85 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -1.2 MB). Peak memory consumption was 55.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:05:30,213 INFO L168 Benchmark]: Witness Printer took 4.46 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 23:05:30,215 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 542.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.01 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 32.18 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 383.46 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 6529.85 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -1.2 MB). Peak memory consumption was 55.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.46 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[nondetString1] + -1 * nondetString1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * i + length3 and consists of 4 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.4s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 5.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 30 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 93 SDtfs, 170 SDslu, 126 SDs, 0 SdLazy, 101 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital180 mio100 ax110 hnf98 lsp83 ukn77 mio100 lsp57 div100 bol100 ite100 ukn100 eq167 hnf90 smp97 dnf146 smp95 tf100 neg94 sie122 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...