./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/substring-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_3db53392-46f8-4a11-b83f-48c6a517a130/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3db53392-46f8-4a11-b83f-48c6a517a130/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3db53392-46f8-4a11-b83f-48c6a517a130/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3db53392-46f8-4a11-b83f-48c6a517a130/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3db53392-46f8-4a11-b83f-48c6a517a130/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3db53392-46f8-4a11-b83f-48c6a517a130/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 0116566dfd4e4e63b59200ee97d098541aa6c54d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 17:10:55,894 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 17:10:55,895 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 17:10:55,901 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 17:10:55,901 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 17:10:55,902 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 17:10:55,902 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 17:10:55,903 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 17:10:55,904 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 17:10:55,904 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 17:10:55,905 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 17:10:55,905 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 17:10:55,906 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 17:10:55,906 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 17:10:55,907 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 17:10:55,907 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 17:10:55,908 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 17:10:55,908 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 17:10:55,909 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 17:10:55,910 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 17:10:55,911 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 17:10:55,911 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 17:10:55,913 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 17:10:55,913 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 17:10:55,913 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 17:10:55,913 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 17:10:55,914 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 17:10:55,914 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 17:10:55,915 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 17:10:55,916 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 17:10:55,916 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 17:10:55,916 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 17:10:55,916 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 17:10:55,916 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 17:10:55,917 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 17:10:55,917 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 17:10:55,917 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3db53392-46f8-4a11-b83f-48c6a517a130/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 17:10:55,925 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 17:10:55,925 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 17:10:55,926 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 17:10:55,926 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 17:10:55,926 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 17:10:55,926 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 17:10:55,927 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 17:10:55,927 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 17:10:55,927 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 17:10:55,927 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 17:10:55,927 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 17:10:55,927 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 17:10:55,927 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 17:10:55,927 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 17:10:55,928 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 17:10:55,928 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 17:10:55,928 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 17:10:55,928 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 17:10:55,928 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 17:10:55,928 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 17:10:55,928 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 17:10:55,928 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 17:10:55,929 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 17:10:55,929 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 17:10:55,929 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 17:10:55,929 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 17:10:55,929 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 17:10:55,929 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 17:10:55,929 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 17:10:55,929 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 17:10:55,930 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 17:10:55,930 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 17:10:55,930 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_3db53392-46f8-4a11-b83f-48c6a517a130/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 -> 0116566dfd4e4e63b59200ee97d098541aa6c54d [2018-12-02 17:10:55,947 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 17:10:55,954 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 17:10:55,956 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 17:10:55,957 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 17:10:55,957 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 17:10:55,957 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3db53392-46f8-4a11-b83f-48c6a517a130/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-12-02 17:10:55,990 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3db53392-46f8-4a11-b83f-48c6a517a130/bin-2019/uautomizer/data/7f31a7aec/836e47013d894d24b2ac811f1b968308/FLAG14be59f13 [2018-12-02 17:10:56,434 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 17:10:56,435 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3db53392-46f8-4a11-b83f-48c6a517a130/sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-12-02 17:10:56,441 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3db53392-46f8-4a11-b83f-48c6a517a130/bin-2019/uautomizer/data/7f31a7aec/836e47013d894d24b2ac811f1b968308/FLAG14be59f13 [2018-12-02 17:10:56,449 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3db53392-46f8-4a11-b83f-48c6a517a130/bin-2019/uautomizer/data/7f31a7aec/836e47013d894d24b2ac811f1b968308 [2018-12-02 17:10:56,451 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 17:10:56,452 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 17:10:56,452 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 17:10:56,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 17:10:56,455 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 17:10:56,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:10:56" (1/1) ... [2018-12-02 17:10:56,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ac4e85d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:10:56, skipping insertion in model container [2018-12-02 17:10:56,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:10:56" (1/1) ... [2018-12-02 17:10:56,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 17:10:56,488 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 17:10:56,641 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 17:10:56,647 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 17:10:56,703 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 17:10:56,734 INFO L195 MainTranslator]: Completed translation [2018-12-02 17:10:56,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:10:56 WrapperNode [2018-12-02 17:10:56,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 17:10:56,735 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 17:10:56,735 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 17:10:56,735 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 17:10:56,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:10:56" (1/1) ... [2018-12-02 17:10:56,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:10:56" (1/1) ... [2018-12-02 17:10:56,761 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 17:10:56,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 17:10:56,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 17:10:56,761 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 17:10:56,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:10:56" (1/1) ... [2018-12-02 17:10:56,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:10:56" (1/1) ... [2018-12-02 17:10:56,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:10:56" (1/1) ... [2018-12-02 17:10:56,768 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:10:56" (1/1) ... [2018-12-02 17:10:56,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:10:56" (1/1) ... [2018-12-02 17:10:56,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:10:56" (1/1) ... [2018-12-02 17:10:56,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:10:56" (1/1) ... [2018-12-02 17:10:56,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 17:10:56,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 17:10:56,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 17:10:56,775 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 17:10:56,776 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:10:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3db53392-46f8-4a11-b83f-48c6a517a130/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 17:10:56,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 17:10:56,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 17:10:56,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 17:10:56,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 17:10:56,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 17:10:56,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 17:10:56,944 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 17:10:56,944 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 17:10:56,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:10:56 BoogieIcfgContainer [2018-12-02 17:10:56,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 17:10:56,945 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 17:10:56,945 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 17:10:56,949 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 17:10:56,950 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 17:10:56,950 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 05:10:56" (1/3) ... [2018-12-02 17:10:56,951 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69f290a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 05:10:56, skipping insertion in model container [2018-12-02 17:10:56,951 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 17:10:56,951 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:10:56" (2/3) ... [2018-12-02 17:10:56,951 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69f290a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 05:10:56, skipping insertion in model container [2018-12-02 17:10:56,951 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 17:10:56,951 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:10:56" (3/3) ... [2018-12-02 17:10:56,953 INFO L375 chiAutomizerObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2018-12-02 17:10:56,990 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 17:10:56,991 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 17:10:56,991 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 17:10:56,991 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 17:10:56,991 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 17:10:56,991 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 17:10:56,991 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 17:10:56,991 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 17:10:56,991 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 17:10:57,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-12-02 17:10:57,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 17:10:57,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:10:57,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:10:57,020 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 17:10:57,020 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 17:10:57,020 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 17:10:57,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-12-02 17:10:57,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 17:10:57,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:10:57,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:10:57,022 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 17:10:57,022 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 17:10:57,029 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 3#L558true assume !(main_~length1~0 < 1); 5#L558-2true assume !(main_~length2~0 < 1); 18#L561-1true call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 13#L543-3true [2018-12-02 17:10:57,030 INFO L796 eck$LassoCheckResult]: Loop: 13#L543-3true call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 10#L543-1true assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 12#L546-5true assume !true; 14#L546-6true call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 16#L550true assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 13#L543-3true [2018-12-02 17:10:57,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:57,035 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-12-02 17:10:57,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:10:57,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:10:57,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:57,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:57,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:10:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:10:57,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:57,129 INFO L82 PathProgramCache]: Analyzing trace with hash 47887114, now seen corresponding path program 1 times [2018-12-02 17:10:57,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:10:57,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:10:57,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:57,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:57,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:57,148 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 17:10:57,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:10:57,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 17:10:57,151 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 17:10:57,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 17:10:57,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 17:10:57,162 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2018-12-02 17:10:57,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:10:57,166 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2018-12-02 17:10:57,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 17:10:57,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2018-12-02 17:10:57,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 17:10:57,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 16 transitions. [2018-12-02 17:10:57,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-02 17:10:57,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-02 17:10:57,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2018-12-02 17:10:57,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:10:57,172 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-12-02 17:10:57,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2018-12-02 17:10:57,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-02 17:10:57,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-02 17:10:57,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-12-02 17:10:57,195 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-12-02 17:10:57,195 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-12-02 17:10:57,195 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 17:10:57,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2018-12-02 17:10:57,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 17:10:57,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:10:57,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:10:57,196 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 17:10:57,196 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:10:57,196 INFO L794 eck$LassoCheckResult]: Stem: 47#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 42#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 43#L558 assume !(main_~length1~0 < 1); 44#L558-2 assume !(main_~length2~0 < 1); 51#L561-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 52#L543-3 [2018-12-02 17:10:57,196 INFO L796 eck$LassoCheckResult]: Loop: 52#L543-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 45#L543-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 46#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 48#L546-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 53#L546-3 assume !substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4; 49#L546-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 50#L550 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 52#L543-3 [2018-12-02 17:10:57,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:57,197 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-12-02 17:10:57,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:10:57,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:10:57,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:57,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:57,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:10:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:10:57,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:57,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1237496093, now seen corresponding path program 1 times [2018-12-02 17:10:57,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:10:57,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:10:57,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:57,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:10:57,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:10:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:10:57,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:57,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1302992386, now seen corresponding path program 1 times [2018-12-02 17:10:57,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:10:57,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:10:57,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:57,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:57,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:10:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:10:57,377 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2018-12-02 17:10:57,595 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2018-12-02 17:10:57,666 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 17:10:57,667 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 17:10:57,668 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 17:10:57,668 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 17:10:57,668 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 17:10:57,668 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 17:10:57,668 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 17:10:57,668 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 17:10:57,668 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-12-02 17:10:57,669 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 17:10:57,669 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 17:10:57,686 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 17:10:57,689 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 17:10:57,690 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 17:10:57,693 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 17:10:57,974 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 17:10:57,976 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 17:10:57,977 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 17:10:57,978 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 17:10:57,979 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 17:10:57,980 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 17:10:57,982 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 17:10:57,983 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 17:10:57,984 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 17:10:57,985 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 17:10:57,986 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 17:10:57,987 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 17:10:57,988 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 17:10:57,989 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 17:10:57,990 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 17:10:57,991 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 17:10:58,316 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 17:10:58,319 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 17:10:58,320 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 17:10:58,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:58,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:10:58,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:58,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:58,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:58,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:10:58,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:10:58,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:10:58,325 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 17:10:58,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:58,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:10:58,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:58,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:58,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:58,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:10:58,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:10:58,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:10:58,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:10:58,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:58,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:58,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:58,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:58,328 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:10:58,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:10:58,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:10:58,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:10:58,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:58,331 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 17:10:58,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:58,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:58,335 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 17:10:58,335 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:10:58,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:10:58,353 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 17:10:58,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:58,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:10:58,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:58,354 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-12-02 17:10:58,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:58,357 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 17:10:58,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:10:58,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:10:58,369 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 17:10:58,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:58,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:58,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:58,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:58,370 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:10:58,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:10:58,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:10:58,373 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 17:10:58,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:58,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:58,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:58,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:58,375 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:10:58,375 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:10:58,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:10:58,378 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 17:10:58,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:58,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:10:58,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:58,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:58,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:58,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:10:58,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:10:58,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:10:58,380 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 17:10:58,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:58,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:58,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:58,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:58,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:10:58,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:10:58,404 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 17:10:58,416 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 17:10:58,416 INFO L444 ModelExtractionUtils]: 27 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 17:10:58,417 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 17:10:58,418 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 17:10:58,419 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 17:10:58,419 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1, ULTIMATE.start_substring_~ps~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1 - 1*ULTIMATE.start_substring_~ps~0.offset Supporting invariants [] [2018-12-02 17:10:58,447 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-12-02 17:10:58,452 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 17:10:58,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:58,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:10:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:58,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:10:58,505 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 17:10:58,507 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 17:10:58,508 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-02 17:10:58,545 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 19 states and 26 transitions. Complement of second has 4 states. [2018-12-02 17:10:58,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 17:10:58,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 17:10:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-12-02 17:10:58,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 7 letters. [2018-12-02 17:10:58,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:10:58,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 12 letters. Loop has 7 letters. [2018-12-02 17:10:58,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:10:58,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 14 letters. [2018-12-02 17:10:58,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:10:58,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2018-12-02 17:10:58,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 17:10:58,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 24 transitions. [2018-12-02 17:10:58,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-02 17:10:58,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 17:10:58,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2018-12-02 17:10:58,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 17:10:58,551 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-12-02 17:10:58,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2018-12-02 17:10:58,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-02 17:10:58,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-02 17:10:58,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2018-12-02 17:10:58,553 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-12-02 17:10:58,553 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-12-02 17:10:58,553 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 17:10:58,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2018-12-02 17:10:58,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 17:10:58,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:10:58,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:10:58,554 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:10:58,554 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 17:10:58,554 INFO L794 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 170#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 171#L558 assume !(main_~length1~0 < 1); 172#L558-2 assume !(main_~length2~0 < 1); 184#L561-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 182#L543-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 173#L543-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 174#L546-5 [2018-12-02 17:10:58,554 INFO L796 eck$LassoCheckResult]: Loop: 174#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 178#L546-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 185#L546-3 assume !!substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 174#L546-5 [2018-12-02 17:10:58,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:58,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2018-12-02 17:10:58,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:10:58,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:10:58,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:58,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:58,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:10:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:10:58,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:58,574 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 1 times [2018-12-02 17:10:58,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:10:58,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:10:58,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:58,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:58,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:10:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:10:58,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:58,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1594173083, now seen corresponding path program 1 times [2018-12-02 17:10:58,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:10:58,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:10:58,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:58,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:58,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:10:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:10:58,889 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 100 [2018-12-02 17:10:58,958 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 17:10:58,958 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 17:10:58,958 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 17:10:58,958 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 17:10:58,958 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 17:10:58,958 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 17:10:58,958 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 17:10:58,958 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 17:10:58,958 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-12-02 17:10:58,958 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 17:10:58,958 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 17:10:58,960 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 17:10:58,962 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 17:10:58,962 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 17:10:58,964 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 17:10:58,965 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 17:10:58,966 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 17:10:58,967 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 17:10:59,192 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2018-12-02 17:10:59,267 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 17:10:59,268 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 17:10:59,269 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 17:10:59,270 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 17:10:59,271 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 17:10:59,273 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 17:10:59,274 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 17:10:59,275 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 17:10:59,276 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 17:10:59,277 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 17:10:59,278 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 17:10:59,278 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 17:10:59,279 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 17:10:59,280 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 17:10:59,590 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 17:10:59,591 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 17:10:59,591 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 17:10:59,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:59,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:10:59,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:59,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:59,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:59,592 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:10:59,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:10:59,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:10:59,593 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 17:10:59,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:59,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:10:59,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:59,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:59,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:59,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:10:59,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:10:59,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:10:59,594 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 17:10:59,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:59,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:59,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:59,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:59,595 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:10:59,595 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:10:59,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:10:59,596 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 17:10:59,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:59,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:10:59,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:59,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:59,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:59,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:10:59,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:10:59,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:10:59,597 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 17:10:59,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:59,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:10:59,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:59,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:59,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:59,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:10:59,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:10:59,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:10:59,598 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 17:10:59,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:59,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:10:59,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:59,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:59,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:59,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:10:59,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:10:59,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:10:59,599 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 17:10:59,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:59,600 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 17:10:59,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:59,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:59,601 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 17:10:59,601 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:10:59,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:10:59,606 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 17:10:59,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:59,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:59,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:59,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:59,607 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:10:59,607 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:10:59,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:10:59,608 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 17:10:59,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:59,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:59,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:59,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:59,610 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:10:59,610 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:10:59,628 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 17:10:59,643 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 17:10:59,643 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-02 17:10:59,643 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 17:10:59,644 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 17:10:59,644 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 17:10:59,644 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1, ULTIMATE.start_substring_~pt~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1 - 1*ULTIMATE.start_substring_~pt~0.offset Supporting invariants [] [2018-12-02 17:10:59,699 INFO L297 tatePredicateManager]: 20 out of 23 supporting invariants were superfluous and have been removed [2018-12-02 17:10:59,704 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 17:10:59,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:59,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:10:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:59,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:10:59,759 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 17:10:59,759 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 17:10:59,759 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-12-02 17:10:59,799 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 59 states and 76 transitions. Complement of second has 8 states. [2018-12-02 17:10:59,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 17:10:59,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 17:10:59,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-12-02 17:10:59,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 7 letters. Loop has 3 letters. [2018-12-02 17:10:59,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:10:59,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 3 letters. [2018-12-02 17:10:59,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:10:59,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 7 letters. Loop has 6 letters. [2018-12-02 17:10:59,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:10:59,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 76 transitions. [2018-12-02 17:10:59,802 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-02 17:10:59,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 48 states and 64 transitions. [2018-12-02 17:10:59,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 17:10:59,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-12-02 17:10:59,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2018-12-02 17:10:59,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 17:10:59,804 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2018-12-02 17:10:59,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2018-12-02 17:10:59,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2018-12-02 17:10:59,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-02 17:10:59,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2018-12-02 17:10:59,807 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2018-12-02 17:10:59,807 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2018-12-02 17:10:59,807 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 17:10:59,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 51 transitions. [2018-12-02 17:10:59,808 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-02 17:10:59,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:10:59,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:10:59,809 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:10:59,809 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 17:10:59,809 INFO L794 eck$LassoCheckResult]: Stem: 407#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 400#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 401#L558 assume !(main_~length1~0 < 1); 406#L558-2 assume !(main_~length2~0 < 1); 412#L561-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 415#L543-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 402#L543-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 403#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 409#L546-1 [2018-12-02 17:10:59,809 INFO L796 eck$LassoCheckResult]: Loop: 409#L546-1 assume !substring_#t~short6; 419#L546-3 assume !!substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 408#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 409#L546-1 [2018-12-02 17:10:59,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:59,809 INFO L82 PathProgramCache]: Analyzing trace with hash 180429619, now seen corresponding path program 1 times [2018-12-02 17:10:59,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:10:59,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:10:59,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:59,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:59,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:10:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:10:59,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:59,822 INFO L82 PathProgramCache]: Analyzing trace with hash 64727, now seen corresponding path program 1 times [2018-12-02 17:10:59,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:10:59,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:10:59,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:59,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:59,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:59,828 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 17:10:59,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:10:59,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 17:10:59,828 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 17:10:59,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:10:59,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:10:59,829 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. cyclomatic complexity: 20 Second operand 3 states. [2018-12-02 17:10:59,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:10:59,839 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2018-12-02 17:10:59,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:10:59,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2018-12-02 17:10:59,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 17:10:59,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 25 states and 32 transitions. [2018-12-02 17:10:59,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 17:10:59,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 17:10:59,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2018-12-02 17:10:59,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 17:10:59,842 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-12-02 17:10:59,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2018-12-02 17:10:59,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-12-02 17:10:59,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 17:10:59,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-12-02 17:10:59,843 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-12-02 17:10:59,843 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-12-02 17:10:59,843 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 17:10:59,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2018-12-02 17:10:59,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 17:10:59,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:10:59,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:10:59,845 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:10:59,845 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 17:10:59,845 INFO L794 eck$LassoCheckResult]: Stem: 485#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 478#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 479#L558 assume !(main_~length1~0 < 1); 484#L558-2 assume !(main_~length2~0 < 1); 494#L561-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 489#L543-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 482#L543-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 483#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 496#L546-1 assume !substring_#t~short6; 497#L546-3 assume !substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4; 492#L546-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 493#L550 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 490#L543-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 480#L543-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 481#L546-5 [2018-12-02 17:10:59,845 INFO L796 eck$LassoCheckResult]: Loop: 481#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 486#L546-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 495#L546-3 assume !!substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 481#L546-5 [2018-12-02 17:10:59,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:59,845 INFO L82 PathProgramCache]: Analyzing trace with hash 2012026433, now seen corresponding path program 1 times [2018-12-02 17:10:59,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:10:59,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:10:59,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:59,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:59,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:59,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:10:59,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:10:59,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:10:59,884 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:10:59,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:59,884 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 2 times [2018-12-02 17:10:59,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:10:59,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:10:59,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:59,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:59,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:10:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:10:59,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:10:59,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:10:59,969 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-12-02 17:10:59,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:10:59,992 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-12-02 17:10:59,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 17:10:59,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2018-12-02 17:10:59,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 17:10:59,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 23 states and 28 transitions. [2018-12-02 17:10:59,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 17:10:59,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 17:10:59,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2018-12-02 17:10:59,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 17:10:59,994 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-12-02 17:10:59,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2018-12-02 17:10:59,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-02 17:10:59,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 17:10:59,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2018-12-02 17:10:59,995 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-12-02 17:10:59,995 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-12-02 17:10:59,995 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 17:10:59,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2018-12-02 17:10:59,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 17:10:59,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:10:59,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:10:59,997 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:10:59,997 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 17:10:59,997 INFO L794 eck$LassoCheckResult]: Stem: 544#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 537#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 538#L558 assume !(main_~length1~0 < 1); 543#L558-2 assume !(main_~length2~0 < 1); 547#L561-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 548#L543-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 549#L543-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 557#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 554#L546-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 555#L546-3 assume !substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4; 551#L546-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 552#L550 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 550#L543-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 539#L543-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 540#L546-5 [2018-12-02 17:10:59,997 INFO L796 eck$LassoCheckResult]: Loop: 540#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 545#L546-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 553#L546-3 assume !!substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 540#L546-5 [2018-12-02 17:10:59,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:59,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1954768131, now seen corresponding path program 2 times [2018-12-02 17:10:59,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:10:59,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:10:59,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:59,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:10:59,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:11:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:11:00,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:00,015 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 3 times [2018-12-02 17:11:00,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:11:00,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:11:00,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:00,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:11:00,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:11:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:11:00,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:00,022 INFO L82 PathProgramCache]: Analyzing trace with hash -964145949, now seen corresponding path program 1 times [2018-12-02 17:11:00,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:11:00,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:11:00,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:00,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:11:00,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:11:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:11:00,474 WARN L180 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 143 [2018-12-02 17:11:00,568 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 17:11:00,568 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 17:11:00,568 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 17:11:00,568 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 17:11:00,568 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 17:11:00,568 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 17:11:00,568 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 17:11:00,568 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 17:11:00,568 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-12-02 17:11:00,568 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 17:11:00,568 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 17:11:00,570 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 17:11:00,571 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 17:11:00,572 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 17:11:00,573 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 17:11:00,574 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 17:11:00,575 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 17:11:00,576 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 17:11:00,577 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 17:11:00,578 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 17:11:00,579 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 17:11:00,580 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 17:11:00,581 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 17:11:00,582 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 17:11:00,582 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 17:11:00,583 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 17:11:00,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 17:11:00,915 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 96 [2018-12-02 17:11:01,042 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 17:11:01,044 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 17:11:01,044 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 17:11:01,045 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 17:11:01,051 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 17:11:01,053 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 17:11:01,501 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-12-02 17:11:01,641 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 17:11:01,641 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 17:11:01,642 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 17:11:01,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:11:01,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:11:01,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:11:01,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:11:01,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:11:01,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:11:01,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:11:01,644 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 17:11:01,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:11:01,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:11:01,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:11:01,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:11:01,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:11:01,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:11:01,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:11:01,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:11:01,645 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 17:11:01,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:11:01,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:11:01,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:11:01,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:11:01,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:11:01,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:11:01,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:11:01,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:11:01,646 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 17:11:01,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:11:01,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:11:01,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:11:01,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:11:01,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:11:01,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:11:01,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:11:01,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:11:01,647 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 17:11:01,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:11:01,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:11:01,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:11:01,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:11:01,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:11:01,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:11:01,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:11:01,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:11:01,648 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 17:11:01,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:11:01,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:11:01,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:11:01,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:11:01,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:11:01,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:11:01,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:11:01,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:11:01,649 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 17:11:01,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:11:01,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:11:01,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:11:01,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:11:01,650 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:11:01,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:11:01,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:11:01,651 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 17:11:01,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:11:01,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:11:01,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:11:01,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:11:01,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:11:01,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:11:01,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:11:01,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:11:01,653 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 17:11:01,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:11:01,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:11:01,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:11:01,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:11:01,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:11:01,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:11:01,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:11:01,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:11:01,655 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 17:11:01,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:11:01,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:11:01,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:11:01,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:11:01,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:11:01,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:11:01,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:11:01,657 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 17:11:01,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:11:01,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:11:01,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:11:01,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:11:01,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:11:01,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:11:01,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:11:01,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:11:01,659 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 17:11:01,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:11:01,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:11:01,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:11:01,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:11:01,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:11:01,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:11:01,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:11:01,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:11:01,661 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 17:11:01,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:11:01,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:11:01,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:11:01,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:11:01,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:11:01,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:11:01,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:11:01,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:11:01,662 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 17:11:01,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:11:01,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:11:01,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:11:01,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:11:01,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:11:01,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:11:01,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:11:01,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:11:01,664 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 17:11:01,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:11:01,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:11:01,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:11:01,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:11:01,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:11:01,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:11:01,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:11:01,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:11:01,666 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 17:11:01,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:11:01,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:11:01,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:11:01,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:11:01,667 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:11:01,667 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:11:01,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:11:01,670 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 17:11:01,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:11:01,670 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 17:11:01,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:11:01,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:11:01,672 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 17:11:01,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:11:01,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:11:01,677 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 17:11:01,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:11:01,677 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-12-02 17:11:01,678 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 17:11:01,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:11:01,683 INFO L402 nArgumentSynthesizer]: We have 60 Motzkin's Theorem applications. [2018-12-02 17:11:01,683 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 17:11:01,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:11:01,708 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 17:11:01,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:11:01,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:11:01,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:11:01,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:11:01,709 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:11:01,710 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:11:01,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:11:01,713 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 17:11:01,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:11:01,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:11:01,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:11:01,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:11:01,714 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:11:01,714 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:11:01,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:11:01,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 17:11:01,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:11:01,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:11:01,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:11:01,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:11:01,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:11:01,716 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:11:01,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:11:01,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 17:11:01,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:11:01,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:11:01,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:11:01,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:11:01,718 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:11:01,718 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:11:01,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:11:01,720 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 17:11:01,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:11:01,720 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 17:11:01,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:11:01,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:11:01,722 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 17:11:01,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:11:01,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:11:01,727 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 17:11:01,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:11:01,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:11:01,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:11:01,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:11:01,731 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:11:01,731 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:11:01,760 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 17:11:01,789 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-02 17:11:01,789 INFO L444 ModelExtractionUtils]: 49 out of 58 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-02 17:11:01,789 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 17:11:01,790 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 17:11:01,790 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 17:11:01,790 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_substring_~pt~0.base)_3, ULTIMATE.start_substring_~pt~0.offset) = 1*v_rep(select #length ULTIMATE.start_substring_~pt~0.base)_3 - 1*ULTIMATE.start_substring_~pt~0.offset Supporting invariants [] [2018-12-02 17:11:01,918 INFO L297 tatePredicateManager]: 45 out of 45 supporting invariants were superfluous and have been removed [2018-12-02 17:11:01,918 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 17:11:01,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:01,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:11:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:01,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:11:01,951 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 17:11:01,951 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 17:11:01,952 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-02 17:11:01,963 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 37 states and 43 transitions. Complement of second has 5 states. [2018-12-02 17:11:01,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 17:11:01,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 17:11:01,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-12-02 17:11:01,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-02 17:11:01,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:11:01,964 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 17:11:01,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:01,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:11:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:01,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:11:01,998 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 17:11:01,998 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 17:11:01,998 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-02 17:11:02,008 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 37 states and 43 transitions. Complement of second has 5 states. [2018-12-02 17:11:02,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 17:11:02,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 17:11:02,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-12-02 17:11:02,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-02 17:11:02,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:11:02,009 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 17:11:02,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:02,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:11:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:02,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:11:02,046 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 17:11:02,046 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 17:11:02,046 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-02 17:11:02,060 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 37 states and 44 transitions. Complement of second has 4 states. [2018-12-02 17:11:02,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 17:11:02,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 17:11:02,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2018-12-02 17:11:02,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-02 17:11:02,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:11:02,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 17 letters. Loop has 3 letters. [2018-12-02 17:11:02,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:11:02,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-02 17:11:02,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:11:02,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2018-12-02 17:11:02,062 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 17:11:02,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2018-12-02 17:11:02,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 17:11:02,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 17:11:02,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 17:11:02,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:11:02,063 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 17:11:02,063 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 17:11:02,063 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 17:11:02,063 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 17:11:02,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 17:11:02,063 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 17:11:02,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 17:11:02,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 05:11:02 BoogieIcfgContainer [2018-12-02 17:11:02,067 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 17:11:02,067 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 17:11:02,067 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 17:11:02,068 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 17:11:02,068 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:10:56" (3/4) ... [2018-12-02 17:11:02,070 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 17:11:02,070 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 17:11:02,071 INFO L168 Benchmark]: Toolchain (without parser) took 5619.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.3 MB). Free memory was 951.7 MB in the beginning and 844.4 MB in the end (delta: 107.3 MB). Peak memory consumption was 308.6 MB. Max. memory is 11.5 GB. [2018-12-02 17:11:02,071 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 17:11:02,071 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -139.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-12-02 17:11:02,072 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.82 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 17:11:02,072 INFO L168 Benchmark]: Boogie Preprocessor took 14.33 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 17:11:02,072 INFO L168 Benchmark]: RCFGBuilder took 169.62 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-02 17:11:02,072 INFO L168 Benchmark]: BuchiAutomizer took 5121.85 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 99.6 MB). Free memory was 1.1 GB in the beginning and 844.4 MB in the end (delta: 224.2 MB). Peak memory consumption was 323.8 MB. Max. memory is 11.5 GB. [2018-12-02 17:11:02,073 INFO L168 Benchmark]: Witness Printer took 2.75 ms. Allocated memory is still 1.2 GB. Free memory is still 844.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 17:11:02,075 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 282.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -139.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.82 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.33 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 169.62 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5121.85 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 99.6 MB). Free memory was 1.1 GB in the beginning and 844.4 MB in the end (delta: 224.2 MB). Peak memory consumption was 323.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.75 ms. Allocated memory is still 1.2 GB. Free memory is still 844.4 MB. 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 - 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 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * ps and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[nondetString1] + -1 * pt and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[pt] + -1 * pt and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.0s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 4.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 37 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 116 SDtfs, 102 SDslu, 47 SDs, 0 SdLazy, 83 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital249 mio100 ax100 hnf99 lsp96 ukn85 mio100 lsp38 div100 bol100 ite100 ukn100 eq189 hnf88 smp95 dnf192 smp75 tf100 neg91 sie118 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 12 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 60 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...