./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrcmp_mixed_alloca.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_5d99d602-7525-493e-bd40-6a13b36b8c5c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5d99d602-7525-493e-bd40-6a13b36b8c5c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5d99d602-7525-493e-bd40-6a13b36b8c5c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5d99d602-7525-493e-bd40-6a13b36b8c5c/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrcmp_mixed_alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5d99d602-7525-493e-bd40-6a13b36b8c5c/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5d99d602-7525-493e-bd40-6a13b36b8c5c/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 051dd1d5deb7603ef8d45e2ac843d269d4cbaf6c .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:58:36,661 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:58:36,662 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:58:36,671 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:58:36,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:58:36,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:58:36,673 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:58:36,674 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:58:36,676 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:58:36,676 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:58:36,677 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:58:36,678 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:58:36,678 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:58:36,679 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:58:36,680 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:58:36,680 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:58:36,681 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:58:36,681 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:58:36,683 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:58:36,684 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:58:36,685 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:58:36,686 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:58:36,687 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:58:36,688 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:58:36,689 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:58:36,690 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:58:36,690 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:58:36,691 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:58:36,691 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:58:36,695 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:58:36,695 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:58:36,696 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:58:36,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:58:36,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:58:36,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:58:36,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:58:36,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:58:36,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:58:36,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:58:36,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:58:36,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:58:36,700 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5d99d602-7525-493e-bd40-6a13b36b8c5c/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:58:36,711 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:58:36,711 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:58:36,712 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:58:36,713 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:58:36,713 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:58:36,713 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:58:36,713 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:58:36,713 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:58:36,713 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:58:36,713 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:58:36,714 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:58:36,714 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:58:36,714 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:58:36,714 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:58:36,714 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:58:36,715 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:58:36,715 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:58:36,715 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:58:36,715 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:58:36,715 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:58:36,716 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:58:36,716 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:58:36,716 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:58:36,716 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:58:36,716 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:58:36,716 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:58:36,717 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:58:36,717 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:58:36,717 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:58:36,718 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_5d99d602-7525-493e-bd40-6a13b36b8c5c/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 -> 051dd1d5deb7603ef8d45e2ac843d269d4cbaf6c [2019-10-22 08:58:36,746 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:58:36,755 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:58:36,759 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:58:36,760 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:58:36,760 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:58:36,761 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5d99d602-7525-493e-bd40-6a13b36b8c5c/bin/uautomizer/../../sv-benchmarks/c/termination-15/cstrcmp_mixed_alloca.i [2019-10-22 08:58:36,817 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5d99d602-7525-493e-bd40-6a13b36b8c5c/bin/uautomizer/data/137c05445/80a2f8d309914764808133ba956d6d2e/FLAG31aaf2822 [2019-10-22 08:58:37,299 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:58:37,302 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5d99d602-7525-493e-bd40-6a13b36b8c5c/sv-benchmarks/c/termination-15/cstrcmp_mixed_alloca.i [2019-10-22 08:58:37,312 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5d99d602-7525-493e-bd40-6a13b36b8c5c/bin/uautomizer/data/137c05445/80a2f8d309914764808133ba956d6d2e/FLAG31aaf2822 [2019-10-22 08:58:37,659 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5d99d602-7525-493e-bd40-6a13b36b8c5c/bin/uautomizer/data/137c05445/80a2f8d309914764808133ba956d6d2e [2019-10-22 08:58:37,662 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:58:37,663 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:58:37,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:37,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:58:37,671 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:58:37,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:37" (1/1) ... [2019-10-22 08:58:37,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17780eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:37, skipping insertion in model container [2019-10-22 08:58:37,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:37" (1/1) ... [2019-10-22 08:58:37,684 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:58:37,711 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:58:38,147 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:38,157 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:58:38,220 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:38,283 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:58:38,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:38 WrapperNode [2019-10-22 08:58:38,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:38,285 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:38,285 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:58:38,285 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:58:38,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:38" (1/1) ... [2019-10-22 08:58:38,309 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:38" (1/1) ... [2019-10-22 08:58:38,334 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:38,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:58:38,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:58:38,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:58:38,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:38" (1/1) ... [2019-10-22 08:58:38,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:38" (1/1) ... [2019-10-22 08:58:38,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:38" (1/1) ... [2019-10-22 08:58:38,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:38" (1/1) ... [2019-10-22 08:58:38,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:38" (1/1) ... [2019-10-22 08:58:38,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:38" (1/1) ... [2019-10-22 08:58:38,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:38" (1/1) ... [2019-10-22 08:58:38,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:58:38,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:58:38,380 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:58:38,380 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:58:38,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d99d602-7525-493e-bd40-6a13b36b8c5c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:38,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:58:38,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:58:38,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:58:38,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:58:38,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:58:38,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:58:38,671 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:58:38,671 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 08:58:38,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:38 BoogieIcfgContainer [2019-10-22 08:58:38,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:58:38,673 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:58:38,673 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:58:38,677 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:58:38,678 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:38,679 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:58:37" (1/3) ... [2019-10-22 08:58:38,680 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68ef0745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:38, skipping insertion in model container [2019-10-22 08:58:38,680 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:38,680 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:38" (2/3) ... [2019-10-22 08:58:38,680 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68ef0745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:38, skipping insertion in model container [2019-10-22 08:58:38,680 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:38,681 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:38" (3/3) ... [2019-10-22 08:58:38,682 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrcmp_mixed_alloca.i [2019-10-22 08:58:38,733 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:58:38,733 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:58:38,734 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:58:38,734 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:58:38,734 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:58:38,734 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:58:38,734 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:58:38,734 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:58:38,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-10-22 08:58:38,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:38,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:38,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:38,826 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:58:38,826 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:38,827 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:58:38,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-10-22 08:58:38,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:38,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:38,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:38,829 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:58:38,829 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:38,836 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~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218, 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~nondet214;havoc main_#t~nondet214;main_~length2~0 := main_#t~nondet215;havoc main_#t~nondet215; 17#L378true assume !(main_~length1~0 < 1); 4#L378-2true assume !(main_~length2~0 < 1); 13#L381-1true call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 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~post209.base, cstrcmp_#t~post209.offset, cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset, cstrcmp_#t~mem205, cstrcmp_#t~mem206, cstrcmp_#t~mem207, cstrcmp_#t~short208, cstrcmp_#t~mem211, cstrcmp_#t~mem212, cstrcmp_#t~ite213, 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; 7#L367-5true [2019-10-22 08:58:38,837 INFO L793 eck$LassoCheckResult]: Loop: 7#L367-5true call cstrcmp_#t~mem205 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short208 := 0 != cstrcmp_#t~mem205; 3#L367-1true assume cstrcmp_#t~short208;call cstrcmp_#t~mem206 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem207 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short208 := cstrcmp_#t~mem206 == cstrcmp_#t~mem207; 5#L367-3true assume !!cstrcmp_#t~short208;havoc cstrcmp_#t~mem206;havoc cstrcmp_#t~mem207;havoc cstrcmp_#t~short208;havoc cstrcmp_#t~mem205;cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post209.base, 1 + cstrcmp_#t~post209.offset;havoc cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset;cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset - 1;havoc cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset; 7#L367-5true [2019-10-22 08:58:38,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:38,843 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-10-22 08:58:38,859 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:38,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012728378] [2019-10-22 08:58:38,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:38,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:38,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:39,044 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:39,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:39,045 INFO L82 PathProgramCache]: Analyzing trace with hash 49755, now seen corresponding path program 1 times [2019-10-22 08:58:39,045 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:39,045 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96162445] [2019-10-22 08:58:39,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:39,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:39,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:39,067 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:39,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:39,069 INFO L82 PathProgramCache]: Analyzing trace with hash 180429558, now seen corresponding path program 1 times [2019-10-22 08:58:39,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:39,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328604772] [2019-10-22 08:58:39,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:39,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:39,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:39,167 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:39,311 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-10-22 08:58:39,695 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2019-10-22 08:58:39,831 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-10-22 08:58:39,843 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:39,844 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:39,844 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:39,844 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:39,845 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:39,845 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:39,845 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:39,845 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:39,845 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcmp_mixed_alloca.i_Iteration1_Lasso [2019-10-22 08:58:39,845 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:39,846 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:39,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:39,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:39,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:39,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:39,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:40,264 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-10-22 08:58:40,429 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-10-22 08:58:40,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:40,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:40,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:40,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:40,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-10-22 08:58:40,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:40,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-10-22 08:58:40,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:40,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-10-22 08:58:40,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-10-22 08:58:40,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:40,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:40,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:40,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:40,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:40,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:41,155 WARN L191 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-10-22 08:58:41,320 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:41,328 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:41,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:41,332 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:41,333 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:41,333 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:41,334 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:41,334 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:41,337 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:41,337 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:41,339 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:41,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:41,340 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:41,340 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:41,340 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:41,340 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:41,341 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:41,341 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:41,341 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:41,344 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:41,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:41,345 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:41,345 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:41,345 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:41,346 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:41,346 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:41,346 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:41,347 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:41,348 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:41,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:41,349 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:41,350 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:41,350 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:41,350 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:41,352 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:41,352 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:41,357 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:41,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:41,358 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:41,358 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:41,358 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:41,359 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:41,361 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:41,362 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:41,385 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:41,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:41,386 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:41,387 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:41,387 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:41,387 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:41,388 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:41,388 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:41,396 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:41,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:41,397 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:41,397 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:41,398 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:41,398 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:58:41,398 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:41,399 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:58:41,399 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:41,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:41,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:41,410 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:41,410 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:58:41,410 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:41,410 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:41,430 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:58:41,432 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:41,509 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:41,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 08:58:41,510 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:41,511 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:41,511 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:41,511 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:41,512 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:41,512 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:41,515 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:41,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:41,523 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:41,523 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:41,524 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:41,524 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:41,525 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:41,525 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:41,549 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:41,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:41,550 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:41,551 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:41,551 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:41,551 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:41,552 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:41,552 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:41,554 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:41,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:41,558 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:41,559 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:41,560 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:41,560 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:41,565 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:41,565 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:41,628 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:41,678 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:58:41,679 INFO L444 ModelExtractionUtils]: 40 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:58:41,681 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:41,682 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:58:41,682 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:41,683 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcmp_~s2.offset) = 2*ULTIMATE.start_cstrcmp_~s2.offset + 1 Supporting invariants [] [2019-10-22 08:58:41,720 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2019-10-22 08:58:41,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:41,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:41,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:41,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:41,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:41,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:41,799 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:58:41,800 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 4 states. [2019-10-22 08:58:41,845 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 08:58:41,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:58:41,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:58:41,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2019-10-22 08:58:41,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 5 letters. Loop has 3 letters. [2019-10-22 08:58:41,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:41,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 8 letters. Loop has 3 letters. [2019-10-22 08:58:41,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:41,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 5 letters. Loop has 6 letters. [2019-10-22 08:58:41,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:41,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 52 transitions. [2019-10-22 08:58:41,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:41,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 15 states and 20 transitions. [2019-10-22 08:58:41,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 08:58:41,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:58:41,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2019-10-22 08:58:41,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:41,865 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-10-22 08:58:41,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2019-10-22 08:58:41,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-10-22 08:58:41,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-22 08:58:41,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-10-22 08:58:41,895 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-10-22 08:58:41,896 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-10-22 08:58:41,896 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:58:41,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-10-22 08:58:41,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:41,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:41,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:41,897 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:58:41,897 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:41,897 INFO L791 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 157#L-1 havoc main_#res;havoc main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218, 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~nondet214;havoc main_#t~nondet214;main_~length2~0 := main_#t~nondet215;havoc main_#t~nondet215; 158#L378 assume !(main_~length1~0 < 1); 165#L378-2 assume !(main_~length2~0 < 1); 166#L381-1 call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 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~post209.base, cstrcmp_#t~post209.offset, cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset, cstrcmp_#t~mem205, cstrcmp_#t~mem206, cstrcmp_#t~mem207, cstrcmp_#t~short208, cstrcmp_#t~mem211, cstrcmp_#t~mem212, cstrcmp_#t~ite213, 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; 169#L367-5 call cstrcmp_#t~mem205 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short208 := 0 != cstrcmp_#t~mem205; 159#L367-1 [2019-10-22 08:58:41,897 INFO L793 eck$LassoCheckResult]: Loop: 159#L367-1 assume !cstrcmp_#t~short208; 160#L367-3 assume !!cstrcmp_#t~short208;havoc cstrcmp_#t~mem206;havoc cstrcmp_#t~mem207;havoc cstrcmp_#t~short208;havoc cstrcmp_#t~mem205;cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post209.base, 1 + cstrcmp_#t~post209.offset;havoc cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset;cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset - 1;havoc cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset; 167#L367-5 call cstrcmp_#t~mem205 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short208 := 0 != cstrcmp_#t~mem205; 159#L367-1 [2019-10-22 08:58:41,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:41,898 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 1 times [2019-10-22 08:58:41,898 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:41,899 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228770160] [2019-10-22 08:58:41,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:41,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:41,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:41,942 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:41,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:41,943 INFO L82 PathProgramCache]: Analyzing trace with hash 54797, now seen corresponding path program 1 times [2019-10-22 08:58:41,943 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:41,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686393484] [2019-10-22 08:58:41,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:41,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:41,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:41,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:41,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686393484] [2019-10-22 08:58:41,974 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:41,974 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:58:41,974 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681017862] [2019-10-22 08:58:41,976 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:58:41,976 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:41,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:41,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:41,981 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-10-22 08:58:41,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:41,994 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2019-10-22 08:58:41,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:41,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 15 transitions. [2019-10-22 08:58:41,996 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:41,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2019-10-22 08:58:41,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:58:41,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:58:41,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:58:41,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:41,996 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:41,996 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:41,996 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:41,996 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:58:41,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:58:41,997 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:41,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:58:42,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:58:42 BoogieIcfgContainer [2019-10-22 08:58:42,002 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:58:42,002 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:58:42,003 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:58:42,003 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:58:42,003 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:38" (3/4) ... [2019-10-22 08:58:42,007 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:58:42,007 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:58:42,008 INFO L168 Benchmark]: Toolchain (without parser) took 4345.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 942.0 MB in the beginning and 956.1 MB in the end (delta: -14.1 MB). Peak memory consumption was 135.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:42,009 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:42,009 INFO L168 Benchmark]: CACSL2BoogieTranslator took 620.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -185.2 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:42,010 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:42,010 INFO L168 Benchmark]: Boogie Preprocessor took 44.60 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-10-22 08:58:42,011 INFO L168 Benchmark]: RCFGBuilder took 293.39 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-10-22 08:58:42,011 INFO L168 Benchmark]: BuchiAutomizer took 3328.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 956.1 MB in the end (delta: 143.3 MB). Peak memory consumption was 143.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:42,011 INFO L168 Benchmark]: Witness Printer took 4.43 ms. Allocated memory is still 1.2 GB. Free memory is still 956.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:42,014 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 620.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -185.2 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.60 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. * RCFGBuilder took 293.39 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 3328.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 956.1 MB in the end (delta: 143.3 MB). Peak memory consumption was 143.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.43 ms. Allocated memory is still 1.2 GB. Free memory is still 956.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * 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 2 * s2 + 1 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.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.9s. 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: 27 SDtfs, 17 SDslu, 18 SDs, 0 SdLazy, 11 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital217 mio100 ax100 hnf99 lsp97 ukn86 mio100 lsp48 div100 bol100 ite100 ukn100 eq190 hnf89 smp100 dnf157 smp97 tf100 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 100ms VariablesStem: 9 VariablesLoop: 7 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...