./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/cstrcmp-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_54cdc51c-8ed6-4d79-908c-4b7044507d40/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_54cdc51c-8ed6-4d79-908c-4b7044507d40/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_54cdc51c-8ed6-4d79-908c-4b7044507d40/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_54cdc51c-8ed6-4d79-908c-4b7044507d40/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/cstrcmp-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_54cdc51c-8ed6-4d79-908c-4b7044507d40/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_54cdc51c-8ed6-4d79-908c-4b7044507d40/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a25db066a60bbc1bb3542b52091e202af08e4b7e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:01:00,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:01:00,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:01:00,683 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:01:00,684 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:01:00,686 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:01:00,687 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:01:00,689 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:01:00,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:01:00,695 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:01:00,697 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:01:00,699 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:01:00,705 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:01:00,706 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:01:00,707 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:01:00,708 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:01:00,709 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:01:00,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:01:00,713 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:01:00,715 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:01:00,716 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:01:00,717 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:01:00,718 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:01:00,719 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:01:00,721 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:01:00,721 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:01:00,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:01:00,722 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:01:00,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:01:00,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:01:00,724 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:01:00,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:01:00,725 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:01:00,726 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:01:00,727 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:01:00,727 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:01:00,728 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:01:00,728 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:01:00,728 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:01:00,729 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:01:00,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:01:00,730 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_54cdc51c-8ed6-4d79-908c-4b7044507d40/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 09:01:00,743 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:01:00,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:01:00,745 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:01:00,745 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:01:00,745 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:01:00,745 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:01:00,746 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:01:00,746 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:01:00,746 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:01:00,746 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:01:00,747 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:01:00,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:01:00,747 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:01:00,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:01:00,747 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:01:00,748 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:01:00,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:01:00,748 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:01:00,748 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:01:00,748 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:01:00,749 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:01:00,749 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:01:00,749 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:01:00,749 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:01:00,750 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:01:00,750 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:01:00,750 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:01:00,751 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:01:00,751 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:01:00,752 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_54cdc51c-8ed6-4d79-908c-4b7044507d40/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a25db066a60bbc1bb3542b52091e202af08e4b7e [2019-10-22 09:01:00,779 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:01:00,791 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:01:00,795 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:01:00,797 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:01:00,797 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:01:00,798 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_54cdc51c-8ed6-4d79-908c-4b7044507d40/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/cstrcmp-alloca-1.i [2019-10-22 09:01:00,854 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_54cdc51c-8ed6-4d79-908c-4b7044507d40/bin/uautomizer/data/ed40fc167/c6811e76bab440af807b7b6dd05c7884/FLAGbdfbe11e7 [2019-10-22 09:01:01,342 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:01:01,342 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_54cdc51c-8ed6-4d79-908c-4b7044507d40/sv-benchmarks/c/termination-memory-alloca/cstrcmp-alloca-1.i [2019-10-22 09:01:01,358 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_54cdc51c-8ed6-4d79-908c-4b7044507d40/bin/uautomizer/data/ed40fc167/c6811e76bab440af807b7b6dd05c7884/FLAGbdfbe11e7 [2019-10-22 09:01:01,697 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_54cdc51c-8ed6-4d79-908c-4b7044507d40/bin/uautomizer/data/ed40fc167/c6811e76bab440af807b7b6dd05c7884 [2019-10-22 09:01:01,700 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:01:01,702 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:01:01,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:01,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:01:01,707 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:01:01,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:01" (1/1) ... [2019-10-22 09:01:01,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@264ff499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:01, skipping insertion in model container [2019-10-22 09:01:01,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:01" (1/1) ... [2019-10-22 09:01:01,720 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:01:01,769 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:01:02,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:02,172 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:01:02,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:02,299 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:01:02,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:02 WrapperNode [2019-10-22 09:01:02,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:02,300 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:02,301 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:01:02,301 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:01:02,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:02" (1/1) ... [2019-10-22 09:01:02,331 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:02" (1/1) ... [2019-10-22 09:01:02,352 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:02,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:01:02,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:01:02,353 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:01:02,363 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:02" (1/1) ... [2019-10-22 09:01:02,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:02" (1/1) ... [2019-10-22 09:01:02,367 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:02" (1/1) ... [2019-10-22 09:01:02,367 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:02" (1/1) ... [2019-10-22 09:01:02,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:02" (1/1) ... [2019-10-22 09:01:02,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:02" (1/1) ... [2019-10-22 09:01:02,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:02" (1/1) ... [2019-10-22 09:01:02,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:01:02,395 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:01:02,395 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:01:02,395 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:01:02,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54cdc51c-8ed6-4d79-908c-4b7044507d40/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:02,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:01:02,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:01:02,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:01:02,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:01:02,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:01:02,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:01:02,682 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:01:02,682 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 09:01:02,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:02 BoogieIcfgContainer [2019-10-22 09:01:02,684 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:01:02,684 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:01:02,684 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:01:02,688 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:01:02,689 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:02,689 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:01:01" (1/3) ... [2019-10-22 09:01:02,690 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a905d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:01:02, skipping insertion in model container [2019-10-22 09:01:02,691 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:02,691 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:02" (2/3) ... [2019-10-22 09:01:02,691 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a905d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:01:02, skipping insertion in model container [2019-10-22 09:01:02,691 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:02,691 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:02" (3/3) ... [2019-10-22 09:01:02,693 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrcmp-alloca-1.i [2019-10-22 09:01:02,746 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:01:02,755 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:01:02,755 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:01:02,755 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:01:02,755 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:01:02,755 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:01:02,755 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:01:02,756 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:01:02,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-10-22 09:01:02,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:01:02,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:02,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:02,833 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:01:02,833 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:01:02,834 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:01:02,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-10-22 09:01:02,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:01:02,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:02,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:02,836 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:01:02,836 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:01:02,845 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 13#L561true assume !(main_~length1~0 < 1); 17#L561-2true assume !(main_~length2~0 < 1); 11#L564-1true call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset, cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset, cstrcmp_#t~mem2, cstrcmp_#t~mem3, cstrcmp_#t~mem4, cstrcmp_#t~short5, cstrcmp_#t~mem8, cstrcmp_#t~mem9, cstrcmp_#t~ite10, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 5#L550-5true [2019-10-22 09:01:02,845 INFO L793 eck$LassoCheckResult]: Loop: 5#L550-5true call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short5 := 0 != cstrcmp_#t~mem2; 16#L550-1true assume cstrcmp_#t~short5;call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem4 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short5 := cstrcmp_#t~mem3 == cstrcmp_#t~mem4; 3#L550-3true assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~short5;havoc cstrcmp_#t~mem2;cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post6.base, 1 + cstrcmp_#t~post6.offset;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset;cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post7.base, 1 + cstrcmp_#t~post7.offset;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset; 5#L550-5true [2019-10-22 09:01:02,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:02,853 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-10-22 09:01:02,864 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:02,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713422754] [2019-10-22 09:01:02,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:02,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:02,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:03,067 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:03,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:03,069 INFO L82 PathProgramCache]: Analyzing trace with hash 49755, now seen corresponding path program 1 times [2019-10-22 09:01:03,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:03,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486161329] [2019-10-22 09:01:03,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:03,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:03,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:03,105 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:03,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:03,107 INFO L82 PathProgramCache]: Analyzing trace with hash 180429558, now seen corresponding path program 1 times [2019-10-22 09:01:03,108 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:03,108 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986475377] [2019-10-22 09:01:03,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:03,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:03,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:03,198 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:03,387 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-10-22 09:01:03,757 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-10-22 09:01:03,896 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-10-22 09:01:03,910 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:03,911 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:03,911 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:03,911 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:03,911 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:03,911 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:03,912 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:03,912 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:03,912 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcmp-alloca-1.i_Iteration1_Lasso [2019-10-22 09:01:03,912 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:03,912 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:03,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:03,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:03,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:03,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:03,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:03,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:03,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:03,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:03,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:03,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:04,366 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-10-22 09:01:04,529 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-10-22 09:01:04,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:04,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:04,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:04,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-10-22 09:01:04,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-10-22 09:01:04,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-10-22 09:01:04,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:04,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:04,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:04,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:04,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:04,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:04,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:04,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:05,289 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-10-22 09:01:05,475 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:05,488 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:05,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:05,492 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:05,492 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:05,493 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:05,493 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:05,493 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:05,495 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:05,495 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:05,497 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:05,497 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:05,502 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:05,502 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:05,503 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:05,503 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:05,503 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:05,503 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:05,504 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:05,505 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:05,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:05,506 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:05,506 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:05,506 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:05,506 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:05,506 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:05,507 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:05,507 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:05,508 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:05,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:05,509 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:05,524 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:05,524 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:05,524 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:05,527 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:05,527 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:05,532 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:05,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:05,534 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:05,534 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:05,534 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:05,535 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:05,535 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:05,536 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:05,536 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:05,538 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:05,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:05,539 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:05,539 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:05,540 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:05,540 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:05,540 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:05,540 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:05,541 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:05,541 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:05,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:05,547 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:05,547 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:05,547 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:05,547 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:05,549 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:05,549 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:05,556 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:05,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:05,557 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:05,561 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:05,561 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:05,561 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:05,563 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:05,563 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:05,567 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:05,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:05,568 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:05,568 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:05,569 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:05,569 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:05,569 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:05,569 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:05,578 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:05,579 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:05,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:05,580 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:05,580 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:05,581 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:05,581 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:05,591 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:05,591 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:05,612 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:05,612 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:05,613 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:05,613 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:05,613 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:05,614 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:05,615 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:05,615 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:05,618 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:05,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:05,619 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:05,619 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 09:01:05,620 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:05,620 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:05,627 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:01:05,627 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:05,698 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:05,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:05,699 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:05,700 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:05,700 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:05,700 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:05,700 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:05,701 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:05,701 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:05,709 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:05,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:05,718 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:05,718 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:05,719 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:05,719 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:05,723 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:05,724 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:05,784 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:05,823 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:01:05,825 INFO L444 ModelExtractionUtils]: 42 out of 46 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:01:05,828 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:05,830 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:01:05,833 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:05,833 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcmp_~s2.base)_1, ULTIMATE.start_cstrcmp_~s2.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcmp_~s2.base)_1 - 1*ULTIMATE.start_cstrcmp_~s2.offset Supporting invariants [] [2019-10-22 09:01:05,878 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2019-10-22 09:01:05,887 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:01:05,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:05,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:05,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:05,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:05,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:01:05,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:05,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:05,978 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:01:05,979 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 4 states. [2019-10-22 09:01:06,032 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 4 states. Result 39 states and 52 transitions. Complement of second has 7 states. [2019-10-22 09:01:06,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:06,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:01:06,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2019-10-22 09:01:06,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 5 letters. Loop has 3 letters. [2019-10-22 09:01:06,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:06,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 8 letters. Loop has 3 letters. [2019-10-22 09:01:06,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:06,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 5 letters. Loop has 6 letters. [2019-10-22 09:01:06,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:06,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 52 transitions. [2019-10-22 09:01:06,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:01:06,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 15 states and 20 transitions. [2019-10-22 09:01:06,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 09:01:06,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 09:01:06,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2019-10-22 09:01:06,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:06,049 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-10-22 09:01:06,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2019-10-22 09:01:06,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-10-22 09:01:06,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-22 09:01:06,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-10-22 09:01:06,077 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-10-22 09:01:06,077 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-10-22 09:01:06,077 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:01:06,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-10-22 09:01:06,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:01:06,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:06,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:06,079 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:01:06,079 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:01:06,079 INFO L791 eck$LassoCheckResult]: Stem: 175#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 169#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 170#L561 assume !(main_~length1~0 < 1); 180#L561-2 assume !(main_~length2~0 < 1); 176#L564-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset, cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset, cstrcmp_#t~mem2, cstrcmp_#t~mem3, cstrcmp_#t~mem4, cstrcmp_#t~short5, cstrcmp_#t~mem8, cstrcmp_#t~mem9, cstrcmp_#t~ite10, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 177#L550-5 call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short5 := 0 != cstrcmp_#t~mem2; 178#L550-1 [2019-10-22 09:01:06,079 INFO L793 eck$LassoCheckResult]: Loop: 178#L550-1 assume !cstrcmp_#t~short5; 171#L550-3 assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~short5;havoc cstrcmp_#t~mem2;cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post6.base, 1 + cstrcmp_#t~post6.offset;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset;cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post7.base, 1 + cstrcmp_#t~post7.offset;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset; 172#L550-5 call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short5 := 0 != cstrcmp_#t~mem2; 178#L550-1 [2019-10-22 09:01:06,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:06,080 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 1 times [2019-10-22 09:01:06,080 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:06,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109075564] [2019-10-22 09:01:06,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:06,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:06,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:06,106 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:06,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:06,107 INFO L82 PathProgramCache]: Analyzing trace with hash 54797, now seen corresponding path program 1 times [2019-10-22 09:01:06,107 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:06,107 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341415408] [2019-10-22 09:01:06,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:06,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:06,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:06,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:06,130 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341415408] [2019-10-22 09:01:06,131 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:06,131 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:06,131 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332488692] [2019-10-22 09:01:06,133 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:06,134 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:06,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:06,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:06,137 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-10-22 09:01:06,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:06,149 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2019-10-22 09:01:06,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:06,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 15 transitions. [2019-10-22 09:01:06,153 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:01:06,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2019-10-22 09:01:06,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:01:06,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:01:06,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:01:06,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:06,154 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:06,154 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:06,154 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:06,154 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:01:06,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:01:06,154 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:01:06,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:01:06,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:01:06 BoogieIcfgContainer [2019-10-22 09:01:06,162 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:01:06,163 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:01:06,164 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:01:06,164 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:01:06,165 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:02" (3/4) ... [2019-10-22 09:01:06,168 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:01:06,169 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:01:06,174 INFO L168 Benchmark]: Toolchain (without parser) took 4468.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.7 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -112.3 MB). Peak memory consumption was 97.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:06,175 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:06,176 INFO L168 Benchmark]: CACSL2BoogieTranslator took 596.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -182.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:06,177 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.48 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:06,177 INFO L168 Benchmark]: Boogie Preprocessor took 42.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:06,178 INFO L168 Benchmark]: RCFGBuilder took 289.22 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: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:06,179 INFO L168 Benchmark]: BuchiAutomizer took 3477.83 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.0 MB). Peak memory consumption was 100.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:06,180 INFO L168 Benchmark]: Witness Printer took 6.19 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: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:06,183 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 596.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -182.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.48 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 289.22 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: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3477.83 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.0 MB). Peak memory consumption was 100.0 MB. Max. memory is 11.5 GB. * Witness Printer took 6.19 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: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[s2] + -1 * s2 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 26 SDtfs, 17 SDslu, 16 SDs, 0 SdLazy, 14 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital214 mio100 ax108 hnf99 lsp89 ukn85 mio100 lsp46 div100 bol100 ite100 ukn100 eq195 hnf88 smp100 dnf171 smp97 tf100 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 79ms VariablesStem: 9 VariablesLoop: 8 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...