./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrcmp_mixed_alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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/cstrcmp_mixed_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 051dd1d5deb7603ef8d45e2ac843d269d4cbaf6c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:39:17,084 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:39:17,086 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:39:17,099 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:39:17,100 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:39:17,101 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:39:17,102 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:39:17,105 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:39:17,107 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:39:17,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:39:17,109 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:39:17,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:39:17,111 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:39:17,112 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:39:17,113 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:39:17,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:39:17,116 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:39:17,117 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:39:17,119 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:39:17,121 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:39:17,123 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:39:17,124 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:39:17,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:39:17,126 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:39:17,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:39:17,129 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:39:17,130 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:39:17,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:39:17,131 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:39:17,133 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:39:17,133 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:39:17,134 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:39:17,135 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:39:17,136 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:39:17,137 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:39:17,137 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:39:17,138 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:39:17,138 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:39:17,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:39:17,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:39:17,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:39:17,141 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:39:17,161 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:39:17,161 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:39:17,163 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:39:17,163 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:39:17,163 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:39:17,164 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:39:17,164 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:39:17,164 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:39:17,165 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:39:17,165 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:39:17,165 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:39:17,166 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:39:17,166 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:39:17,166 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:39:17,167 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:39:17,167 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:39:17,167 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:39:17,167 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:39:17,168 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:39:17,168 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:39:17,168 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:39:17,168 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:39:17,169 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:39:17,169 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:39:17,169 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:39:17,170 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:39:17,170 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:39:17,170 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:39:17,171 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:39:17,172 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:39:17,172 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 -> 051dd1d5deb7603ef8d45e2ac843d269d4cbaf6c [2020-07-29 01:39:17,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:39:17,524 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:39:17,528 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:39:17,530 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:39:17,530 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:39:17,531 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrcmp_mixed_alloca.i [2020-07-29 01:39:17,606 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/962ccf61f/c78de11344684c4ba2a07b53d2881449/FLAG3ae9ad011 [2020-07-29 01:39:18,160 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:39:18,161 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcmp_mixed_alloca.i [2020-07-29 01:39:18,183 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/962ccf61f/c78de11344684c4ba2a07b53d2881449/FLAG3ae9ad011 [2020-07-29 01:39:18,441 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/962ccf61f/c78de11344684c4ba2a07b53d2881449 [2020-07-29 01:39:18,445 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:39:18,449 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:39:18,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:39:18,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:39:18,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:39:18,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:39:18" (1/1) ... [2020-07-29 01:39:18,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a04d904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:18, skipping insertion in model container [2020-07-29 01:39:18,462 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:39:18" (1/1) ... [2020-07-29 01:39:18,472 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:39:18,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:39:19,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:39:19,041 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:39:19,131 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:39:19,223 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:39:19,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:19 WrapperNode [2020-07-29 01:39:19,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:39:19,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:39:19,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:39:19,227 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:39:19,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:19" (1/1) ... [2020-07-29 01:39:19,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:19" (1/1) ... [2020-07-29 01:39:19,293 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:39:19,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:39:19,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:39:19,294 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:39:19,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:19" (1/1) ... [2020-07-29 01:39:19,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:19" (1/1) ... [2020-07-29 01:39:19,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:19" (1/1) ... [2020-07-29 01:39:19,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:19" (1/1) ... [2020-07-29 01:39:19,313 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:19" (1/1) ... [2020-07-29 01:39:19,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:19" (1/1) ... [2020-07-29 01:39:19,319 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:19" (1/1) ... [2020-07-29 01:39:19,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:39:19,323 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:39:19,323 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:39:19,323 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:39:19,324 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:19" (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 [2020-07-29 01:39:19,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:39:19,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:39:19,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:39:19,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:39:19,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:39:19,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:39:19,858 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:39:19,858 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-29 01:39:19,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:19 BoogieIcfgContainer [2020-07-29 01:39:19,861 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:39:19,862 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:39:19,862 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:39:19,866 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:39:19,867 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:19,867 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:39:18" (1/3) ... [2020-07-29 01:39:19,869 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28e8c31b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:39:19, skipping insertion in model container [2020-07-29 01:39:19,869 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:19,869 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:19" (2/3) ... [2020-07-29 01:39:19,870 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28e8c31b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:39:19, skipping insertion in model container [2020-07-29 01:39:19,870 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:19,870 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:19" (3/3) ... [2020-07-29 01:39:19,872 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrcmp_mixed_alloca.i [2020-07-29 01:39:19,927 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:39:19,927 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:39:19,928 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:39:19,928 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:39:19,928 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:39:19,929 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:39:19,929 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:39:19,929 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:39:19,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 01:39:19,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:19,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:19,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:19,977 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:39:19,977 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:39:19,978 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:39:19,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 01:39:19,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:19,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:19,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:19,982 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:39:19,982 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:39:19,992 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~length2~0 := main_#t~nondet215;havoc main_#t~nondet215; 17#L378true assume !(main_~length1~0 < 1); 4#L378-2true assume !(main_~length2~0 < 1); 13#L381-1true call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset, cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset, cstrcmp_#t~mem205, cstrcmp_#t~mem206, cstrcmp_#t~mem207, cstrcmp_#t~short208, cstrcmp_#t~mem211, cstrcmp_#t~mem212, cstrcmp_#t~ite213, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 7#L367-5true [2020-07-29 01:39:19,993 INFO L796 eck$LassoCheckResult]: Loop: 7#L367-5true call cstrcmp_#t~mem205 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short208 := 0 != cstrcmp_#t~mem205; 3#L367-1true assume cstrcmp_#t~short208;call cstrcmp_#t~mem206 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem207 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short208 := cstrcmp_#t~mem206 == cstrcmp_#t~mem207; 5#L367-3true assume !!cstrcmp_#t~short208;havoc cstrcmp_#t~mem207;havoc cstrcmp_#t~short208;havoc cstrcmp_#t~mem205;havoc cstrcmp_#t~mem206;cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post209.base, 1 + cstrcmp_#t~post209.offset;havoc cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset;cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset - 1;havoc cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset; 7#L367-5true [2020-07-29 01:39:19,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:20,000 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-07-29 01:39:20,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:20,011 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111832122] [2020-07-29 01:39:20,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:20,137 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:20,166 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:20,193 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:20,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:20,195 INFO L82 PathProgramCache]: Analyzing trace with hash 49755, now seen corresponding path program 1 times [2020-07-29 01:39:20,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:20,195 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249604123] [2020-07-29 01:39:20,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:20,207 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:20,224 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:20,233 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:20,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:20,237 INFO L82 PathProgramCache]: Analyzing trace with hash 180429558, now seen corresponding path program 1 times [2020-07-29 01:39:20,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:20,239 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291661416] [2020-07-29 01:39:20,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:20,318 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:20,363 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:20,371 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:20,532 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2020-07-29 01:39:20,962 WARN L193 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 86 [2020-07-29 01:39:21,119 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-07-29 01:39:21,132 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:39:21,133 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:39:21,133 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:39:21,133 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:39:21,134 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:39:21,134 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:21,134 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:39:21,134 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:39:21,134 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcmp_mixed_alloca.i_Iteration1_Lasso [2020-07-29 01:39:21,135 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:39:21,135 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:39:21,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:21,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:21,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:21,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:21,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:21,635 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2020-07-29 01:39:21,806 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2020-07-29 01:39:21,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:21,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:21,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:21,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:21,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:21,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:21,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:21,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:21,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:21,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:21,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:21,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:21,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:21,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:21,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:21,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:22,987 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:39:22,992 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 [2020-07-29 01:39:23,000 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 [2020-07-29 01:39:23,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:23,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:23,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:23,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:23,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:23,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:23,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:23,024 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:23,068 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 [2020-07-29 01:39:23,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:23,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:23,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:23,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:23,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:23,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:23,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:23,076 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:23,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 [2020-07-29 01:39:23,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:23,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:23,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:23,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:23,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:23,110 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:23,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:23,112 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:23,138 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 [2020-07-29 01:39:23,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:23,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:23,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:23,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:23,146 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:23,146 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:23,152 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) [2020-07-29 01:39:23,210 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 [2020-07-29 01:39:23,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:23,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:23,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:23,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:23,223 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:23,224 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 [2020-07-29 01:39:23,231 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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:23,269 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 [2020-07-29 01:39:23,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:23,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:23,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:23,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:23,273 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:23,273 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:23,277 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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:23,305 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 [2020-07-29 01:39:23,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:23,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:23,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:23,307 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:39:23,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:23,310 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 01:39:23,310 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:23,314 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:23,344 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 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:23,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:23,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:23,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:23,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:23,360 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:23,360 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:23,376 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 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:23,408 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 [2020-07-29 01:39:23,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:23,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:23,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:23,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:23,415 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:23,415 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:23,423 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 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:23,469 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 [2020-07-29 01:39:23,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:23,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:23,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:23,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:23,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:23,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:23,508 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:39:23,573 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2020-07-29 01:39:23,573 INFO L444 ModelExtractionUtils]: 25 out of 43 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:23,579 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:23,586 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:39:23,587 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:39:23,587 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcmp_~s2.offset) = 2*ULTIMATE.start_cstrcmp_~s2.offset + 1 Supporting invariants [] [2020-07-29 01:39:23,719 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2020-07-29 01:39:23,724 INFO L393 LassoCheck]: Loop: "call cstrcmp_#t~mem205 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short208 := 0 != cstrcmp_#t~mem205;" "assume cstrcmp_#t~short208;call cstrcmp_#t~mem206 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem207 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short208 := cstrcmp_#t~mem206 == cstrcmp_#t~mem207;" "assume !!cstrcmp_#t~short208;havoc cstrcmp_#t~mem207;havoc cstrcmp_#t~short208;havoc cstrcmp_#t~mem205;havoc cstrcmp_#t~mem206;cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post209.base, 1 + cstrcmp_#t~post209.offset;havoc cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset;cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset - 1;havoc cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset;" [2020-07-29 01:39:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:23,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:23,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:39:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:23,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:23,814 INFO L280 TraceCheckUtils]: 0: Hoare triple {25#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {25#unseeded} is VALID [2020-07-29 01:39:23,816 INFO L280 TraceCheckUtils]: 1: Hoare triple {25#unseeded} havoc main_#res;havoc main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~length2~0 := main_#t~nondet215;havoc main_#t~nondet215; {25#unseeded} is VALID [2020-07-29 01:39:23,829 INFO L280 TraceCheckUtils]: 2: Hoare triple {25#unseeded} assume !(main_~length1~0 < 1); {25#unseeded} is VALID [2020-07-29 01:39:23,830 INFO L280 TraceCheckUtils]: 3: Hoare triple {25#unseeded} assume !(main_~length2~0 < 1); {25#unseeded} is VALID [2020-07-29 01:39:23,831 INFO L280 TraceCheckUtils]: 4: Hoare triple {25#unseeded} call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset, cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset, cstrcmp_#t~mem205, cstrcmp_#t~mem206, cstrcmp_#t~mem207, cstrcmp_#t~short208, cstrcmp_#t~mem211, cstrcmp_#t~mem212, cstrcmp_#t~ite213, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; {25#unseeded} is VALID [2020-07-29 01:39:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:23,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:39:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:23,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:23,878 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#(>= oldRank0 (+ (* 2 ULTIMATE.start_cstrcmp_~s2.offset) 1))} call cstrcmp_#t~mem205 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short208 := 0 != cstrcmp_#t~mem205; {28#(>= oldRank0 (+ (* 2 ULTIMATE.start_cstrcmp_~s2.offset) 1))} is VALID [2020-07-29 01:39:23,880 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#(>= oldRank0 (+ (* 2 ULTIMATE.start_cstrcmp_~s2.offset) 1))} assume cstrcmp_#t~short208;call cstrcmp_#t~mem206 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem207 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short208 := cstrcmp_#t~mem206 == cstrcmp_#t~mem207; {123#(and (<= (+ (* 2 ULTIMATE.start_cstrcmp_~s2.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrcmp_~s2.offset))} is VALID [2020-07-29 01:39:23,881 INFO L280 TraceCheckUtils]: 2: Hoare triple {123#(and (<= (+ (* 2 ULTIMATE.start_cstrcmp_~s2.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrcmp_~s2.offset))} assume !!cstrcmp_#t~short208;havoc cstrcmp_#t~mem207;havoc cstrcmp_#t~short208;havoc cstrcmp_#t~mem205;havoc cstrcmp_#t~mem206;cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post209.base, 1 + cstrcmp_#t~post209.offset;havoc cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset;cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset - 1;havoc cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset; {103#(or (and (> oldRank0 (+ (* 2 ULTIMATE.start_cstrcmp_~s2.offset) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:39:23,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:39:23,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:39:23,906 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:23,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:39:23,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:23,917 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 [2020-07-29 01:39:23,918 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 4 states. [2020-07-29 01:39:24,027 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 4 states. Result 39 states and 52 transitions. Complement of second has 7 states. [2020-07-29 01:39:24,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:39:24,028 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:24,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 01:39:24,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:24,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:24,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:24,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:39:24,038 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:39:24,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:24,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:24,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 52 transitions. [2020-07-29 01:39:24,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:24,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:24,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:24,042 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states. [2020-07-29 01:39:24,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:24,046 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:39:24,046 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:39:24,048 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:39:24,049 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:39:24,049 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 39 states and 52 transitions. cyclomatic complexity: 15 [2020-07-29 01:39:24,050 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:39:24,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:39:24,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:39:24,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 52 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:39:24,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:39:24,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:39:24,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 52 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:39:24,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:24,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:24,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 52 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:24,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 39 letters. Loop has 39 letters. [2020-07-29 01:39:24,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 39 letters. Loop has 39 letters. [2020-07-29 01:39:24,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 52 transitions. cyclomatic complexity: 15 Stem has 39 letters. Loop has 39 letters. [2020-07-29 01:39:24,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:39:24,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:39:24,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 52 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:39:24,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:39:24,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:39:24,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 52 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:39:24,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:39:24,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:39:24,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 52 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:39:24,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:24,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:24,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 52 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:24,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:39:24,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:39:24,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 52 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:39:24,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:39:24,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:39:24,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 52 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:39:24,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:39:24,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:39:24,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 52 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:39:24,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:24,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:24,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 52 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:24,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:24,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:24,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 52 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:24,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:24,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:24,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 52 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:24,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,075 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:24,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:39:24,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2020-07-29 01:39:24,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:39:24,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:24,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 5 letters. Loop has 6 letters. [2020-07-29 01:39:24,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:24,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 52 transitions. cyclomatic complexity: 15 [2020-07-29 01:39:24,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:24,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 15 states and 20 transitions. [2020-07-29 01:39:24,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 01:39:24,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:39:24,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2020-07-29 01:39:24,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:39:24,112 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-29 01:39:24,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2020-07-29 01:39:24,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2020-07-29 01:39:24,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:24,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 20 transitions. Second operand 14 states. [2020-07-29 01:39:24,142 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 20 transitions. Second operand 14 states. [2020-07-29 01:39:24,145 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand 14 states. [2020-07-29 01:39:24,149 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:24,152 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2020-07-29 01:39:24,153 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2020-07-29 01:39:24,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:24,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:24,154 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 15 states and 20 transitions. [2020-07-29 01:39:24,154 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 15 states and 20 transitions. [2020-07-29 01:39:24,156 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:24,159 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2020-07-29 01:39:24,159 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2020-07-29 01:39:24,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:24,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:24,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:24,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:24,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 01:39:24,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2020-07-29 01:39:24,162 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-07-29 01:39:24,162 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-07-29 01:39:24,162 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:39:24,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2020-07-29 01:39:24,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:24,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:24,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:24,166 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:39:24,166 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:39:24,167 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 176#L-1 havoc main_#res;havoc main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~length2~0 := main_#t~nondet215;havoc main_#t~nondet215; 177#L378 assume !(main_~length1~0 < 1); 184#L378-2 assume !(main_~length2~0 < 1); 185#L381-1 call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset, cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset, cstrcmp_#t~mem205, cstrcmp_#t~mem206, cstrcmp_#t~mem207, cstrcmp_#t~short208, cstrcmp_#t~mem211, cstrcmp_#t~mem212, cstrcmp_#t~ite213, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 186#L367-5 call cstrcmp_#t~mem205 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short208 := 0 != cstrcmp_#t~mem205; 178#L367-1 [2020-07-29 01:39:24,167 INFO L796 eck$LassoCheckResult]: Loop: 178#L367-1 assume !cstrcmp_#t~short208; 179#L367-3 assume !!cstrcmp_#t~short208;havoc cstrcmp_#t~mem207;havoc cstrcmp_#t~short208;havoc cstrcmp_#t~mem205;havoc cstrcmp_#t~mem206;cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post209.base, 1 + cstrcmp_#t~post209.offset;havoc cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset;cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset - 1;havoc cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset; 187#L367-5 call cstrcmp_#t~mem205 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short208 := 0 != cstrcmp_#t~mem205; 178#L367-1 [2020-07-29 01:39:24,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:24,167 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 1 times [2020-07-29 01:39:24,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:24,169 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691489244] [2020-07-29 01:39:24,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:24,224 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:24,254 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:24,259 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:24,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:24,260 INFO L82 PathProgramCache]: Analyzing trace with hash 54797, now seen corresponding path program 1 times [2020-07-29 01:39:24,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:24,260 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534851198] [2020-07-29 01:39:24,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:24,295 INFO L280 TraceCheckUtils]: 0: Hoare triple {265#true} assume !cstrcmp_#t~short208; {267#(not |ULTIMATE.start_cstrcmp_#t~short208|)} is VALID [2020-07-29 01:39:24,296 INFO L280 TraceCheckUtils]: 1: Hoare triple {267#(not |ULTIMATE.start_cstrcmp_#t~short208|)} assume !!cstrcmp_#t~short208;havoc cstrcmp_#t~mem207;havoc cstrcmp_#t~short208;havoc cstrcmp_#t~mem205;havoc cstrcmp_#t~mem206;cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post209.base, 1 + cstrcmp_#t~post209.offset;havoc cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset;cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset - 1;havoc cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset; {266#false} is VALID [2020-07-29 01:39:24,296 INFO L280 TraceCheckUtils]: 2: Hoare triple {266#false} call cstrcmp_#t~mem205 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short208 := 0 != cstrcmp_#t~mem205; {266#false} is VALID [2020-07-29 01:39:24,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:39:24,298 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534851198] [2020-07-29 01:39:24,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:39:24,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:39:24,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862019811] [2020-07-29 01:39:24,302 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:39:24,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:39:24,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:39:24,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:39:24,306 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-07-29 01:39:24,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:24,339 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2020-07-29 01:39:24,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:39:24,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:39:24,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:24,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 15 transitions. [2020-07-29 01:39:24,347 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:39:24,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2020-07-29 01:39:24,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:39:24,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:39:24,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:39:24,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:39:24,347 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:39:24,348 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:39:24,348 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:39:24,348 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:39:24,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:39:24,348 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:39:24,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:39:24,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:39:24 BoogieIcfgContainer [2020-07-29 01:39:24,356 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:39:24,356 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:39:24,356 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:39:24,356 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:39:24,357 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:19" (3/4) ... [2020-07-29 01:39:24,360 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:39:24,361 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:39:24,364 INFO L168 Benchmark]: Toolchain (without parser) took 5916.19 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.9 MB). Free memory was 954.9 MB in the beginning and 915.2 MB in the end (delta: 39.7 MB). Peak memory consumption was 264.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:24,364 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:39:24,365 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -172.3 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:24,366 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.07 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. [2020-07-29 01:39:24,366 INFO L168 Benchmark]: Boogie Preprocessor took 28.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:24,367 INFO L168 Benchmark]: RCFGBuilder took 538.86 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: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:24,368 INFO L168 Benchmark]: BuchiAutomizer took 4493.60 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 915.2 MB in the end (delta: 181.0 MB). Peak memory consumption was 253.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:24,368 INFO L168 Benchmark]: Witness Printer took 4.57 ms. Allocated memory is still 1.3 GB. Free memory is still 915.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:39:24,373 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 774.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -172.3 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 538.86 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: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4493.60 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 915.2 MB in the end (delta: 181.0 MB). Peak memory consumption was 253.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.57 ms. Allocated memory is still 1.3 GB. Free memory is still 915.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 2 * s2 + 1 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 27 SDtfs, 18 SDslu, 18 SDs, 0 SdLazy, 11 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital219 mio100 ax100 hnf99 lsp97 ukn84 mio100 lsp49 div100 bol100 ite100 ukn100 eq187 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...