./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/cstrcmp_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_48fd6e66-3f49-4b74-ac37-6a84b26bb785/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_48fd6e66-3f49-4b74-ac37-6a84b26bb785/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_48fd6e66-3f49-4b74-ac37-6a84b26bb785/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_48fd6e66-3f49-4b74-ac37-6a84b26bb785/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/cstrcmp_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_48fd6e66-3f49-4b74-ac37-6a84b26bb785/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_48fd6e66-3f49-4b74-ac37-6a84b26bb785/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 256a9ac0f321f0d2863fb720d2ae6cb61570c373 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:06:49,720 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:06:49,721 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:06:49,730 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:06:49,730 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:06:49,731 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:06:49,732 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:06:49,734 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:06:49,735 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:06:49,736 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:06:49,737 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:06:49,737 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:06:49,738 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:06:49,739 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:06:49,740 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:06:49,740 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:06:49,741 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:06:49,743 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:06:49,744 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:06:49,746 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:06:49,747 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:06:49,748 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:06:49,750 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:06:49,750 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:06:49,750 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:06:49,751 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:06:49,752 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:06:49,752 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:06:49,753 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:06:49,754 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:06:49,754 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:06:49,755 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:06:49,755 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:06:49,755 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:06:49,756 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:06:49,756 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:06:49,757 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_48fd6e66-3f49-4b74-ac37-6a84b26bb785/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:06:49,769 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:06:49,769 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:06:49,770 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:06:49,770 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:06:49,771 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:06:49,771 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:06:49,771 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:06:49,771 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:06:49,771 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:06:49,771 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:06:49,771 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:06:49,772 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:06:49,772 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:06:49,772 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:06:49,772 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:06:49,772 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:06:49,772 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:06:49,772 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:06:49,772 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:06:49,773 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:06:49,773 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:06:49,773 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:06:49,773 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:06:49,775 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:06:49,775 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:06:49,775 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:06:49,776 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:06:49,779 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:06:49,781 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_48fd6e66-3f49-4b74-ac37-6a84b26bb785/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 256a9ac0f321f0d2863fb720d2ae6cb61570c373 [2018-10-27 06:06:49,816 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:06:49,826 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:06:49,829 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:06:49,830 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:06:49,830 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:06:49,831 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_48fd6e66-3f49-4b74-ac37-6a84b26bb785/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/cstrcmp_true-termination_true-no-overflow.c [2018-10-27 06:06:49,881 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_48fd6e66-3f49-4b74-ac37-6a84b26bb785/bin-2019/uautomizer/data/604ae70e3/0bdd8d8f33794efd90a18605257d55c4/FLAGfb2718282 [2018-10-27 06:06:50,261 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:06:50,261 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_48fd6e66-3f49-4b74-ac37-6a84b26bb785/sv-benchmarks/c/termination-crafted-lit/cstrcmp_true-termination_true-no-overflow.c [2018-10-27 06:06:50,269 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_48fd6e66-3f49-4b74-ac37-6a84b26bb785/bin-2019/uautomizer/data/604ae70e3/0bdd8d8f33794efd90a18605257d55c4/FLAGfb2718282 [2018-10-27 06:06:50,281 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_48fd6e66-3f49-4b74-ac37-6a84b26bb785/bin-2019/uautomizer/data/604ae70e3/0bdd8d8f33794efd90a18605257d55c4 [2018-10-27 06:06:50,287 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:06:50,288 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:06:50,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:06:50,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:06:50,292 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:06:50,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:06:50" (1/1) ... [2018-10-27 06:06:50,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@211143da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:50, skipping insertion in model container [2018-10-27 06:06:50,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:06:50" (1/1) ... [2018-10-27 06:06:50,307 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:06:50,327 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:06:50,458 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:06:50,468 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:06:50,485 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:06:50,499 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:06:50,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:50 WrapperNode [2018-10-27 06:06:50,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:06:50,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:06:50,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:06:50,502 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:06:50,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:50" (1/1) ... [2018-10-27 06:06:50,517 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:50" (1/1) ... [2018-10-27 06:06:50,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:06:50,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:06:50,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:06:50,538 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:06:50,546 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:50" (1/1) ... [2018-10-27 06:06:50,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:50" (1/1) ... [2018-10-27 06:06:50,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:50" (1/1) ... [2018-10-27 06:06:50,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:50" (1/1) ... [2018-10-27 06:06:50,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:50" (1/1) ... [2018-10-27 06:06:50,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:50" (1/1) ... [2018-10-27 06:06:50,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:50" (1/1) ... [2018-10-27 06:06:50,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:06:50,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:06:50,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:06:50,563 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:06:50,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48fd6e66-3f49-4b74-ac37-6a84b26bb785/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:50,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:06:50,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:06:50,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:06:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:06:51,118 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:06:51,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:51 BoogieIcfgContainer [2018-10-27 06:06:51,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:06:51,119 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:06:51,119 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:06:51,122 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:06:51,123 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:51,123 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:06:50" (1/3) ... [2018-10-27 06:06:51,124 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6dbd507a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:06:51, skipping insertion in model container [2018-10-27 06:06:51,124 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:51,124 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:50" (2/3) ... [2018-10-27 06:06:51,125 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6dbd507a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:06:51, skipping insertion in model container [2018-10-27 06:06:51,125 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:51,125 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:51" (3/3) ... [2018-10-27 06:06:51,127 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcmp_true-termination_true-no-overflow.c [2018-10-27 06:06:51,177 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:06:51,178 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:06:51,178 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:06:51,178 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:06:51,178 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:06:51,178 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:06:51,178 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:06:51,178 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:06:51,178 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:06:51,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-10-27 06:06:51,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:06:51,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:51,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:51,221 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:51,222 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:06:51,222 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:06:51,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-10-27 06:06:51,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:06:51,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:51,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:51,226 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:51,226 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:06:51,234 INFO L793 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_#t~ret13;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 17#L14true assume !(build_nondet_String_~length~0 < 1); 14#L14-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 9#L18true SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18 8#L18-1true build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 25#L19true main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 13#L14-3true assume !(build_nondet_String_~length~0 < 1); 27#L14-5true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 5#L18-2true SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18-2 3#L18-3true build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 23#L19-1true main_#t~ret12.base, main_#t~ret12.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset, cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset, cstrcmp_#t~mem2, cstrcmp_#t~mem3, cstrcmp_#t~mem4, cstrcmp_#t~short5, cstrcmp_#t~mem8, cstrcmp_#t~mem9, cstrcmp_#t~ite10, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 30#L32-10true [2018-10-27 06:06:51,234 INFO L795 eck$LassoCheckResult]: Loop: 30#L32-10true assume true; 12#L32-1true SUMMARY for call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1); srcloc: L32-1 26#L32-2true cstrcmp_#t~short5 := cstrcmp_#t~mem2 != 0; 24#L32-3true assume !cstrcmp_#t~short5; 32#L32-8true assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~mem2;havoc cstrcmp_#t~short5;havoc cstrcmp_#t~mem4;cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset + 1;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset;cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset + 1;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset; 30#L32-10true [2018-10-27 06:06:51,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:51,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1755105166, now seen corresponding path program 1 times [2018-10-27 06:06:51,244 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:51,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:51,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:51,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:51,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:51,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:51,383 INFO L82 PathProgramCache]: Analyzing trace with hash 55412514, now seen corresponding path program 1 times [2018-10-27 06:06:51,383 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:51,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:51,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:51,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:51,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:51,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:51,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:06:51,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:06:51,454 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:06:51,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:06:51,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:06:51,467 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2018-10-27 06:06:51,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:51,518 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-10-27 06:06:51,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:06:51,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2018-10-27 06:06:51,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:06:51,526 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 22 transitions. [2018-10-27 06:06:51,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-10-27 06:06:51,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-10-27 06:06:51,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2018-10-27 06:06:51,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:06:51,529 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-10-27 06:06:51,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2018-10-27 06:06:51,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-27 06:06:51,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-27 06:06:51,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-10-27 06:06:51,551 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-10-27 06:06:51,551 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-10-27 06:06:51,551 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:06:51,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2018-10-27 06:06:51,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:06:51,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:51,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:51,553 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:51,553 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:51,554 INFO L793 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 85#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_#t~ret13;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 86#L14 assume !(build_nondet_String_~length~0 < 1); 89#L14-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 79#L18 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18 76#L18-1 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 77#L19 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 82#L14-3 assume !(build_nondet_String_~length~0 < 1); 84#L14-5 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 74#L18-2 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18-2 70#L18-3 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 71#L19-1 main_#t~ret12.base, main_#t~ret12.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset, cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset, cstrcmp_#t~mem2, cstrcmp_#t~mem3, cstrcmp_#t~mem4, cstrcmp_#t~short5, cstrcmp_#t~mem8, cstrcmp_#t~mem9, cstrcmp_#t~ite10, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 80#L32-10 [2018-10-27 06:06:51,554 INFO L795 eck$LassoCheckResult]: Loop: 80#L32-10 assume true; 87#L32-1 SUMMARY for call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1); srcloc: L32-1 83#L32-2 cstrcmp_#t~short5 := cstrcmp_#t~mem2 != 0; 81#L32-3 assume cstrcmp_#t~short5; 78#L32-4 SUMMARY for call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1); srcloc: L32-4 75#L32-5 SUMMARY for call cstrcmp_#t~mem4 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1); srcloc: L32-5 72#L32-6 cstrcmp_#t~short5 := cstrcmp_#t~mem3 == cstrcmp_#t~mem4; 73#L32-8 assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~mem2;havoc cstrcmp_#t~short5;havoc cstrcmp_#t~mem4;cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset + 1;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset;cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset + 1;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset; 80#L32-10 [2018-10-27 06:06:51,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:51,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1755105166, now seen corresponding path program 2 times [2018-10-27 06:06:51,554 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:51,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:51,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:51,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:51,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:51,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:51,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1521883183, now seen corresponding path program 1 times [2018-10-27 06:06:51,602 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:51,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:51,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:51,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:51,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:51,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:51,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1129120444, now seen corresponding path program 1 times [2018-10-27 06:06:51,624 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:51,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:51,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:51,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:51,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:52,041 WARN L179 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2018-10-27 06:06:52,874 WARN L179 SmtUtils]: Spent 750.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 118 [2018-10-27 06:06:53,014 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-10-27 06:06:53,028 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:53,029 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:53,029 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:53,029 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:53,029 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:53,029 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:53,029 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:53,030 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:53,030 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcmp_true-termination_true-no-overflow.c_Iteration2_Lasso [2018-10-27 06:06:53,030 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:53,030 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:53,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:53,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:53,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:53,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:53,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:53,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:53,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:53,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:53,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:53,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:53,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:53,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:53,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:53,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:53,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:53,536 WARN L179 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2018-10-27 06:06:53,836 WARN L179 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2018-10-27 06:06:53,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:53,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:53,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:53,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:53,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:54,313 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:54,317 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:54,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:54,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:54,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:54,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:54,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:54,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:54,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:54,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:54,325 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:54,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:54,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:54,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:54,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:54,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:54,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:54,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:54,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:54,328 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:54,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:54,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:54,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:54,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:54,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:54,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:54,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:54,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:54,330 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:54,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:54,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:54,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:54,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:54,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:54,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:54,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:54,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:54,333 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:54,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:54,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:54,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:54,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:54,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:54,335 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:54,336 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:54,338 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:54,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:54,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:54,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:54,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:54,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:54,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:54,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:54,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:54,341 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:54,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:54,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:54,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:54,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:54,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:54,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:54,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:54,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:54,344 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:54,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:54,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:54,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:54,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:54,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:54,346 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:54,347 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:54,350 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:54,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:54,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:54,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:54,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:54,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:54,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:54,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:54,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:54,352 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:54,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:54,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:54,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:54,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:54,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:54,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:54,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:54,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:54,354 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:54,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:54,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:54,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:54,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:54,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:54,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:54,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:54,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:54,356 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:54,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:54,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:54,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:54,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:54,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:54,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:54,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:54,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:54,359 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:54,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:54,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:54,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:54,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:54,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:54,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:54,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:54,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:54,362 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:54,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:54,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:54,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:54,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:54,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:54,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:54,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:54,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:54,364 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:54,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:54,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:54,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:54,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:54,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:54,374 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:54,374 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:54,470 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:54,513 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:06:54,513 INFO L444 ModelExtractionUtils]: 54 out of 58 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:06:54,515 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:54,520 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:06:54,520 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:54,520 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcmp_~s1.base)_1, ULTIMATE.start_cstrcmp_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcmp_~s1.base)_1 - 1*ULTIMATE.start_cstrcmp_~s1.offset Supporting invariants [] [2018-10-27 06:06:54,666 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2018-10-27 06:06:54,671 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:06:54,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:54,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:54,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:54,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:54,839 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 [2018-10-27 06:06:54,840 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-10-27 06:06:54,873 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 28 states and 31 transitions. Complement of second has 6 states. [2018-10-27 06:06:54,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:54,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:06:54,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2018-10-27 06:06:54,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 12 letters. Loop has 8 letters. [2018-10-27 06:06:54,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:54,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 20 letters. Loop has 8 letters. [2018-10-27 06:06:54,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:54,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 12 letters. Loop has 16 letters. [2018-10-27 06:06:54,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:54,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 31 transitions. [2018-10-27 06:06:54,878 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:06:54,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2018-10-27 06:06:54,879 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:06:54,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:06:54,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:06:54,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:06:54,879 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:06:54,879 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:06:54,879 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:06:54,879 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:06:54,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:06:54,879 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:06:54,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:06:54,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:06:54 BoogieIcfgContainer [2018-10-27 06:06:54,886 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:06:54,886 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:06:54,886 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:06:54,886 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:06:54,887 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:51" (3/4) ... [2018-10-27 06:06:54,889 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:06:54,889 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:06:54,890 INFO L168 Benchmark]: Toolchain (without parser) took 4603.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 960.7 MB in the beginning and 918.4 MB in the end (delta: 42.4 MB). Peak memory consumption was 194.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:54,891 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:06:54,891 INFO L168 Benchmark]: CACSL2BoogieTranslator took 212.38 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 950.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:54,892 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.50 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 947.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:54,892 INFO L168 Benchmark]: Boogie Preprocessor took 24.70 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:06:54,893 INFO L168 Benchmark]: RCFGBuilder took 555.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -180.8 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:54,893 INFO L168 Benchmark]: BuchiAutomizer took 3766.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 921.9 MB in the end (delta: 206.3 MB). Peak memory consumption was 206.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:54,894 INFO L168 Benchmark]: Witness Printer took 3.22 ms. Allocated memory is still 1.2 GB. Free memory was 921.9 MB in the beginning and 918.4 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:54,898 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 212.38 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 950.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.50 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 947.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.70 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 555.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -180.8 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3766.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 921.9 MB in the end (delta: 206.3 MB). Peak memory consumption was 206.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.22 ms. Allocated memory is still 1.2 GB. Free memory was 921.9 MB in the beginning and 918.4 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[s1] + -1 * s1 and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 51 SDtfs, 25 SDslu, 32 SDs, 0 SdLazy, 14 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital220 mio100 ax100 hnf100 lsp97 ukn107 mio100 lsp44 div100 bol100 ite100 ukn100 eq202 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms 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...