./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrcmp-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrcmp-alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c1eb142aa621a3b7c962754bdbb3857cadaf1720 .............................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:52:07,271 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:52:07,273 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:52:07,285 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:52:07,286 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:52:07,287 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:52:07,288 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:52:07,291 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:52:07,293 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:52:07,294 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:52:07,295 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:52:07,295 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:52:07,297 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:52:07,297 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:52:07,299 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:52:07,300 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:52:07,301 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:52:07,303 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:52:07,305 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:52:07,307 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:52:07,308 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:52:07,310 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:52:07,313 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:52:07,313 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:52:07,313 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:52:07,314 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:52:07,316 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:52:07,317 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:52:07,318 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:52:07,319 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:52:07,319 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:52:07,320 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:52:07,320 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:52:07,321 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:52:07,322 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:52:07,322 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:52:07,323 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:52:07,357 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:52:07,357 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:52:07,358 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:52:07,359 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:52:07,359 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:52:07,359 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:52:07,359 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:52:07,359 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:52:07,360 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:52:07,360 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:52:07,360 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:52:07,360 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:52:07,361 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:52:07,361 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:52:07,361 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:52:07,361 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:52:07,361 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:52:07,362 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:52:07,365 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:52:07,365 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:52:07,365 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:52:07,366 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:52:07,366 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:52:07,366 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:52:07,366 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:52:07,366 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:52:07,367 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:52:07,367 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:52:07,368 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:52:07,368 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c1eb142aa621a3b7c962754bdbb3857cadaf1720 [2019-01-01 21:52:07,413 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:52:07,430 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:52:07,437 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:52:07,439 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:52:07,441 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:52:07,441 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrcmp-alloca_true-termination.c.i [2019-01-01 21:52:07,502 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921bebfb1/93597603850d45a38f86fcb55e75f3d5/FLAG3ffdfd9fc [2019-01-01 21:52:07,983 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:52:07,984 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrcmp-alloca_true-termination.c.i [2019-01-01 21:52:08,005 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921bebfb1/93597603850d45a38f86fcb55e75f3d5/FLAG3ffdfd9fc [2019-01-01 21:52:08,298 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921bebfb1/93597603850d45a38f86fcb55e75f3d5 [2019-01-01 21:52:08,301 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:52:08,302 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:52:08,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:52:08,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:52:08,307 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:52:08,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:52:08" (1/1) ... [2019-01-01 21:52:08,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25da1d51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:08, skipping insertion in model container [2019-01-01 21:52:08,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:52:08" (1/1) ... [2019-01-01 21:52:08,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:52:08,365 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:52:08,688 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:52:08,705 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:52:08,844 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:52:08,914 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:52:08,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:08 WrapperNode [2019-01-01 21:52:08,915 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:52:08,916 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:52:08,916 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:52:08,916 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:52:08,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:08" (1/1) ... [2019-01-01 21:52:08,951 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:08" (1/1) ... [2019-01-01 21:52:08,974 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:52:08,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:52:08,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:52:08,975 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:52:08,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:08" (1/1) ... [2019-01-01 21:52:08,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:08" (1/1) ... [2019-01-01 21:52:08,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:08" (1/1) ... [2019-01-01 21:52:08,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:08" (1/1) ... [2019-01-01 21:52:09,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:08" (1/1) ... [2019-01-01 21:52:09,014 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:08" (1/1) ... [2019-01-01 21:52:09,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:08" (1/1) ... [2019-01-01 21:52:09,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:52:09,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:52:09,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:52:09,026 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:52:09,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:52:09,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:52:09,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:52:09,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:52:09,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:52:09,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:52:09,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:52:09,656 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:52:09,656 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-01 21:52:09,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:52:09 BoogieIcfgContainer [2019-01-01 21:52:09,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:52:09,657 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:52:09,657 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:52:09,662 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:52:09,663 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:52:09,663 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:52:08" (1/3) ... [2019-01-01 21:52:09,664 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b9260d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:52:09, skipping insertion in model container [2019-01-01 21:52:09,665 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:52:09,665 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:08" (2/3) ... [2019-01-01 21:52:09,665 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b9260d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:52:09, skipping insertion in model container [2019-01-01 21:52:09,665 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:52:09,665 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:52:09" (3/3) ... [2019-01-01 21:52:09,667 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrcmp-alloca_true-termination.c.i [2019-01-01 21:52:09,732 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:52:09,733 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:52:09,733 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:52:09,733 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:52:09,733 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:52:09,734 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:52:09,734 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:52:09,734 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:52:09,734 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:52:09,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-01 21:52:09,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:52:09,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:52:09,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:52:09,801 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:52:09,801 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:52:09,802 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:52:09,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-01 21:52:09,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:52:09,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:52:09,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:52:09,806 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:52:09,806 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:52:09,816 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 3#L558true assume !(main_~length1~0 < 1); 7#L558-2true assume !(main_~length2~0 < 1); 13#L561-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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 + (main_~length2~0 - 1), 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~post5.base, cstrcmp_#t~post5.offset, cstrcmp_#t~mem6, cstrcmp_#t~mem3, cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, cstrcmp_#t~mem4, cstrcmp_#t~mem8, cstrcmp_#t~pre7.base, cstrcmp_#t~pre7.offset, cstrcmp_#t~mem9, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset;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; 4#L550-3true [2019-01-01 21:52:09,817 INFO L796 eck$LassoCheckResult]: Loop: 4#L550-3true call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post2.base, 1 + cstrcmp_#t~post2.offset;call cstrcmp_#t~mem4 := read~int(cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, 1); 15#L550-1true assume !!(cstrcmp_#t~mem3 == cstrcmp_#t~mem4);havoc cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset;havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~mem3;cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post5.base, 1 + cstrcmp_#t~post5.offset;call cstrcmp_#t~mem6 := read~int(cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset, 1); 11#L551true assume !(0 == cstrcmp_#t~mem6);havoc cstrcmp_#t~mem6;havoc cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset; 4#L550-3true [2019-01-01 21:52:09,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:52:09,825 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-01 21:52:09,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:52:09,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:52:09,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:09,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:52:09,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:10,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:52:10,062 INFO L82 PathProgramCache]: Analyzing trace with hash 49816, now seen corresponding path program 1 times [2019-01-01 21:52:10,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:52:10,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:52:10,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:10,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:52:10,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:10,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:52:10,124 INFO L82 PathProgramCache]: Analyzing trace with hash 180429619, now seen corresponding path program 1 times [2019-01-01 21:52:10,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:52:10,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:52:10,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:10,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:52:10,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:10,902 WARN L181 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-01-01 21:52:11,661 WARN L181 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-01-01 21:52:11,936 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-01-01 21:52:11,950 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:52:11,951 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:52:11,952 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:52:11,952 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:52:11,952 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:52:11,952 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:52:11,953 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:52:11,953 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:52:11,953 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcmp-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-01 21:52:11,953 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:52:11,953 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:52:11,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:12,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:12,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:12,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:12,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:12,628 WARN L181 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-01-01 21:52:12,832 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-01 21:52:12,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:12,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:12,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:12,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:12,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:12,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:12,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:12,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:12,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:12,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:12,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:12,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:12,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:12,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:12,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:12,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:12,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:13,225 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-01 21:52:13,978 WARN L181 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-01-01 21:52:14,118 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:52:14,124 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:52:14,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:14,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:14,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:14,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:14,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:14,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:14,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:14,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:14,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:14,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:14,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:14,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:14,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:14,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:14,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:14,137 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:14,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:14,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:14,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:14,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:14,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:14,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:14,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:14,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:52:14,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:52:14,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:14,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:14,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:14,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:14,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:14,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:14,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:14,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:14,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:14,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:14,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:14,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:14,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:14,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:14,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:14,164 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:52:14,164 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:52:14,241 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:52:14,309 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:52:14,309 INFO L444 ModelExtractionUtils]: 39 out of 46 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 21:52:14,314 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:52:14,317 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:52:14,317 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:52:14,318 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcmp_~s2.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1) = -1*ULTIMATE.start_cstrcmp_~s2.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 Supporting invariants [] [2019-01-01 21:52:14,490 INFO L297 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2019-01-01 21:52:14,502 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:52:14,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:52:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:52:14,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:52:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:52:14,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:52:14,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:52:14,721 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:52:14,722 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 4 states. [2019-01-01 21:52:14,806 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 4 states. Result 22 states and 28 transitions. Complement of second has 5 states. [2019-01-01 21:52:14,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 0 non-accepting loop states 2 accepting loop states [2019-01-01 21:52:14,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:52:14,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-01-01 21:52:14,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-01 21:52:14,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:52:14,821 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:52:14,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:52:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:52:14,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:52:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:52:14,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:52:15,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:52:15,133 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:52:15,133 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 4 states. [2019-01-01 21:52:15,304 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 4 states. Result 25 states and 30 transitions. Complement of second has 10 states. [2019-01-01 21:52:15,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:52:15,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:52:15,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2019-01-01 21:52:15,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-01 21:52:15,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:52:15,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-01 21:52:15,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:52:15,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 5 letters. Loop has 6 letters. [2019-01-01 21:52:15,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:52:15,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 30 transitions. [2019-01-01 21:52:15,311 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:52:15,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2019-01-01 21:52:15,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:52:15,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:52:15,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:52:15,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:52:15,316 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:52:15,316 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:52:15,316 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:52:15,316 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:52:15,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:52:15,316 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:52:15,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:52:15,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:52:15 BoogieIcfgContainer [2019-01-01 21:52:15,322 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:52:15,323 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:52:15,323 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:52:15,323 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:52:15,324 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:52:09" (3/4) ... [2019-01-01 21:52:15,327 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:52:15,327 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:52:15,328 INFO L168 Benchmark]: Toolchain (without parser) took 7026.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -104.3 MB). Peak memory consumption was 86.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:52:15,329 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:52:15,330 INFO L168 Benchmark]: CACSL2BoogieTranslator took 611.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -161.9 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:52:15,331 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:52:15,332 INFO L168 Benchmark]: Boogie Preprocessor took 51.31 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:52:15,332 INFO L168 Benchmark]: RCFGBuilder took 630.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:52:15,333 INFO L168 Benchmark]: BuchiAutomizer took 5665.32 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 27.2 MB). Peak memory consumption was 97.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:52:15,334 INFO L168 Benchmark]: Witness Printer took 4.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:52:15,339 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 611.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -161.9 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.31 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 630.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5665.32 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 27.2 MB). Peak memory consumption was 97.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s2 + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 4.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [0, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 18 SDtfs, 16 SDslu, 5 SDs, 0 SdLazy, 21 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital214 mio100 ax108 hnf99 lsp89 ukn86 mio100 lsp46 div100 bol100 ite100 ukn100 eq195 hnf88 smp100 dnf166 smp97 tf100 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms 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...