./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrncmp_diffterm_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/termination-15/cstrncmp_diffterm_alloca.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-30f4e4a [2019-11-28 03:03:54,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:03:54,895 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:03:54,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:03:54,912 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:03:54,913 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:03:54,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:03:54,917 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:03:54,919 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:03:54,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:03:54,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:03:54,925 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:03:54,925 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:03:54,928 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:03:54,931 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:03:54,932 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:03:54,933 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:03:54,936 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:03:54,939 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:03:54,942 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:03:54,944 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:03:54,945 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:03:54,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:03:54,951 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:03:54,955 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:03:54,958 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:03:54,958 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:03:54,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:03:54,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:03:54,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:03:54,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:03:54,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:03:54,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:03:54,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:03:54,970 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:03:54,971 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:03:54,973 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:03:54,973 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:03:54,974 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:03:54,977 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:03:54,978 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:03:54,979 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 03:03:55,003 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:03:55,004 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:03:55,006 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:03:55,006 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:03:55,006 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:03:55,007 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:03:55,007 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:03:55,007 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:03:55,008 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:03:55,008 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:03:55,009 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:03:55,010 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:03:55,010 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:03:55,011 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:03:55,011 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:03:55,011 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:03:55,011 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:03:55,012 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:03:55,012 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:03:55,013 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:03:55,013 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:03:55,013 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:03:55,013 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:03:55,014 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:03:55,014 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:03:55,014 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:03:55,015 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:03:55,015 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:03:55,017 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:03:55,017 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 -> /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-11-28 03:03:55,337 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:03:55,352 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:03:55,355 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:03:55,357 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:03:55,358 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:03:55,359 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrncmp_diffterm_alloca.i [2019-11-28 03:03:55,439 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c12f91836/8177c61fef2f4fe4a045893b5fb889c8/FLAG5293cf19e [2019-11-28 03:03:56,008 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:03:56,009 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrncmp_diffterm_alloca.i [2019-11-28 03:03:56,018 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c12f91836/8177c61fef2f4fe4a045893b5fb889c8/FLAG5293cf19e [2019-11-28 03:03:56,380 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c12f91836/8177c61fef2f4fe4a045893b5fb889c8 [2019-11-28 03:03:56,385 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:03:56,387 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:03:56,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:03:56,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:03:56,395 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:03:56,396 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:03:56" (1/1) ... [2019-11-28 03:03:56,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c3e2fce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:56, skipping insertion in model container [2019-11-28 03:03:56,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:03:56" (1/1) ... [2019-11-28 03:03:56,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:03:56,453 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:03:56,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:03:56,982 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:03:57,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:03:57,143 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:03:57,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:57 WrapperNode [2019-11-28 03:03:57,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:03:57,146 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:03:57,146 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:03:57,146 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:03:57,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:57" (1/1) ... [2019-11-28 03:03:57,187 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:57" (1/1) ... [2019-11-28 03:03:57,220 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:03:57,221 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:03:57,221 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:03:57,221 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:03:57,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:57" (1/1) ... [2019-11-28 03:03:57,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:57" (1/1) ... [2019-11-28 03:03:57,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:57" (1/1) ... [2019-11-28 03:03:57,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:57" (1/1) ... [2019-11-28 03:03:57,243 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:57" (1/1) ... [2019-11-28 03:03:57,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:57" (1/1) ... [2019-11-28 03:03:57,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:57" (1/1) ... [2019-11-28 03:03:57,261 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:03:57,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:03:57,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:03:57,262 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:03:57,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:57" (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-11-28 03:03:57,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:03:57,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:03:57,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:03:57,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:03:57,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:03:57,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:03:57,839 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:03:57,840 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 03:03:57,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:03:57 BoogieIcfgContainer [2019-11-28 03:03:57,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:03:57,844 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:03:57,844 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:03:57,848 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:03:57,849 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:03:57,849 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:03:56" (1/3) ... [2019-11-28 03:03:57,851 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4681fa45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:03:57, skipping insertion in model container [2019-11-28 03:03:57,851 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:03:57,852 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:57" (2/3) ... [2019-11-28 03:03:57,852 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4681fa45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:03:57, skipping insertion in model container [2019-11-28 03:03:57,852 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:03:57,852 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:03:57" (3/3) ... [2019-11-28 03:03:57,854 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrncmp_diffterm_alloca.i [2019-11-28 03:03:57,911 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:03:57,911 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:03:57,912 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:03:57,912 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:03:57,912 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:03:57,912 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:03:57,912 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:03:57,913 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:03:57,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-28 03:03:57,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:03:57,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:03:57,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:03:57,960 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:03:57,960 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:03:57,961 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:03:57,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-28 03:03:57,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:03:57,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:03:57,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:03:57,964 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:03:57,964 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:03:57,973 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-11-28 03:03:57,974 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~mem207;havoc cstrncmp_#t~short208;havoc cstrncmp_#t~mem206;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-11-28 03:03:57,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:57,981 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 1 times [2019-11-28 03:03:57,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:57,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535284553] [2019-11-28 03:03:57,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:58,157 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:58,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:58,158 INFO L82 PathProgramCache]: Analyzing trace with hash 52587176, now seen corresponding path program 1 times [2019-11-28 03:03:58,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:58,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584139018] [2019-11-28 03:03:58,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:03:58,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:03:58,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584139018] [2019-11-28 03:03:58,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:03:58,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:03:58,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333766181] [2019-11-28 03:03:58,229 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:03:58,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:03:58,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:03:58,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:03:58,250 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-11-28 03:03:58,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:03:58,282 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2019-11-28 03:03:58,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:03:58,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-11-28 03:03:58,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:03:58,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 11 states and 14 transitions. [2019-11-28 03:03:58,293 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 03:03:58,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 03:03:58,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-11-28 03:03:58,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:03:58,295 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-28 03:03:58,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-11-28 03:03:58,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-28 03:03:58,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-28 03:03:58,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-11-28 03:03:58,320 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-28 03:03:58,320 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-28 03:03:58,320 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:03:58,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-11-28 03:03:58,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:03:58,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:03:58,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:03:58,322 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:03:58,322 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:03:58,322 INFO L794 eck$LassoCheckResult]: Stem: 51#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-11-28 03:03:58,323 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~mem207;havoc cstrncmp_#t~short208;havoc cstrncmp_#t~mem206;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-11-28 03:03:58,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:58,323 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 2 times [2019-11-28 03:03:58,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:58,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039813645] [2019-11-28 03:03:58,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:58,365 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:58,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:58,366 INFO L82 PathProgramCache]: Analyzing trace with hash 52587238, now seen corresponding path program 1 times [2019-11-28 03:03:58,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:58,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832321389] [2019-11-28 03:03:58,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:58,396 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:58,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:58,397 INFO L82 PathProgramCache]: Analyzing trace with hash -2120298631, now seen corresponding path program 1 times [2019-11-28 03:03:58,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:58,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864072452] [2019-11-28 03:03:58,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:58,481 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:58,908 WARN L192 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-11-28 03:03:59,348 WARN L192 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 88 [2019-11-28 03:03:59,490 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-28 03:03:59,505 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:03:59,507 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:03:59,508 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:03:59,512 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:03:59,513 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:03:59,513 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:59,513 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:03:59,513 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:03:59,514 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncmp_diffterm_alloca.i_Iteration2_Lasso [2019-11-28 03:03:59,515 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:03:59,515 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:03:59,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:59,954 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-11-28 03:04:00,116 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-11-28 03:04:00,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:00,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:00,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:00,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:00,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:00,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:00,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:00,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:00,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:00,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:00,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:00,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:00,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:00,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:00,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:00,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:00,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:00,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:00,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:00,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:00,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:00,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:00,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:00,868 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:04:00,875 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:00,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:00,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:00,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:00,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:00,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:00,897 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:00,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:04:00,908 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:04:00,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:00,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:00,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:00,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:00,926 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:04:00,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:00,929 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 03:04:00,932 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:00,937 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:04:00,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:00,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:00,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:00,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:00,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:00,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:00,971 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:00,980 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:04:00,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:00,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:00,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:00,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:00,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:01,002 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:01,002 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:01,013 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:04:01,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:01,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:01,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:01,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:01,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:01,047 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:01,047 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:01,063 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:04:01,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:01,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:01,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:01,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:01,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:01,084 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:01,084 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:01,090 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:04:01,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:01,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:01,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:01,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:01,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:01,127 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:01,127 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:04:01,158 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:04:01,317 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-28 03:04:01,317 INFO L444 ModelExtractionUtils]: 20 out of 40 variables were initially zero. Simplification set additionally 17 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:04:01,376 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:01,389 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:04:01,389 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:04:01,390 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncmp_~s2.offset, v_rep(select #length ULTIMATE.start_cstrncmp_~s2.base)_1) = -1*ULTIMATE.start_cstrncmp_~s2.offset + 1*v_rep(select #length ULTIMATE.start_cstrncmp_~s2.base)_1 Supporting invariants [] [2019-11-28 03:04:01,448 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2019-11-28 03:04:01,457 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:04:01,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:01,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:04:01,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:04:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:01,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:04:01,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:04:01,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:04:01,540 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 03:04:01,541 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-11-28 03:04:01,583 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 25 states and 31 transitions. Complement of second has 6 states. [2019-11-28 03:04:01,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:04:01,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:04:01,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-11-28 03:04:01,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 5 letters. [2019-11-28 03:04:01,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:04:01,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 11 letters. Loop has 5 letters. [2019-11-28 03:04:01,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:04:01,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 10 letters. [2019-11-28 03:04:01,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:04:01,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2019-11-28 03:04:01,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:04:01,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 22 states and 27 transitions. [2019-11-28 03:04:01,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 03:04:01,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 03:04:01,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2019-11-28 03:04:01,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:04:01,595 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-11-28 03:04:01,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2019-11-28 03:04:01,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-11-28 03:04:01,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 03:04:01,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2019-11-28 03:04:01,599 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-11-28 03:04:01,599 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-11-28 03:04:01,599 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:04:01,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2019-11-28 03:04:01,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:04:01,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:04:01,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:04:01,602 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:04:01,602 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:04:01,602 INFO L794 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 202#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; 203#L382 assume !(main_~length1~0 < 1); 204#L382-2 assume !(main_~length2~0 < 1); 216#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; 219#L367 assume !(0 == cstrncmp_~n); 220#L369-5 cstrncmp_#t~post205 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post205 - 1;cstrncmp_#t~short208 := cstrncmp_#t~post205 > 0; 213#L369-1 [2019-11-28 03:04:01,602 INFO L796 eck$LassoCheckResult]: Loop: 213#L369-1 assume !cstrncmp_#t~short208; 205#L369-3 assume !!cstrncmp_#t~short208;havoc cstrncmp_#t~post205;havoc cstrncmp_#t~mem207;havoc cstrncmp_#t~short208;havoc cstrncmp_#t~mem206;cstrncmp_#t~short210 := 0 == cstrncmp_~n; 206#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; 210#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; 212#L369-5 cstrncmp_#t~post205 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post205 - 1;cstrncmp_#t~short208 := cstrncmp_#t~post205 > 0; 213#L369-1 [2019-11-28 03:04:01,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:01,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2019-11-28 03:04:01,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:01,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964321283] [2019-11-28 03:04:01,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:01,639 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:01,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:01,640 INFO L82 PathProgramCache]: Analyzing trace with hash 57448140, now seen corresponding path program 1 times [2019-11-28 03:04:01,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:01,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961866178] [2019-11-28 03:04:01,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:01,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:04:01,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961866178] [2019-11-28 03:04:01,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:04:01,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:04:01,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481023830] [2019-11-28 03:04:01,665 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:04:01,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:04:01,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:04:01,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:04:01,666 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-28 03:04:01,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:04:01,682 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-11-28 03:04:01,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:04:01,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2019-11-28 03:04:01,685 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:04:01,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2019-11-28 03:04:01,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:04:01,686 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:04:01,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:04:01,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:04:01,686 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:04:01,687 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:04:01,687 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:04:01,689 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:04:01,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 03:04:01,689 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:04:01,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 03:04:01,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:04:01 BoogieIcfgContainer [2019-11-28 03:04:01,698 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:04:01,700 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:04:01,700 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:04:01,700 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:04:01,701 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:03:57" (3/4) ... [2019-11-28 03:04:01,705 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 03:04:01,705 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:04:01,708 INFO L168 Benchmark]: Toolchain (without parser) took 5320.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.9 MB). Free memory was 956.3 MB in the beginning and 1.0 GB in the end (delta: -72.1 MB). Peak memory consumption was 120.9 MB. Max. memory is 11.5 GB. [2019-11-28 03:04:01,709 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:04:01,711 INFO L168 Benchmark]: CACSL2BoogieTranslator took 754.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -136.2 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-28 03:04:01,712 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.66 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:04:01,718 INFO L168 Benchmark]: Boogie Preprocessor took 40.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 03:04:01,719 INFO L168 Benchmark]: RCFGBuilder took 581.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:04:01,720 INFO L168 Benchmark]: BuchiAutomizer took 3854.90 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.8 MB). Peak memory consumption was 114.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:04:01,720 INFO L168 Benchmark]: Witness Printer took 5.65 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-11-28 03:04:01,734 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.44 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 754.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -136.2 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.66 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 581.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3854.90 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.8 MB). Peak memory consumption was 114.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.65 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 -1 * s2 + unknown-#length-unknown[s2] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. 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, 16 SDslu, 34 SDs, 0 SdLazy, 18 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital231 mio100 ax100 hnf99 lsp87 ukn85 mio100 lsp43 div100 bol100 ite100 ukn100 eq192 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...