./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-libowfat/strcpy_small_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-libowfat/strcpy_small_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 aa04dbf87ae0cd79c6119a8423e5cd762ca238bc ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:41:32,694 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:41:32,696 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:41:32,712 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:41:32,713 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:41:32,714 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:41:32,715 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:41:32,720 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:41:32,722 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:41:32,724 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:41:32,725 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:41:32,725 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:41:32,726 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:41:32,727 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:41:32,729 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:41:32,729 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:41:32,731 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:41:32,733 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:41:32,735 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:41:32,736 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:41:32,737 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:41:32,739 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:41:32,742 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:41:32,742 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:41:32,742 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:41:32,743 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:41:32,744 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:41:32,745 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:41:32,746 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:41:32,747 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:41:32,748 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:41:32,748 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:41:32,749 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:41:32,749 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:41:32,750 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:41:32,751 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:41:32,752 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:41:32,781 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:41:32,781 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:41:32,782 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:41:32,782 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:41:32,782 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:41:32,784 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:41:32,784 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:41:32,784 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:41:32,784 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:41:32,785 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:41:32,785 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:41:32,785 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:41:32,785 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:41:32,785 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:41:32,785 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:41:32,786 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:41:32,787 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:41:32,788 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:41:32,788 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:41:32,788 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:41:32,788 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:41:32,788 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:41:32,788 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:41:32,790 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:41:32,790 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:41:32,791 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:41:32,791 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:41:32,792 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:41:32,793 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:41:32,793 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 -> aa04dbf87ae0cd79c6119a8423e5cd762ca238bc [2019-01-01 21:41:32,836 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:41:32,850 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:41:32,857 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:41:32,859 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:41:32,859 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:41:32,860 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-libowfat/strcpy_small_true-termination.c.i [2019-01-01 21:41:32,934 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc949e61/3cf9d2d013104b3198628cb9459c3d7a/FLAGd5e4f7f6a [2019-01-01 21:41:33,494 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:41:33,495 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-libowfat/strcpy_small_true-termination.c.i [2019-01-01 21:41:33,508 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc949e61/3cf9d2d013104b3198628cb9459c3d7a/FLAGd5e4f7f6a [2019-01-01 21:41:33,790 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc949e61/3cf9d2d013104b3198628cb9459c3d7a [2019-01-01 21:41:33,794 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:41:33,796 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:41:33,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:41:33,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:41:33,802 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:41:33,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:41:33" (1/1) ... [2019-01-01 21:41:33,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70178c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:33, skipping insertion in model container [2019-01-01 21:41:33,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:41:33" (1/1) ... [2019-01-01 21:41:33,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:41:33,873 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:41:34,207 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:41:34,226 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:41:34,298 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:41:34,362 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:41:34,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:34 WrapperNode [2019-01-01 21:41:34,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:41:34,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:41:34,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:41:34,365 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:41:34,441 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:41:34" (1/1) ... [2019-01-01 21:41:34,462 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:41:34" (1/1) ... [2019-01-01 21:41:34,485 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:41:34,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:41:34,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:41:34,486 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:41:34,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:34" (1/1) ... [2019-01-01 21:41:34,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:34" (1/1) ... [2019-01-01 21:41:34,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:34" (1/1) ... [2019-01-01 21:41:34,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:34" (1/1) ... [2019-01-01 21:41:34,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:34" (1/1) ... [2019-01-01 21:41:34,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:34" (1/1) ... [2019-01-01 21:41:34,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:34" (1/1) ... [2019-01-01 21:41:34,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:41:34,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:41:34,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:41:34,518 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:41:34,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:34" (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:41:34,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:41:34,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:41:34,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:41:34,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:41:34,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:41:34,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:41:34,932 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:41:34,932 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-01 21:41:34,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:41:34 BoogieIcfgContainer [2019-01-01 21:41:34,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:41:34,935 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:41:34,935 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:41:34,938 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:41:34,939 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:41:34,939 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:41:33" (1/3) ... [2019-01-01 21:41:34,942 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@156f1237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:41:34, skipping insertion in model container [2019-01-01 21:41:34,942 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:41:34,942 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:34" (2/3) ... [2019-01-01 21:41:34,943 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@156f1237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:41:34, skipping insertion in model container [2019-01-01 21:41:34,943 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:41:34,943 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:41:34" (3/3) ... [2019-01-01 21:41:34,945 INFO L375 chiAutomizerObserver]: Analyzing ICFG strcpy_small_true-termination.c.i [2019-01-01 21:41:35,017 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:41:35,018 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:41:35,018 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:41:35,018 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:41:35,020 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:41:35,020 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:41:35,020 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:41:35,020 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:41:35,020 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:41:35,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-01 21:41:35,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:41:35,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:41:35,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:41:35,066 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:41:35,066 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:41:35,066 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:41:35,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-01 21:41:35,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:41:35,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:41:35,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:41:35,069 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:41:35,069 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:41:35,078 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet5, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9.base, main_#t~ret9.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet5;havoc main_#t~nondet5; 10#L513true assume !(main_~in_len~0 < 1);call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet7;havoc main_#t~nondet7; 13#L517true assume !(main_~out_len~0 < main_~in_len~0);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := main_~out~0.base, main_~out~0.offset, main_~in~0.base, main_~in~0.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 4#L508-3true [2019-01-01 21:41:35,078 INFO L796 eck$LassoCheckResult]: Loop: 4#L508-3true strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 11#L508-1true assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 4#L508-3true [2019-01-01 21:41:35,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:35,086 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2019-01-01 21:41:35,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:35,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:35,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:35,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:35,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:35,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:35,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 1 times [2019-01-01 21:41:35,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:35,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:35,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:35,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:35,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:35,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:35,278 INFO L82 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2019-01-01 21:41:35,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:35,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:35,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:35,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:35,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:35,545 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-01 21:41:35,769 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-01 21:41:36,501 WARN L181 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-01-01 21:41:36,730 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-01-01 21:41:36,757 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:41:36,759 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:41:36,761 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:41:36,761 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:41:36,762 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:41:36,762 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:41:36,762 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:41:36,762 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:41:36,763 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcpy_small_true-termination.c.i_Iteration1_Lasso [2019-01-01 21:41:36,763 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:41:36,763 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:41:36,793 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:41:36,818 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:41:36,827 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:41:36,852 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:41:36,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:41:36,881 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:41:36,883 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:41:36,887 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:41:36,891 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:41:36,894 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:41:36,897 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:41:36,910 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:41:36,912 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:41:36,913 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:41:37,373 WARN L181 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-01-01 21:41:37,561 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-01-01 21:41:37,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:37,741 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-01 21:41:38,703 WARN L181 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-01 21:41:38,765 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:41:38,770 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:41:38,773 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:41:38,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:38,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:38,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:38,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:38,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:38,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:38,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:38,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:38,785 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:41:38,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:38,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:38,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:38,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:38,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:38,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:38,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:38,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:38,789 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:41:38,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:38,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:38,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:38,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:38,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:38,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:38,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:38,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:38,797 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:41:38,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:38,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:38,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:38,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:38,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:38,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:38,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:38,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:38,806 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:41:38,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:38,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:38,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:38,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:38,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:38,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:38,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:38,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:38,813 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:41:38,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:38,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:38,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:38,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:38,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:38,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:38,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:38,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:38,818 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:41:38,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:38,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:38,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:38,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:38,822 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:38,822 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:38,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:38,826 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:41:38,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:38,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:38,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:38,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:38,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:38,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:38,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:38,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:38,829 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:41:38,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:38,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:38,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:38,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:38,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:38,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:38,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:38,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:38,833 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:41:38,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:38,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:38,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:38,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:38,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:38,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:38,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:38,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:38,836 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:41:38,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:38,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:38,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:38,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:38,839 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:38,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:38,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:38,843 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:41:38,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:38,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:38,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:38,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:38,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:38,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:38,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:38,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:38,847 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:41:38,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:38,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:38,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:38,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:38,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:38,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:38,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:38,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:38,849 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:41:38,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:38,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:38,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:38,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:38,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:38,862 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:39,018 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:41:39,099 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 21:41:39,099 INFO L444 ModelExtractionUtils]: 43 out of 49 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 21:41:39,102 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:41:39,104 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:41:39,104 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:41:39,108 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcpy_~s2.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc6.base)_1) = -1*ULTIMATE.start_strcpy_~s2.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc6.base)_1 Supporting invariants [] [2019-01-01 21:41:39,198 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2019-01-01 21:41:39,206 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:41:39,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:41:39,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:41:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:41:39,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:41:39,418 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:41:39,434 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:41:39,436 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 4 states. [2019-01-01 21:41:39,519 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 4 states. Result 23 states and 25 transitions. Complement of second has 7 states. [2019-01-01 21:41:39,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:41:39,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:41:39,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-01-01 21:41:39,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:41:39,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:41:39,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 21:41:39,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:41:39,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-01 21:41:39,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:41:39,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2019-01-01 21:41:39,531 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:41:39,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2019-01-01 21:41:39,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:41:39,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:41:39,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:41:39,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:41:39,536 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:41:39,536 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:41:39,536 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:41:39,536 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:41:39,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:41:39,537 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:41:39,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:41:39,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:41:39 BoogieIcfgContainer [2019-01-01 21:41:39,544 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:41:39,544 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:41:39,545 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:41:39,545 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:41:39,545 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:41:34" (3/4) ... [2019-01-01 21:41:39,550 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:41:39,550 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:41:39,551 INFO L168 Benchmark]: Toolchain (without parser) took 5756.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:41:39,552 INFO L168 Benchmark]: CDTParser took 0.16 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:41:39,552 INFO L168 Benchmark]: CACSL2BoogieTranslator took 566.95 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 924.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:41:39,553 INFO L168 Benchmark]: Boogie Procedure Inliner took 121.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -203.8 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:41:39,554 INFO L168 Benchmark]: Boogie Preprocessor took 31.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:41:39,555 INFO L168 Benchmark]: RCFGBuilder took 415.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:41:39,555 INFO L168 Benchmark]: BuchiAutomizer took 4609.47 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -6.3 MB). Peak memory consumption was 59.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:41:39,556 INFO L168 Benchmark]: Witness Printer took 5.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-01 21:41:39,561 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.16 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 566.95 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 924.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 121.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -203.8 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 415.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4609.47 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -6.3 MB). Peak memory consumption was 59.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. 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 (in_len)] and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.5s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 4.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 9 SDtfs, 9 SDslu, 7 SDs, 0 SdLazy, 8 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital201 mio100 ax100 hnf99 lsp96 ukn92 mio100 lsp47 div100 bol100 ite100 ukn100 eq198 hnf88 smp100 dnf174 smp97 tf100 neg96 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms 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...