./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrpbrk_reverse_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bffbd9ba-d80f-4585-ba30-460c54b4e65d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bffbd9ba-d80f-4585-ba30-460c54b4e65d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bffbd9ba-d80f-4585-ba30-460c54b4e65d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bffbd9ba-d80f-4585-ba30-460c54b4e65d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrpbrk_reverse_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_bffbd9ba-d80f-4585-ba30-460c54b4e65d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bffbd9ba-d80f-4585-ba30-460c54b4e65d/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2f11210fb32f4d3c697b29c6d0c40652627e6e63 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 13:28:46,749 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:28:46,751 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:28:46,758 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:28:46,758 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:28:46,759 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:28:46,760 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:28:46,761 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:28:46,762 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:28:46,763 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:28:46,763 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:28:46,763 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:28:46,764 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:28:46,765 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:28:46,765 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:28:46,766 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:28:46,767 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:28:46,768 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:28:46,769 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:28:46,770 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:28:46,771 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:28:46,772 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:28:46,773 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:28:46,774 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:28:46,774 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:28:46,774 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:28:46,775 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:28:46,776 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:28:46,776 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:28:46,777 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:28:46,777 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:28:46,778 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:28:46,778 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:28:46,778 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:28:46,779 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:28:46,779 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:28:46,779 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bffbd9ba-d80f-4585-ba30-460c54b4e65d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 13:28:46,790 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:28:46,790 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:28:46,791 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:28:46,791 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:28:46,791 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:28:46,792 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 13:28:46,792 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 13:28:46,792 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 13:28:46,792 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 13:28:46,792 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 13:28:46,792 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 13:28:46,792 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:28:46,792 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 13:28:46,793 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:28:46,793 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:28:46,793 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 13:28:46,793 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 13:28:46,793 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 13:28:46,793 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:28:46,793 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 13:28:46,793 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:28:46,793 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 13:28:46,794 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:28:46,794 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:28:46,794 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 13:28:46,794 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:28:46,794 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:28:46,794 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 13:28:46,794 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 13:28:46,795 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_bffbd9ba-d80f-4585-ba30-460c54b4e65d/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f11210fb32f4d3c697b29c6d0c40652627e6e63 [2018-11-23 13:28:46,815 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:28:46,822 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:28:46,824 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:28:46,825 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:28:46,825 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:28:46,826 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bffbd9ba-d80f-4585-ba30-460c54b4e65d/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrpbrk_reverse_alloca_true-termination.c.i [2018-11-23 13:28:46,861 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bffbd9ba-d80f-4585-ba30-460c54b4e65d/bin-2019/uautomizer/data/b289e8ff4/c4faebf14ad44a3e8fcf4c62c1aad7ae/FLAG6a286cb72 [2018-11-23 13:28:47,319 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:28:47,320 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bffbd9ba-d80f-4585-ba30-460c54b4e65d/sv-benchmarks/c/termination-15/cstrpbrk_reverse_alloca_true-termination.c.i [2018-11-23 13:28:47,326 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bffbd9ba-d80f-4585-ba30-460c54b4e65d/bin-2019/uautomizer/data/b289e8ff4/c4faebf14ad44a3e8fcf4c62c1aad7ae/FLAG6a286cb72 [2018-11-23 13:28:47,336 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bffbd9ba-d80f-4585-ba30-460c54b4e65d/bin-2019/uautomizer/data/b289e8ff4/c4faebf14ad44a3e8fcf4c62c1aad7ae [2018-11-23 13:28:47,338 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:28:47,339 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:28:47,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:28:47,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:28:47,341 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:28:47,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:28:47" (1/1) ... [2018-11-23 13:28:47,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28603259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:47, skipping insertion in model container [2018-11-23 13:28:47,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:28:47" (1/1) ... [2018-11-23 13:28:47,350 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:28:47,380 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:28:47,583 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:28:47,590 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:28:47,676 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:28:47,706 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:28:47,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:47 WrapperNode [2018-11-23 13:28:47,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:28:47,707 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:28:47,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:28:47,707 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:28:47,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:47" (1/1) ... [2018-11-23 13:28:47,723 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:47" (1/1) ... [2018-11-23 13:28:47,738 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:28:47,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:28:47,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:28:47,738 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:28:47,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:47" (1/1) ... [2018-11-23 13:28:47,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:47" (1/1) ... [2018-11-23 13:28:47,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:47" (1/1) ... [2018-11-23 13:28:47,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:47" (1/1) ... [2018-11-23 13:28:47,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:47" (1/1) ... [2018-11-23 13:28:47,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:47" (1/1) ... [2018-11-23 13:28:47,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:47" (1/1) ... [2018-11-23 13:28:47,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:28:47,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:28:47,755 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:28:47,755 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:28:47,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bffbd9ba-d80f-4585-ba30-460c54b4e65d/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-11-23 13:28:47,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:28:47,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:28:47,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:28:47,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:28:47,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:28:47,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:28:47,959 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:28:47,959 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 13:28:47,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:28:47 BoogieIcfgContainer [2018-11-23 13:28:47,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:28:47,959 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 13:28:47,959 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 13:28:47,962 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 13:28:47,962 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:28:47,962 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 01:28:47" (1/3) ... [2018-11-23 13:28:47,963 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@276f111d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:28:47, skipping insertion in model container [2018-11-23 13:28:47,963 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:28:47,963 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:28:47" (2/3) ... [2018-11-23 13:28:47,963 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@276f111d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:28:47, skipping insertion in model container [2018-11-23 13:28:47,964 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:28:47,964 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:28:47" (3/3) ... [2018-11-23 13:28:47,965 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrpbrk_reverse_alloca_true-termination.c.i [2018-11-23 13:28:48,001 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:28:48,001 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 13:28:48,002 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 13:28:48,002 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 13:28:48,002 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:28:48,002 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:28:48,002 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 13:28:48,002 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:28:48,002 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 13:28:48,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 13:28:48,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 13:28:48,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:28:48,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:28:48,034 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 13:28:48,034 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 13:28:48,034 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 13:28:48,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 13:28:48,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 13:28:48,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:28:48,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:28:48,036 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 13:28:48,036 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 13:28:48,042 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 10#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 6#L369-4true [2018-11-23 13:28:48,043 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 18#L369-1true assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 8#L374true assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 5#L369-3true cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset - 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 6#L369-4true [2018-11-23 13:28:48,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:28:48,048 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-23 13:28:48,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:28:48,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:28:48,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:28:48,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:28:48,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:28:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:28:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:28:48,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:28:48,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-11-23 13:28:48,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:28:48,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:28:48,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:28:48,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:28:48,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:28:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:28:48,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:28:48,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:28:48,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:28:48,185 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 13:28:48,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:28:48,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:28:48,196 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-23 13:28:48,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:28:48,200 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-23 13:28:48,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:28:48,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-11-23 13:28:48,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 13:28:48,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-11-23 13:28:48,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 13:28:48,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 13:28:48,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-11-23 13:28:48,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:28:48,208 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 13:28:48,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-11-23 13:28:48,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 13:28:48,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:28:48,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-11-23 13:28:48,230 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 13:28:48,230 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 13:28:48,230 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 13:28:48,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-11-23 13:28:48,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 13:28:48,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:28:48,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:28:48,231 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 13:28:48,231 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:28:48,232 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 47#L369-4 [2018-11-23 13:28:48,232 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 48#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 56#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 53#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 54#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209; 44#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 45#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 46#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset - 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 47#L369-4 [2018-11-23 13:28:48,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:28:48,232 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-23 13:28:48,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:28:48,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:28:48,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:28:48,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:28:48,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:28:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:28:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:28:48,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:28:48,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-11-23 13:28:48,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:28:48,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:28:48,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:28:48,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:28:48,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:28:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:28:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:28:48,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:28:48,277 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-11-23 13:28:48,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:28:48,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:28:48,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:28:48,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:28:48,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:28:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:28:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:28:48,481 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-11-23 13:28:48,687 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-11-23 13:28:48,840 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2018-11-23 13:28:48,913 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:28:48,914 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:28:48,914 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:28:48,914 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:28:48,914 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:28:48,914 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:28:48,915 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:28:48,915 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:28:48,915 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_reverse_alloca_true-termination.c.i_Iteration2_Lasso [2018-11-23 13:28:48,915 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:28:48,915 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:28:48,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:48,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:48,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:48,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:48,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:48,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:48,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:48,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:48,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:48,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:48,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:48,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:48,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-11-23 13:28:48,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-11-23 13:28:48,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-11-23 13:28:48,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:48,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:48,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:48,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:49,134 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2018-11-23 13:28:49,280 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2018-11-23 13:28:49,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-11-23 13:28:49,690 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:28:49,695 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:28:49,696 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-11-23 13:28:49,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:49,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:28:49,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:49,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:49,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:49,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:28:49,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:28:49,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:49,701 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-11-23 13:28:49,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:49,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:28:49,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:49,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:49,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:49,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:28:49,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:28:49,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:49,704 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-11-23 13:28:49,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:49,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:28:49,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:49,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:49,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:49,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:28:49,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:28:49,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:49,706 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-11-23 13:28:49,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:49,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:49,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:49,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:49,708 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:28:49,708 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:28:49,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:49,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:28:49,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:49,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:28:49,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:49,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:49,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:49,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:28:49,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:28:49,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:49,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-11-23 13:28:49,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:49,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:28:49,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:49,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:49,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:49,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:28:49,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:28:49,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:49,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-11-23 13:28:49,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:49,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:49,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:49,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:49,717 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:28:49,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:28:49,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:49,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-11-23 13:28:49,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:49,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:28:49,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:49,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:49,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:49,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:28:49,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:28:49,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:49,722 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-11-23 13:28:49,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:49,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:28:49,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:49,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:49,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:49,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:28:49,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:28:49,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:49,723 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-11-23 13:28:49,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:49,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:28:49,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:49,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:49,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:49,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:28:49,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:28:49,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:49,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:28:49,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:49,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:28:49,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:49,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:49,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:49,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:28:49,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:28:49,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:49,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-11-23 13:28:49,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:49,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:28:49,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:49,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:49,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:49,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:28:49,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:28:49,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:49,729 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-11-23 13:28:49,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:49,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:28:49,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:49,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:49,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:49,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:28:49,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:28:49,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:49,731 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-11-23 13:28:49,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:49,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:28:49,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:49,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:49,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:49,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:28:49,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:28:49,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:49,734 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-11-23 13:28:49,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:49,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:28:49,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:49,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:49,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:49,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:28:49,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:28:49,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:49,735 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-11-23 13:28:49,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:49,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:28:49,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:49,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:49,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:49,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:28:49,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:28:49,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:49,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:28:49,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:49,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:28:49,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:49,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:49,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:49,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:28:49,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:28:49,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:49,740 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-11-23 13:28:49,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:49,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:28:49,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:49,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:49,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:49,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:28:49,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:28:49,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:49,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:28:49,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:49,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:49,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:49,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:49,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:28:49,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:28:49,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:49,746 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-11-23 13:28:49,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:49,747 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:28:49,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:49,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:49,750 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:28:49,750 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:28:49,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:49,764 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-11-23 13:28:49,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:49,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:49,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:49,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:49,766 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:28:49,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:28:49,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:49,769 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-11-23 13:28:49,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:49,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:49,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:49,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:49,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:28:49,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:28:49,810 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:28:49,830 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 13:28:49,830 INFO L444 ModelExtractionUtils]: 46 out of 52 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 13:28:49,832 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:28:49,833 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:28:49,833 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:28:49,834 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~sc1~0.offset) = 2*ULTIMATE.start_cstrpbrk_~sc1~0.offset + 1 Supporting invariants [] [2018-11-23 13:28:49,869 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-23 13:28:49,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:28:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:28:49,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:28:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:28:49,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:28:49,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:28:49,912 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-11-23 13:28:49,912 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-23 13:28:49,940 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2018-11-23 13:28:49,940 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-11-23 13:28:49,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:28:49,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-11-23 13:28:49,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-23 13:28:49,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:28:49,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-11-23 13:28:49,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:28:49,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-11-23 13:28:49,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:28:49,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-23 13:28:49,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 13:28:49,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-11-23 13:28:49,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 13:28:49,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 13:28:49,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-11-23 13:28:49,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:28:49,945 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 13:28:49,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-11-23 13:28:49,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 13:28:49,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:28:49,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-23 13:28:49,947 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 13:28:49,947 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 13:28:49,947 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 13:28:49,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-11-23 13:28:49,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 13:28:49,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:28:49,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:28:49,948 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:28:49,948 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 13:28:49,948 INFO L794 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 181#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 182#L382 assume !(main_~length1~0 < 1); 183#L382-2 assume !(main_~length2~0 < 1); 180#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 177#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 179#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 189#L372-5 [2018-11-23 13:28:49,948 INFO L796 eck$LassoCheckResult]: Loop: 189#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 184#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 185#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 189#L372-5 [2018-11-23 13:28:49,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:28:49,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-11-23 13:28:49,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:28:49,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:28:49,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:28:49,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:28:49,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:28:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:28:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:28:49,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:28:49,969 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-11-23 13:28:49,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:28:49,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:28:49,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:28:49,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:28:49,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:28:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:28:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:28:49,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:28:49,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-11-23 13:28:49,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:28:49,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:28:49,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:28:49,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:28:49,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:28:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:28:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:28:50,286 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 94 [2018-11-23 13:28:50,368 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:28:50,368 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:28:50,368 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:28:50,368 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:28:50,368 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:28:50,368 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:28:50,368 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:28:50,368 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:28:50,369 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_reverse_alloca_true-termination.c.i_Iteration3_Lasso [2018-11-23 13:28:50,369 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:28:50,369 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:28:50,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:50,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:50,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:50,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:50,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:50,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:50,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:50,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:50,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:50,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:50,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:50,546 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2018-11-23 13:28:50,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:50,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:50,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:50,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:50,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:50,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:50,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:50,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:50,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:50,974 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:28:50,975 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:28:50,975 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-11-23 13:28:50,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:50,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:28:50,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:50,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:50,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:50,976 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:28:50,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:28:50,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:50,977 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-11-23 13:28:50,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:50,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:28:50,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:50,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:50,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:50,978 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:28:50,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:28:50,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:50,979 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-11-23 13:28:50,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:50,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:50,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:50,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:50,980 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:28:50,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:28:50,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:50,982 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-11-23 13:28:50,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:50,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:28:50,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:50,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:50,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:50,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:28:50,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:28:50,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:50,987 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-11-23 13:28:50,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:50,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:28:50,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:50,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:50,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:50,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:28:50,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:28:50,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:50,988 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-11-23 13:28:50,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:50,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:28:50,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:50,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:50,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:50,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:28:50,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:28:50,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:50,990 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-11-23 13:28:50,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:50,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:28:50,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:50,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:50,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:50,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:28:50,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:28:50,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:50,993 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-11-23 13:28:50,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:50,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:50,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:50,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:50,994 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:28:50,994 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:28:50,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:50,996 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-11-23 13:28:50,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:50,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:28:50,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:50,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:50,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:50,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:28:50,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:28:51,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:51,000 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-11-23 13:28:51,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:51,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:28:51,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:51,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:51,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:51,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:28:51,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:28:51,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:51,002 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-11-23 13:28:51,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:51,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:51,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:51,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:51,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:28:51,003 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:28:51,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:51,005 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-11-23 13:28:51,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:51,005 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:28:51,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:51,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:51,007 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:28:51,007 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:28:51,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:51,014 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-11-23 13:28:51,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:51,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:51,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:51,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:51,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:28:51,015 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:28:51,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:51,017 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-11-23 13:28:51,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:51,017 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:28:51,017 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-23 13:28:51,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:51,035 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2018-11-23 13:28:51,035 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-23 13:28:51,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:51,110 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-11-23 13:28:51,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:51,111 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:28:51,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:51,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:51,112 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:28:51,112 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:28:51,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:51,117 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-11-23 13:28:51,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:51,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:51,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:51,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:51,120 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:28:51,120 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:28:51,132 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:28:51,147 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 13:28:51,147 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 13:28:51,147 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:28:51,148 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:28:51,148 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:28:51,148 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2 + 2*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2018-11-23 13:28:51,201 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-23 13:28:51,203 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 13:28:51,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:28:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:28:51,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:28:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:28:51,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:28:51,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:28:51,272 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-11-23 13:28:51,272 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-23 13:28:51,328 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2018-11-23 13:28:51,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 13:28:51,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:28:51,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 13:28:51,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-23 13:28:51,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:28:51,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-23 13:28:51,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:28:51,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-23 13:28:51,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:28:51,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-11-23 13:28:51,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 13:28:51,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-11-23 13:28:51,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 13:28:51,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 13:28:51,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-11-23 13:28:51,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:28:51,332 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-11-23 13:28:51,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-11-23 13:28:51,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-11-23 13:28:51,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:28:51,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-11-23 13:28:51,335 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-23 13:28:51,335 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-23 13:28:51,335 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 13:28:51,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-11-23 13:28:51,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 13:28:51,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:28:51,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:28:51,336 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:28:51,336 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 13:28:51,337 INFO L794 eck$LassoCheckResult]: Stem: 369#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 362#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 363#L382 assume !(main_~length1~0 < 1); 364#L382-2 assume !(main_~length2~0 < 1); 361#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 357#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 358#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 371#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 367#L372-1 assume !cstrpbrk_#t~short210; 368#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209; 353#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 354#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 355#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset - 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 356#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 360#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 370#L372-5 [2018-11-23 13:28:51,337 INFO L796 eck$LassoCheckResult]: Loop: 370#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 365#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 366#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 370#L372-5 [2018-11-23 13:28:51,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:28:51,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-11-23 13:28:51,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:28:51,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:28:51,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:28:51,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:28:51,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:28:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:28:51,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:28:51,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:28:51,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 13:28:51,394 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:28:51,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:28:51,394 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-11-23 13:28:51,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:28:51,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:28:51,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:28:51,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:28:51,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:28:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:28:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:28:51,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:28:51,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:28:51,541 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-23 13:28:51,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:28:51,594 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2018-11-23 13:28:51,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:28:51,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2018-11-23 13:28:51,595 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:28:51,596 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2018-11-23 13:28:51,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 13:28:51,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 13:28:51,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2018-11-23 13:28:51,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:28:51,596 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-23 13:28:51,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2018-11-23 13:28:51,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-11-23 13:28:51,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:28:51,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-11-23 13:28:51,598 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-23 13:28:51,598 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-23 13:28:51,598 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 13:28:51,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2018-11-23 13:28:51,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 13:28:51,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:28:51,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:28:51,599 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:28:51,599 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 13:28:51,599 INFO L794 eck$LassoCheckResult]: Stem: 437#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 434#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 435#L382 assume !(main_~length1~0 < 1); 436#L382-2 assume !(main_~length2~0 < 1); 433#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 429#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 430#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 443#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 447#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 446#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209; 425#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 426#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 427#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset - 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 428#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 432#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 442#L372-5 [2018-11-23 13:28:51,599 INFO L796 eck$LassoCheckResult]: Loop: 442#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 438#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 439#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 442#L372-5 [2018-11-23 13:28:51,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:28:51,599 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-11-23 13:28:51,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:28:51,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:28:51,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:28:51,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:28:51,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:28:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:28:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:28:51,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:28:51,625 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-11-23 13:28:51,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:28:51,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:28:51,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:28:51,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:28:51,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:28:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:28:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:28:51,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:28:51,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-11-23 13:28:51,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:28:51,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:28:51,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:28:51,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:28:51,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:28:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:28:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:28:52,102 WARN L180 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 132 [2018-11-23 13:28:52,630 WARN L180 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 110 [2018-11-23 13:28:52,631 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:28:52,631 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:28:52,631 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:28:52,631 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:28:52,631 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:28:52,632 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:28:52,632 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:28:52,632 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:28:52,632 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_reverse_alloca_true-termination.c.i_Iteration5_Lasso [2018-11-23 13:28:52,632 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:28:52,632 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:28:52,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:52,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:52,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:52,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:52,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:52,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:52,770 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 13:28:53,123 WARN L180 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 99 [2018-11-23 13:28:53,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:53,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:53,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:53,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:53,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:53,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:53,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:53,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:53,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:53,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:53,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:53,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:53,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:53,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:28:53,491 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 80 [2018-11-23 13:28:53,531 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 13:28:55,425 WARN L180 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 137 DAG size of output: 84 [2018-11-23 13:28:55,702 WARN L180 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-11-23 13:28:55,713 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:28:55,713 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:28:55,714 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-11-23 13:28:55,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:55,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:28:55,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:55,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:55,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:55,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:28:55,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:28:55,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:55,716 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-11-23 13:28:55,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:55,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:28:55,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:55,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:55,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:55,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:28:55,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:28:55,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:55,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:28:55,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:55,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:28:55,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:55,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:55,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:55,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:28:55,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:28:55,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:55,719 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-11-23 13:28:55,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:55,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:28:55,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:55,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:55,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:55,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:28:55,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:28:55,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:55,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:28:55,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:55,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:55,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:55,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:55,722 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:28:55,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:28:55,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:28:55,723 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-11-23 13:28:55,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:28:55,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:28:55,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:28:55,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:28:55,726 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:28:55,726 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:28:55,745 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:28:55,753 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 13:28:55,753 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 13:28:55,754 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:28:55,754 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-23 13:28:55,755 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:28:55,755 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_3, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_3 + 4*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_3 - 2 >= 0] [2018-11-23 13:28:55,851 INFO L297 tatePredicateManager]: 29 out of 30 supporting invariants were superfluous and have been removed [2018-11-23 13:28:55,853 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 13:28:55,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:28:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:28:55,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:28:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:28:55,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:28:55,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:28:55,935 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2018-11-23 13:28:55,935 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 7 states. [2018-11-23 13:28:55,968 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 7 states. Result 26 states and 35 transitions. Complement of second has 4 states. [2018-11-23 13:28:55,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-23 13:28:55,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:28:55,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-23 13:28:55,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 13:28:55,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:28:55,969 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:28:55,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:28:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:28:56,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:28:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:28:56,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:28:56,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:28:56,063 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2018-11-23 13:28:56,063 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 7 states. [2018-11-23 13:28:56,113 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 7 states. Result 26 states and 35 transitions. Complement of second has 4 states. [2018-11-23 13:28:56,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-23 13:28:56,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:28:56,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-23 13:28:56,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 13:28:56,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:28:56,116 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:28:56,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:28:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:28:56,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:28:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:28:56,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:28:56,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:28:56,190 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2018-11-23 13:28:56,190 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 7 states. [2018-11-23 13:28:56,285 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 7 states. Result 44 states and 56 transitions. Complement of second has 8 states. [2018-11-23 13:28:56,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 1 non-accepting loop states 2 accepting loop states [2018-11-23 13:28:56,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:28:56,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2018-11-23 13:28:56,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 13:28:56,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:28:56,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-23 13:28:56,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:28:56,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-23 13:28:56,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:28:56,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 56 transitions. [2018-11-23 13:28:56,287 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 13:28:56,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2018-11-23 13:28:56,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 13:28:56,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 13:28:56,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 13:28:56,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:28:56,287 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:28:56,287 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:28:56,287 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:28:56,287 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 13:28:56,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:28:56,288 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 13:28:56,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 13:28:56,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 01:28:56 BoogieIcfgContainer [2018-11-23 13:28:56,291 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 13:28:56,292 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:28:56,292 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:28:56,292 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:28:56,292 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:28:47" (3/4) ... [2018-11-23 13:28:56,295 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 13:28:56,295 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:28:56,295 INFO L168 Benchmark]: Toolchain (without parser) took 8957.25 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 323.0 MB). Free memory was 955.5 MB in the beginning and 1.3 GB in the end (delta: -314.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2018-11-23 13:28:56,296 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:28:56,296 INFO L168 Benchmark]: CACSL2BoogieTranslator took 367.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -171.7 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-11-23 13:28:56,297 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:28:56,297 INFO L168 Benchmark]: Boogie Preprocessor took 16.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:28:56,297 INFO L168 Benchmark]: RCFGBuilder took 204.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:28:56,298 INFO L168 Benchmark]: BuchiAutomizer took 8332.13 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -170.0 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2018-11-23 13:28:56,298 INFO L168 Benchmark]: Witness Printer took 3.00 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:28:56,301 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 367.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -171.7 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 204.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8332.13 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -170.0 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.00 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * sc1 + 1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] + 2 * s and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length1 * sizeof(char))] + 4 * s and consists of 7 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 7.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 97 SDtfs, 116 SDslu, 114 SDs, 0 SdLazy, 132 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital367 mio100 ax100 hnf99 lsp92 ukn73 mio100 lsp63 div102 bol100 ite100 ukn100 eq192 hnf88 smp79 dnf1409 smp30 tf100 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 93ms VariablesStem: 2 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 108 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...