./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e815c2ee-2b8f-46cd-9189-3c20fc788a54/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e815c2ee-2b8f-46cd-9189-3c20fc788a54/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e815c2ee-2b8f-46cd-9189-3c20fc788a54/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e815c2ee-2b8f-46cd-9189-3c20fc788a54/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e815c2ee-2b8f-46cd-9189-3c20fc788a54/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e815c2ee-2b8f-46cd-9189-3c20fc788a54/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7d00aad8dfdafc20547a229a92ab2c2bdb101f8c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 02:42:48,548 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 02:42:48,549 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 02:42:48,555 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 02:42:48,555 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 02:42:48,556 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 02:42:48,556 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 02:42:48,557 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 02:42:48,558 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 02:42:48,558 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 02:42:48,558 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 02:42:48,559 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 02:42:48,559 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 02:42:48,559 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 02:42:48,560 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 02:42:48,560 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 02:42:48,561 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 02:42:48,561 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 02:42:48,562 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 02:42:48,563 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 02:42:48,564 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 02:42:48,564 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 02:42:48,565 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 02:42:48,565 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 02:42:48,566 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 02:42:48,566 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 02:42:48,567 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 02:42:48,567 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 02:42:48,567 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 02:42:48,568 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 02:42:48,568 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 02:42:48,568 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 02:42:48,568 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 02:42:48,568 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 02:42:48,569 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 02:42:48,569 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 02:42:48,569 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e815c2ee-2b8f-46cd-9189-3c20fc788a54/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 02:42:48,577 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 02:42:48,577 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 02:42:48,578 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 02:42:48,578 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 02:42:48,578 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 02:42:48,578 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 02:42:48,578 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 02:42:48,578 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 02:42:48,578 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 02:42:48,579 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 02:42:48,579 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 02:42:48,579 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 02:42:48,579 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 02:42:48,579 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 02:42:48,579 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 02:42:48,579 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 02:42:48,579 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 02:42:48,579 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 02:42:48,579 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 02:42:48,579 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 02:42:48,580 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 02:42:48,580 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 02:42:48,580 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 02:42:48,580 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 02:42:48,580 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 02:42:48,580 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 02:42:48,580 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 02:42:48,580 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 02:42:48,580 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 02:42:48,580 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 02:42:48,580 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 02:42:48,581 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 02:42:48,581 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_e815c2ee-2b8f-46cd-9189-3c20fc788a54/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7d00aad8dfdafc20547a229a92ab2c2bdb101f8c [2018-12-02 02:42:48,598 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 02:42:48,604 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 02:42:48,606 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 02:42:48,607 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 02:42:48,607 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 02:42:48,608 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e815c2ee-2b8f-46cd-9189-3c20fc788a54/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-12-02 02:42:48,642 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e815c2ee-2b8f-46cd-9189-3c20fc788a54/bin-2019/uautomizer/data/2f595ffbd/dcf92bf4375d4558ad72cf4e15052553/FLAG9540b8889 [2018-12-02 02:42:49,129 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 02:42:49,129 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e815c2ee-2b8f-46cd-9189-3c20fc788a54/sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-12-02 02:42:49,135 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e815c2ee-2b8f-46cd-9189-3c20fc788a54/bin-2019/uautomizer/data/2f595ffbd/dcf92bf4375d4558ad72cf4e15052553/FLAG9540b8889 [2018-12-02 02:42:49,628 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e815c2ee-2b8f-46cd-9189-3c20fc788a54/bin-2019/uautomizer/data/2f595ffbd/dcf92bf4375d4558ad72cf4e15052553 [2018-12-02 02:42:49,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 02:42:49,631 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 02:42:49,632 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 02:42:49,632 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 02:42:49,634 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 02:42:49,635 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:42:49" (1/1) ... [2018-12-02 02:42:49,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14e9f722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:42:49, skipping insertion in model container [2018-12-02 02:42:49,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:42:49" (1/1) ... [2018-12-02 02:42:49,642 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 02:42:49,661 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 02:42:49,803 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:42:49,809 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 02:42:49,872 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:42:49,895 INFO L195 MainTranslator]: Completed translation [2018-12-02 02:42:49,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:42:49 WrapperNode [2018-12-02 02:42:49,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 02:42:49,896 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 02:42:49,896 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 02:42:49,896 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 02:42:49,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:42:49" (1/1) ... [2018-12-02 02:42:49,910 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:42:49" (1/1) ... [2018-12-02 02:42:49,924 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 02:42:49,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 02:42:49,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 02:42:49,925 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 02:42:49,930 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:42:49" (1/1) ... [2018-12-02 02:42:49,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:42:49" (1/1) ... [2018-12-02 02:42:49,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:42:49" (1/1) ... [2018-12-02 02:42:49,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:42:49" (1/1) ... [2018-12-02 02:42:49,938 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:42:49" (1/1) ... [2018-12-02 02:42:49,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:42:49" (1/1) ... [2018-12-02 02:42:49,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:42:49" (1/1) ... [2018-12-02 02:42:49,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 02:42:49,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 02:42:49,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 02:42:49,946 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 02:42:49,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:42:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e815c2ee-2b8f-46cd-9189-3c20fc788a54/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 02:42:49,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 02:42:49,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 02:42:49,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 02:42:49,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 02:42:49,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 02:42:49,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 02:42:50,131 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 02:42:50,131 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 02:42:50,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:42:50 BoogieIcfgContainer [2018-12-02 02:42:50,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 02:42:50,132 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 02:42:50,132 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 02:42:50,134 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 02:42:50,135 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 02:42:50,135 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 02:42:49" (1/3) ... [2018-12-02 02:42:50,136 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e0bb6a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 02:42:50, skipping insertion in model container [2018-12-02 02:42:50,136 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 02:42:50,136 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:42:49" (2/3) ... [2018-12-02 02:42:50,137 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e0bb6a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 02:42:50, skipping insertion in model container [2018-12-02 02:42:50,137 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 02:42:50,137 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:42:50" (3/3) ... [2018-12-02 02:42:50,138 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-12-02 02:42:50,176 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 02:42:50,176 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 02:42:50,176 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 02:42:50,177 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 02:42:50,177 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 02:42:50,177 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 02:42:50,177 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 02:42:50,177 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 02:42:50,177 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 02:42:50,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-02 02:42:50,202 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-12-02 02:42:50,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:42:50,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:42:50,208 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-02 02:42:50,208 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 02:42:50,208 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 02:42:50,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-02 02:42:50,210 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-12-02 02:42:50,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:42:50,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:42:50,211 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-02 02:42:50,211 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 02:42:50,218 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 16#L563true assume !(main_~length~0 < 1); 19#L563-2true assume !(main_~n~1 < 1); 10#L566-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 5#L546true assume 0 != cstrlcpy_~n~0 % 4294967296; 9#L547-3true [2018-12-02 02:42:50,218 INFO L796 eck$LassoCheckResult]: Loop: 9#L547-3true cstrlcpy_#t~pre2 := cstrlcpy_~n~0 - 1;cstrlcpy_~n~0 := cstrlcpy_~n~0 - 1; 6#L547-1true assume !!(0 != cstrlcpy_#t~pre2 % 4294967296);havoc cstrlcpy_#t~pre2;cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset := cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_#t~post3.base, 1 + cstrlcpy_#t~post3.offset;cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post4.base, 1 + cstrlcpy_#t~post4.offset;call cstrlcpy_#t~mem5 := read~int(cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, 1);call write~int(cstrlcpy_#t~mem5, cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, 1); 3#L548true assume !(0 == cstrlcpy_#t~mem5);havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset;havoc cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset;havoc cstrlcpy_#t~mem5; 9#L547-3true [2018-12-02 02:42:50,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:42:50,223 INFO L82 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2018-12-02 02:42:50,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:42:50,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:42:50,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:42:50,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:42:50,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:42:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:42:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:42:50,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:42:50,322 INFO L82 PathProgramCache]: Analyzing trace with hash 52795, now seen corresponding path program 1 times [2018-12-02 02:42:50,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:42:50,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:42:50,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:42:50,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:42:50,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:42:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:42:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:42:50,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:42:50,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1298289360, now seen corresponding path program 1 times [2018-12-02 02:42:50,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:42:50,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:42:50,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:42:50,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:42:50,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:42:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:42:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:42:50,697 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 98 [2018-12-02 02:42:50,799 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 02:42:50,800 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 02:42:50,801 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 02:42:50,801 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 02:42:50,801 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 02:42:50,801 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 02:42:50,801 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 02:42:50,801 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 02:42:50,802 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-12-02 02:42:50,802 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 02:42:50,802 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 02:42:50,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:50,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:50,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:50,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:50,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:50,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:51,050 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2018-12-02 02:42:51,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:51,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:51,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:51,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:51,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:51,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:51,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:51,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:51,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:51,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:51,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:51,384 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2018-12-02 02:42:51,494 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2018-12-02 02:42:51,707 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 02:42:51,709 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 02:42:51,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:42:51,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:42:51,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:42:51,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:42:51,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:42:51,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:42:51,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:42:51,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:42:51,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:42:51,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:42:51,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:42:51,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:42:51,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:42:51,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:42:51,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:42:51,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:42:51,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:42:51,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:42:51,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:42:51,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:42:51,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:42:51,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:42:51,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:42:51,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:42:51,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:42:51,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:42:51,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:42:51,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:42:51,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:42:51,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:42:51,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:42:51,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:42:51,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:42:51,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:42:51,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:42:51,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:42:51,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:42:51,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:42:51,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:42:51,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:42:51,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:42:51,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:42:51,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:42:51,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:42:51,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:42:51,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:42:51,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:42:51,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:42:51,725 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:42:51,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:42:51,726 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:42:51,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:42:51,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:42:51,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:42:51,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:42:51,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:42:51,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:42:51,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:42:51,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:42:51,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:42:51,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:42:51,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:42:51,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:42:51,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:42:51,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:42:51,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:42:51,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:42:51,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:42:51,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:42:51,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:42:51,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:42:51,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:42:51,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:42:51,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:42:51,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:42:51,739 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:42:51,739 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:42:51,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:42:51,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:42:51,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:42:51,743 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 02:42:51,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:42:51,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:42:51,746 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 02:42:51,746 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:42:51,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:42:51,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:42:51,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:42:51,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:42:51,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:42:51,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:42:51,764 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:42:51,764 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:42:51,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:42:51,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:42:51,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:42:51,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:42:51,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:42:51,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:42:51,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:42:51,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:42:51,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:42:51,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:42:51,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:42:51,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:42:51,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:42:51,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:42:51,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:42:51,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:42:51,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:42:51,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:42:51,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:42:51,783 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 02:42:51,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:42:51,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:42:51,785 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 02:42:51,785 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:42:51,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:42:51,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 [2018-12-02 02:42:51,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:42:51,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:42:51,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:42:51,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:42:51,803 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:42:51,803 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:42:51,856 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 02:42:51,879 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 02:42:51,879 INFO L444 ModelExtractionUtils]: 54 out of 58 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 02:42:51,880 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 02:42:51,881 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 02:42:51,881 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 02:42:51,881 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1, ULTIMATE.start_cstrlcpy_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1 - 1*ULTIMATE.start_cstrlcpy_~s~0.offset Supporting invariants [] [2018-12-02 02:42:51,921 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2018-12-02 02:42:51,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 02:42:51,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:42:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:42:51,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:42:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:42:51,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:42:52,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:42:52,014 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 [2018-12-02 02:42:52,014 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 5 states. [2018-12-02 02:42:52,076 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 5 states. Result 49 states and 70 transitions. Complement of second has 7 states. [2018-12-02 02:42:52,076 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 [2018-12-02 02:42:52,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 02:42:52,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2018-12-02 02:42:52,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 6 letters. Loop has 3 letters. [2018-12-02 02:42:52,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:42:52,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 9 letters. Loop has 3 letters. [2018-12-02 02:42:52,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:42:52,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 6 letters. Loop has 6 letters. [2018-12-02 02:42:52,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:42:52,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 70 transitions. [2018-12-02 02:42:52,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 02:42:52,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 10 states and 13 transitions. [2018-12-02 02:42:52,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 02:42:52,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 02:42:52,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-12-02 02:42:52,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 02:42:52,086 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-02 02:42:52,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-12-02 02:42:52,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-02 02:42:52,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-02 02:42:52,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-12-02 02:42:52,102 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-02 02:42:52,102 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-02 02:42:52,102 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 02:42:52,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-12-02 02:42:52,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 02:42:52,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:42:52,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:42:52,103 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:42:52,103 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 02:42:52,103 INFO L794 eck$LassoCheckResult]: Stem: 195#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 190#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 191#L563 assume !(main_~length~0 < 1); 196#L563-2 assume !(main_~n~1 < 1); 199#L566-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 197#L546 assume !(0 != cstrlcpy_~n~0 % 4294967296); 198#L546-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 192#L553 assume !(0 != cstrlcpy_~siz % 4294967296); 193#L555-2 [2018-12-02 02:42:52,103 INFO L796 eck$LassoCheckResult]: Loop: 193#L555-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 194#L555 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 193#L555-2 [2018-12-02 02:42:52,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:42:52,103 INFO L82 PathProgramCache]: Analyzing trace with hash 180447461, now seen corresponding path program 1 times [2018-12-02 02:42:52,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:42:52,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:42:52,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:42:52,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:42:52,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:42:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:42:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:42:52,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:42:52,120 INFO L82 PathProgramCache]: Analyzing trace with hash 2630, now seen corresponding path program 1 times [2018-12-02 02:42:52,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:42:52,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:42:52,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:42:52,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:42:52,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:42:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:42:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:42:52,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:42:52,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1611319850, now seen corresponding path program 1 times [2018-12-02 02:42:52,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:42:52,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:42:52,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:42:52,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:42:52,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:42:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:42:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:42:52,346 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2018-12-02 02:42:52,417 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 02:42:52,418 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 02:42:52,418 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 02:42:52,418 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 02:42:52,418 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 02:42:52,418 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 02:42:52,418 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 02:42:52,418 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 02:42:52,418 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-12-02 02:42:52,418 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 02:42:52,418 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 02:42:52,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:52,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:52,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:52,560 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2018-12-02 02:42:52,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:52,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:52,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:52,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:52,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:52,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:52,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:52,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:52,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:52,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:52,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:52,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:52,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:52,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:42:52,880 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 02:42:52,881 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 02:42:52,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:42:52,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:42:52,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:42:52,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:42:52,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:42:52,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:42:52,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:42:52,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:42:52,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:42:52,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:42:52,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:42:52,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:42:52,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:42:52,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:42:52,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:42:52,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:42:52,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:42:52,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:42:52,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:42:52,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:42:52,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:42:52,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:42:52,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:42:52,885 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:42:52,885 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:42:52,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:42:52,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:42:52,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:42:52,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:42:52,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:42:52,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:42:52,888 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:42:52,889 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:42:52,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:42:52,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:42:52,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:42:52,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:42:52,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:42:52,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:42:52,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:42:52,911 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:42:52,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:42:52,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:42:52,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:42:52,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:42:52,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:42:52,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:42:52,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:42:52,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:42:52,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:42:52,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:42:52,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:42:52,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:42:52,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:42:52,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:42:52,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:42:52,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:42:52,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:42:52,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:42:52,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:42:52,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:42:52,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:42:52,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:42:52,919 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:42:52,919 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:42:52,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:42:52,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:42:52,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:42:52,920 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 02:42:52,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:42:52,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:42:52,921 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 02:42:52,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:42:52,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:42:52,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:42:52,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:42:52,924 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 02:42:52,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:42:52,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:42:52,925 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 02:42:52,925 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:42:52,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:42:52,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:42:52,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:42:52,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:42:52,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:42:52,929 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:42:52,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:42:52,929 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:42:52,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:42:52,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:42:52,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:42:52,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:42:52,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:42:52,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:42:52,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:42:52,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:42:52,932 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:42:52,938 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 02:42:52,944 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 02:42:52,944 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-02 02:42:52,944 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 02:42:52,945 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 02:42:52,945 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 02:42:52,945 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrlcpy_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_2) = -1*ULTIMATE.start_cstrlcpy_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_2 Supporting invariants [] [2018-12-02 02:42:52,970 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-12-02 02:42:52,972 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 02:42:52,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:42:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:42:52,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:42:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:42:53,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:42:53,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:42:53,018 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 [2018-12-02 02:42:53,018 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-12-02 02:42:53,038 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 14 states and 17 transitions. Complement of second has 5 states. [2018-12-02 02:42:53,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 02:42:53,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 02:42:53,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-02 02:42:53,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 2 letters. [2018-12-02 02:42:53,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:42:53,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 2 letters. [2018-12-02 02:42:53,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:42:53,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 4 letters. [2018-12-02 02:42:53,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:42:53,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2018-12-02 02:42:53,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 02:42:53,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 12 transitions. [2018-12-02 02:42:53,040 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 02:42:53,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 02:42:53,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2018-12-02 02:42:53,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 02:42:53,041 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-02 02:42:53,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2018-12-02 02:42:53,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-02 02:42:53,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-02 02:42:53,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-12-02 02:42:53,041 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-02 02:42:53,041 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-02 02:42:53,041 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 02:42:53,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2018-12-02 02:42:53,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 02:42:53,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:42:53,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:42:53,042 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:42:53,042 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 02:42:53,042 INFO L794 eck$LassoCheckResult]: Stem: 312#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 307#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 308#L563 assume !(main_~length~0 < 1); 313#L563-2 assume !(main_~n~1 < 1); 316#L566-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 314#L546 assume !(0 != cstrlcpy_~n~0 % 4294967296); 315#L546-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 309#L553 assume 0 != cstrlcpy_~siz % 4294967296;call write~int(0, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, 1); 310#L555-2 [2018-12-02 02:42:53,042 INFO L796 eck$LassoCheckResult]: Loop: 310#L555-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 311#L555 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 310#L555-2 [2018-12-02 02:42:53,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:42:53,042 INFO L82 PathProgramCache]: Analyzing trace with hash 180447459, now seen corresponding path program 1 times [2018-12-02 02:42:53,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:42:53,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:42:53,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:42:53,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:42:53,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:42:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:42:53,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:42:53,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:42:53,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:42:53,100 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 02:42:53,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:42:53,100 INFO L82 PathProgramCache]: Analyzing trace with hash 2630, now seen corresponding path program 2 times [2018-12-02 02:42:53,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:42:53,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:42:53,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:42:53,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:42:53,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:42:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:42:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:42:53,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:42:53,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:42:53,127 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-12-02 02:42:53,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:42:53,135 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2018-12-02 02:42:53,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 02:42:53,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2018-12-02 02:42:53,135 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 02:42:53,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 0 states and 0 transitions. [2018-12-02 02:42:53,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 02:42:53,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 02:42:53,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 02:42:53,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 02:42:53,136 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 02:42:53,136 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 02:42:53,136 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 02:42:53,136 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 02:42:53,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 02:42:53,136 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 02:42:53,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 02:42:53,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 02:42:53 BoogieIcfgContainer [2018-12-02 02:42:53,141 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 02:42:53,141 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 02:42:53,141 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 02:42:53,141 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 02:42:53,141 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:42:50" (3/4) ... [2018-12-02 02:42:53,144 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 02:42:53,144 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 02:42:53,144 INFO L168 Benchmark]: Toolchain (without parser) took 3513.74 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 288.9 MB). Free memory was 949.6 MB in the beginning and 1.2 GB in the end (delta: -274.5 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-12-02 02:42:53,145 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:42:53,145 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -144.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-12-02 02:42:53,145 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-02 02:42:53,146 INFO L168 Benchmark]: Boogie Preprocessor took 21.11 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-02 02:42:53,146 INFO L168 Benchmark]: RCFGBuilder took 185.54 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: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2018-12-02 02:42:53,146 INFO L168 Benchmark]: BuchiAutomizer took 3008.70 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -158.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-02 02:42:53,147 INFO L168 Benchmark]: Witness Printer took 2.95 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:42:53,149 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 263.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -144.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.11 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 185.54 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: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3008.70 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -158.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.95 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length * sizeof(char))] + -1 * s and consists of 5 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length * sizeof(char))] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 47 SDtfs, 42 SDslu, 28 SDs, 0 SdLazy, 19 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital226 mio100 ax100 hnf99 lsp97 ukn83 mio100 lsp41 div171 bol100 ite100 ukn100 eq172 hnf66 smp95 dnf100 smp100 tf101 neg99 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...