./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/cstrncmp_diffterm_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-15/cstrncmp_diffterm_alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 d2afd5adf9edf057cef901a8351053c92468d919 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 22:04:00,713 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:04:00,718 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:04:00,731 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:04:00,732 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:04:00,733 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:04:00,734 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:04:00,736 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:04:00,738 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:04:00,739 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:04:00,740 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:04:00,740 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:04:00,741 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:04:00,742 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:04:00,743 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:04:00,744 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:04:00,745 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:04:00,747 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:04:00,749 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:04:00,751 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:04:00,752 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:04:00,753 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:04:00,756 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:04:00,756 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:04:00,756 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:04:00,757 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:04:00,758 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:04:00,759 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:04:00,760 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:04:00,761 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:04:00,761 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:04:00,762 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:04:00,762 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:04:00,762 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:04:00,763 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:04:00,764 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:04:00,764 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 22:04:00,791 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:04:00,793 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:04:00,794 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:04:00,795 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:04:00,796 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:04:00,796 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:04:00,796 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:04:00,797 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:04:00,797 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:04:00,797 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:04:00,797 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:04:00,797 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:04:00,797 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:04:00,798 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:04:00,799 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:04:00,799 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:04:00,799 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:04:00,799 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:04:00,799 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:04:00,799 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:04:00,800 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:04:00,800 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:04:00,800 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:04:00,800 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:04:00,800 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:04:00,801 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:04:00,803 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:04:00,803 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:04:00,804 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:04:00,804 INFO L133 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> d2afd5adf9edf057cef901a8351053c92468d919 [2019-01-01 22:04:00,854 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:04:00,867 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:04:00,871 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:04:00,873 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:04:00,873 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:04:00,874 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/cstrncmp_diffterm_alloca_true-termination.c.i [2019-01-01 22:04:00,950 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd08344aa/2ef33fc1d3114ff090544d6a4edfddcf/FLAGe08aed998 [2019-01-01 22:04:01,544 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:04:01,544 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/cstrncmp_diffterm_alloca_true-termination.c.i [2019-01-01 22:04:01,556 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd08344aa/2ef33fc1d3114ff090544d6a4edfddcf/FLAGe08aed998 [2019-01-01 22:04:01,774 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd08344aa/2ef33fc1d3114ff090544d6a4edfddcf [2019-01-01 22:04:01,778 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:04:01,779 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:04:01,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:04:01,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:04:01,784 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:04:01,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:04:01" (1/1) ... [2019-01-01 22:04:01,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51c017a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:01, skipping insertion in model container [2019-01-01 22:04:01,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:04:01" (1/1) ... [2019-01-01 22:04:01,797 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:04:01,832 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:04:02,257 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:04:02,277 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:04:02,357 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:04:02,529 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:04:02,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:02 WrapperNode [2019-01-01 22:04:02,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:04:02,531 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:04:02,533 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:04:02,533 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:04:02,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:02" (1/1) ... [2019-01-01 22:04:02,569 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:02" (1/1) ... [2019-01-01 22:04:02,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:04:02,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:04:02,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:04:02,608 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:04:02,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:02" (1/1) ... [2019-01-01 22:04:02,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:02" (1/1) ... [2019-01-01 22:04:02,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:02" (1/1) ... [2019-01-01 22:04:02,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:02" (1/1) ... [2019-01-01 22:04:02,637 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:02" (1/1) ... [2019-01-01 22:04:02,650 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:02" (1/1) ... [2019-01-01 22:04:02,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:02" (1/1) ... [2019-01-01 22:04:02,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:04:02,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:04:02,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:04:02,665 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:04:02,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-01-01 22:04:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 22:04:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 22:04:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 22:04:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 22:04:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:04:02,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:04:03,234 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:04:03,235 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-01 22:04:03,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:04:03 BoogieIcfgContainer [2019-01-01 22:04:03,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:04:03,236 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:04:03,236 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:04:03,241 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:04:03,242 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:04:03,242 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:04:01" (1/3) ... [2019-01-01 22:04:03,244 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65b2dc63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:04:03, skipping insertion in model container [2019-01-01 22:04:03,244 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:04:03,244 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:02" (2/3) ... [2019-01-01 22:04:03,245 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65b2dc63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:04:03, skipping insertion in model container [2019-01-01 22:04:03,245 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:04:03,246 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:04:03" (3/3) ... [2019-01-01 22:04:03,249 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncmp_diffterm_alloca_true-termination.c.i [2019-01-01 22:04:03,312 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:04:03,313 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:04:03,313 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:04:03,313 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:04:03,313 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:04:03,314 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:04:03,314 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:04:03,314 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:04:03,314 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:04:03,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 22:04:03,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 22:04:03,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:04:03,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:04:03,358 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:04:03,358 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 22:04:03,358 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:04:03,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 22:04:03,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 22:04:03,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:04:03,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:04:03,361 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:04:03,361 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 22:04:03,371 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet216, main_#t~nondet217, main_#t~malloc218.base, main_#t~malloc218.offset, main_#t~malloc219.base, main_#t~malloc219.offset, main_#t~nondet220, main_#t~ret221, 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~nondet216;havoc main_#t~nondet216;main_~length2~0 := main_#t~nondet217;havoc main_#t~nondet217; 11#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 9#L385-1true call main_#t~malloc218.base, main_#t~malloc218.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc218.base, main_#t~malloc218.offset;call main_#t~malloc219.base, main_#t~malloc219.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc219.base, main_#t~malloc219.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet220;havoc cstrncmp_#res;havoc cstrncmp_#t~mem209, cstrncmp_#t~short210, cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset, cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset, cstrncmp_#t~post205, cstrncmp_#t~mem206, cstrncmp_#t~mem207, cstrncmp_#t~short208, cstrncmp_#t~mem213, cstrncmp_#t~mem214, cstrncmp_#t~ite215, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n, cstrncmp_~uc1~0, cstrncmp_~uc2~0;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n;havoc cstrncmp_~uc1~0;havoc cstrncmp_~uc2~0; 20#L367true assume !(0 == cstrncmp_~n); 6#L369-5true [2019-01-01 22:04:03,373 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-5true cstrncmp_#t~post205 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post205 - 1;cstrncmp_#t~short208 := cstrncmp_#t~post205 > 0; 17#L369-1true assume cstrncmp_#t~short208;call cstrncmp_#t~mem206 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);call cstrncmp_#t~mem207 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1);cstrncmp_#t~short208 := cstrncmp_#t~mem206 == cstrncmp_#t~mem207; 4#L369-3true assume !!cstrncmp_#t~short208;havoc cstrncmp_#t~post205;havoc cstrncmp_#t~mem206;havoc cstrncmp_#t~mem207;havoc cstrncmp_#t~short208;cstrncmp_#t~short210 := 0 == cstrncmp_~n; 14#L370true assume cstrncmp_#t~short210; 19#L370-2true assume !cstrncmp_#t~short210;havoc cstrncmp_#t~mem209;havoc cstrncmp_#t~short210;cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post211.base, 1 + cstrncmp_#t~post211.offset;havoc cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset;cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post212.base, 1 + cstrncmp_#t~post212.offset;havoc cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset; 6#L369-5true [2019-01-01 22:04:03,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:04:03,381 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 1 times [2019-01-01 22:04:03,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:04:03,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:04:03,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:03,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:04:03,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:03,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:04:03,565 INFO L82 PathProgramCache]: Analyzing trace with hash 52587176, now seen corresponding path program 1 times [2019-01-01 22:04:03,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:04:03,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:04:03,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:03,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:04:03,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:04:03,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:04:03,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:04:03,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:04:03,647 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:04:03,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:04:03,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:04:03,668 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-01-01 22:04:03,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:04:03,723 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2019-01-01 22:04:03,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:04:03,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-01-01 22:04:03,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 22:04:03,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 11 states and 14 transitions. [2019-01-01 22:04:03,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 22:04:03,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 22:04:03,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-01-01 22:04:03,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:04:03,736 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-01 22:04:03,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-01-01 22:04:03,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-01 22:04:03,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 22:04:03,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-01-01 22:04:03,770 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-01 22:04:03,770 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-01 22:04:03,770 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:04:03,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-01-01 22:04:03,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 22:04:03,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:04:03,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:04:03,772 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:04:03,772 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 22:04:03,772 INFO L794 eck$LassoCheckResult]: Stem: 51#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 46#L-1 havoc main_#res;havoc main_#t~nondet216, main_#t~nondet217, main_#t~malloc218.base, main_#t~malloc218.offset, main_#t~malloc219.base, main_#t~malloc219.offset, main_#t~nondet220, main_#t~ret221, 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~nondet216;havoc main_#t~nondet216;main_~length2~0 := main_#t~nondet217;havoc main_#t~nondet217; 47#L382 assume !(main_~length1~0 < 1); 50#L382-2 assume !(main_~length2~0 < 1); 55#L385-1 call main_#t~malloc218.base, main_#t~malloc218.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc218.base, main_#t~malloc218.offset;call main_#t~malloc219.base, main_#t~malloc219.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc219.base, main_#t~malloc219.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet220;havoc cstrncmp_#res;havoc cstrncmp_#t~mem209, cstrncmp_#t~short210, cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset, cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset, cstrncmp_#t~post205, cstrncmp_#t~mem206, cstrncmp_#t~mem207, cstrncmp_#t~short208, cstrncmp_#t~mem213, cstrncmp_#t~mem214, cstrncmp_#t~ite215, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n, cstrncmp_~uc1~0, cstrncmp_~uc2~0;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n;havoc cstrncmp_~uc1~0;havoc cstrncmp_~uc2~0; 56#L367 assume !(0 == cstrncmp_~n); 53#L369-5 [2019-01-01 22:04:03,772 INFO L796 eck$LassoCheckResult]: Loop: 53#L369-5 cstrncmp_#t~post205 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post205 - 1;cstrncmp_#t~short208 := cstrncmp_#t~post205 > 0; 54#L369-1 assume cstrncmp_#t~short208;call cstrncmp_#t~mem206 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);call cstrncmp_#t~mem207 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1);cstrncmp_#t~short208 := cstrncmp_#t~mem206 == cstrncmp_#t~mem207; 48#L369-3 assume !!cstrncmp_#t~short208;havoc cstrncmp_#t~post205;havoc cstrncmp_#t~mem206;havoc cstrncmp_#t~mem207;havoc cstrncmp_#t~short208;cstrncmp_#t~short210 := 0 == cstrncmp_~n; 49#L370 assume !cstrncmp_#t~short210;call cstrncmp_#t~mem209 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~short210 := 49 == cstrncmp_#t~mem209; 52#L370-2 assume !cstrncmp_#t~short210;havoc cstrncmp_#t~mem209;havoc cstrncmp_#t~short210;cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post211.base, 1 + cstrncmp_#t~post211.offset;havoc cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset;cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post212.base, 1 + cstrncmp_#t~post212.offset;havoc cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset; 53#L369-5 [2019-01-01 22:04:03,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:04:03,775 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 2 times [2019-01-01 22:04:03,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:04:03,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:04:03,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:03,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:04:03,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:03,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:04:03,835 INFO L82 PathProgramCache]: Analyzing trace with hash 52587238, now seen corresponding path program 1 times [2019-01-01 22:04:03,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:04:03,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:04:03,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:03,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:04:03,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:03,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:04:03,887 INFO L82 PathProgramCache]: Analyzing trace with hash -2120298631, now seen corresponding path program 1 times [2019-01-01 22:04:03,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:04:03,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:04:03,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:03,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:04:03,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:03,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:04,692 WARN L181 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-01-01 22:04:04,826 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-01 22:04:05,635 WARN L181 SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2019-01-01 22:04:05,853 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-01-01 22:04:05,867 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:04:05,868 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:04:05,868 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:04:05,868 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:04:05,869 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:04:05,869 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:04:05,869 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:04:05,869 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:04:05,870 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncmp_diffterm_alloca_true-termination.c.i_Iteration2_Lasso [2019-01-01 22:04:05,870 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:04:05,870 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:04:05,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:06,374 WARN L181 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-01-01 22:04:06,639 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-01-01 22:04:06,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:06,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:06,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:06,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:06,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:06,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:06,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:06,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:06,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:06,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:06,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:06,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:06,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:06,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:06,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:06,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:06,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:06,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:06,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:06,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:06,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:06,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:06,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:07,734 WARN L181 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-01-01 22:04:08,125 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:04:08,131 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:04:08,134 INFO L122 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-01-01 22:04:08,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:08,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:08,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:08,136 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:04:08,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:08,140 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:04:08,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:08,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:08,144 INFO L122 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-01-01 22:04:08,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:08,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:08,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:08,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:08,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:04:08,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:08,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:08,166 INFO L122 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-01-01 22:04:08,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:08,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:08,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:08,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:08,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:04:08,172 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:08,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:08,186 INFO L122 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-01-01 22:04:08,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:08,187 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 22:04:08,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:08,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:08,198 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:04:08,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:08,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:08,245 INFO L122 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-01-01 22:04:08,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:08,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:08,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:08,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:08,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:04:08,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:08,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:08,254 INFO L122 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-01-01 22:04:08,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:08,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:08,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:08,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:08,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:04:08,258 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:08,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:08,262 INFO L122 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-01-01 22:04:08,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:08,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:08,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:08,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:08,272 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:04:08,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:08,380 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:04:08,432 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 22:04:08,437 INFO L444 ModelExtractionUtils]: 34 out of 40 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 22:04:08,439 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:04:08,444 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:04:08,450 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:04:08,451 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc219.base)_1, ULTIMATE.start_cstrncmp_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc219.base)_1 - 1*ULTIMATE.start_cstrncmp_~s1.offset Supporting invariants [] [2019-01-01 22:04:08,663 INFO L297 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2019-01-01 22:04:08,696 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 22:04:08,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:04:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:04:08,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:04:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:04:08,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:04:08,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:04:08,978 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 22:04:08,979 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 5 states. [2019-01-01 22:04:09,142 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 5 states. Result 25 states and 31 transitions. Complement of second has 7 states. [2019-01-01 22:04:09,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 22:04:09,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 22:04:09,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-01-01 22:04:09,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 6 letters. Loop has 5 letters. [2019-01-01 22:04:09,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:04:09,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 5 letters. [2019-01-01 22:04:09,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:04:09,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 6 letters. Loop has 10 letters. [2019-01-01 22:04:09,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:04:09,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2019-01-01 22:04:09,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 22:04:09,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 22 states and 27 transitions. [2019-01-01 22:04:09,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-01 22:04:09,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-01 22:04:09,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2019-01-01 22:04:09,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:04:09,154 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-01-01 22:04:09,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2019-01-01 22:04:09,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-01 22:04:09,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-01 22:04:09,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2019-01-01 22:04:09,158 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-01-01 22:04:09,158 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-01-01 22:04:09,158 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:04:09,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2019-01-01 22:04:09,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 22:04:09,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:04:09,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:04:09,160 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:04:09,160 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 22:04:09,161 INFO L794 eck$LassoCheckResult]: Stem: 217#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 210#L-1 havoc main_#res;havoc main_#t~nondet216, main_#t~nondet217, main_#t~malloc218.base, main_#t~malloc218.offset, main_#t~malloc219.base, main_#t~malloc219.offset, main_#t~nondet220, main_#t~ret221, 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~nondet216;havoc main_#t~nondet216;main_~length2~0 := main_#t~nondet217;havoc main_#t~nondet217; 211#L382 assume !(main_~length1~0 < 1); 216#L382-2 assume !(main_~length2~0 < 1); 224#L385-1 call main_#t~malloc218.base, main_#t~malloc218.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc218.base, main_#t~malloc218.offset;call main_#t~malloc219.base, main_#t~malloc219.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc219.base, main_#t~malloc219.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet220;havoc cstrncmp_#res;havoc cstrncmp_#t~mem209, cstrncmp_#t~short210, cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset, cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset, cstrncmp_#t~post205, cstrncmp_#t~mem206, cstrncmp_#t~mem207, cstrncmp_#t~short208, cstrncmp_#t~mem213, cstrncmp_#t~mem214, cstrncmp_#t~ite215, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n, cstrncmp_~uc1~0, cstrncmp_~uc2~0;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n;havoc cstrncmp_~uc1~0;havoc cstrncmp_~uc2~0; 226#L367 assume !(0 == cstrncmp_~n); 228#L369-5 cstrncmp_#t~post205 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post205 - 1;cstrncmp_#t~short208 := cstrncmp_#t~post205 > 0; 221#L369-1 [2019-01-01 22:04:09,161 INFO L796 eck$LassoCheckResult]: Loop: 221#L369-1 assume !cstrncmp_#t~short208; 212#L369-3 assume !!cstrncmp_#t~short208;havoc cstrncmp_#t~post205;havoc cstrncmp_#t~mem206;havoc cstrncmp_#t~mem207;havoc cstrncmp_#t~short208;cstrncmp_#t~short210 := 0 == cstrncmp_~n; 213#L370 assume !cstrncmp_#t~short210;call cstrncmp_#t~mem209 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~short210 := 49 == cstrncmp_#t~mem209; 218#L370-2 assume !cstrncmp_#t~short210;havoc cstrncmp_#t~mem209;havoc cstrncmp_#t~short210;cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post211.base, 1 + cstrncmp_#t~post211.offset;havoc cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset;cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post212.base, 1 + cstrncmp_#t~post212.offset;havoc cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset; 220#L369-5 cstrncmp_#t~post205 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post205 - 1;cstrncmp_#t~short208 := cstrncmp_#t~post205 > 0; 221#L369-1 [2019-01-01 22:04:09,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:04:09,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2019-01-01 22:04:09,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:04:09,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:04:09,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:09,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:04:09,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:09,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:04:09,191 INFO L82 PathProgramCache]: Analyzing trace with hash 57448140, now seen corresponding path program 1 times [2019-01-01 22:04:09,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:04:09,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:04:09,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:09,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:04:09,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:04:09,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:04:09,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:04:09,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:04:09,241 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:04:09,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:04:09,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:04:09,241 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-01 22:04:09,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:04:09,301 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-01-01 22:04:09,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:04:09,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2019-01-01 22:04:09,305 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:04:09,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2019-01-01 22:04:09,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 22:04:09,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 22:04:09,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 22:04:09,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:04:09,305 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:04:09,306 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:04:09,306 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:04:09,306 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:04:09,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 22:04:09,306 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:04:09,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 22:04:09,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:04:09 BoogieIcfgContainer [2019-01-01 22:04:09,319 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:04:09,320 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:04:09,320 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:04:09,320 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:04:09,322 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:04:03" (3/4) ... [2019-01-01 22:04:09,326 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 22:04:09,328 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:04:09,329 INFO L168 Benchmark]: Toolchain (without parser) took 7550.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.3 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -95.2 MB). Peak memory consumption was 105.1 MB. Max. memory is 11.5 GB. [2019-01-01 22:04:09,332 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:04:09,334 INFO L168 Benchmark]: CACSL2BoogieTranslator took 749.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -176.9 MB). Peak memory consumption was 42.8 MB. Max. memory is 11.5 GB. [2019-01-01 22:04:09,336 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.71 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: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-01 22:04:09,338 INFO L168 Benchmark]: Boogie Preprocessor took 57.27 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-01-01 22:04:09,339 INFO L168 Benchmark]: RCFGBuilder took 570.13 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: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-01-01 22:04:09,340 INFO L168 Benchmark]: BuchiAutomizer took 6083.56 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.3 MB). Peak memory consumption was 120.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:04:09,341 INFO L168 Benchmark]: Witness Printer took 8.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:04:09,350 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 749.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -176.9 MB). Peak memory consumption was 42.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.71 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: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.27 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 570.13 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: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6083.56 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.3 MB). Peak memory consumption was 120.7 MB. Max. memory is 11.5 GB. * Witness Printer took 8.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] + -1 * s1 and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 5.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 21 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 49 SDtfs, 14 SDslu, 39 SDs, 0 SdLazy, 19 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital236 mio100 ax100 hnf99 lsp88 ukn85 mio100 lsp42 div100 bol100 ite100 ukn100 eq192 hnf88 smp100 dnf187 smp97 tf100 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 59ms 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...