./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/cstrpbrk_true-termination_true-no-overflow.c --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_87485f49-b397-49ce-93a6-bde60bf3cc12/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_87485f49-b397-49ce-93a6-bde60bf3cc12/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_87485f49-b397-49ce-93a6-bde60bf3cc12/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_87485f49-b397-49ce-93a6-bde60bf3cc12/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/cstrpbrk_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_87485f49-b397-49ce-93a6-bde60bf3cc12/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_87485f49-b397-49ce-93a6-bde60bf3cc12/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 eec7850a55859668859d25c9503478e74955da1a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 00:26:16,897 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:26:16,898 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:26:16,905 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:26:16,905 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:26:16,906 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:26:16,907 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:26:16,908 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:26:16,909 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:26:16,910 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:26:16,910 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:26:16,911 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:26:16,911 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:26:16,912 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:26:16,913 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:26:16,913 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:26:16,914 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:26:16,915 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:26:16,917 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:26:16,918 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:26:16,919 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:26:16,920 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:26:16,921 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:26:16,921 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:26:16,922 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:26:16,922 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:26:16,923 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:26:16,924 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:26:16,924 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:26:16,925 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:26:16,925 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:26:16,926 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:26:16,926 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:26:16,926 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:26:16,927 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:26:16,927 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:26:16,927 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_87485f49-b397-49ce-93a6-bde60bf3cc12/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 00:26:16,937 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:26:16,937 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:26:16,938 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 00:26:16,938 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 00:26:16,938 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 00:26:16,938 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 00:26:16,939 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 00:26:16,939 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 00:26:16,939 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 00:26:16,939 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 00:26:16,939 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 00:26:16,939 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:26:16,939 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 00:26:16,940 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:26:16,940 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:26:16,940 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 00:26:16,940 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 00:26:16,940 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 00:26:16,940 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:26:16,940 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 00:26:16,940 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:26:16,941 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 00:26:16,941 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:26:16,941 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:26:16,941 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 00:26:16,941 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:26:16,941 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 00:26:16,941 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 00:26:16,942 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 00:26:16,942 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_87485f49-b397-49ce-93a6-bde60bf3cc12/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 -> eec7850a55859668859d25c9503478e74955da1a [2018-11-23 00:26:16,965 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:26:16,974 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:26:16,977 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:26:16,978 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:26:16,978 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:26:16,978 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_87485f49-b397-49ce-93a6-bde60bf3cc12/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/cstrpbrk_true-termination_true-no-overflow.c [2018-11-23 00:26:17,014 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_87485f49-b397-49ce-93a6-bde60bf3cc12/bin-2019/uautomizer/data/a8813156f/bcf666a643704bd9ba510309e4f2838d/FLAGf7e7dde72 [2018-11-23 00:26:17,324 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:26:17,324 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_87485f49-b397-49ce-93a6-bde60bf3cc12/sv-benchmarks/c/termination-crafted-lit/cstrpbrk_true-termination_true-no-overflow.c [2018-11-23 00:26:17,328 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_87485f49-b397-49ce-93a6-bde60bf3cc12/bin-2019/uautomizer/data/a8813156f/bcf666a643704bd9ba510309e4f2838d/FLAGf7e7dde72 [2018-11-23 00:26:17,339 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_87485f49-b397-49ce-93a6-bde60bf3cc12/bin-2019/uautomizer/data/a8813156f/bcf666a643704bd9ba510309e4f2838d [2018-11-23 00:26:17,342 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:26:17,343 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:26:17,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:26:17,344 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:26:17,346 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:26:17,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:26:17" (1/1) ... [2018-11-23 00:26:17,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46704e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:17, skipping insertion in model container [2018-11-23 00:26:17,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:26:17" (1/1) ... [2018-11-23 00:26:17,355 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:26:17,367 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:26:17,470 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:26:17,477 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:26:17,491 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:26:17,500 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:26:17,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:17 WrapperNode [2018-11-23 00:26:17,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:26:17,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:26:17,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:26:17,501 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:26:17,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:17" (1/1) ... [2018-11-23 00:26:17,512 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:17" (1/1) ... [2018-11-23 00:26:17,526 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:26:17,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:26:17,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:26:17,526 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:26:17,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:17" (1/1) ... [2018-11-23 00:26:17,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:17" (1/1) ... [2018-11-23 00:26:17,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:17" (1/1) ... [2018-11-23 00:26:17,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:17" (1/1) ... [2018-11-23 00:26:17,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:17" (1/1) ... [2018-11-23 00:26:17,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:17" (1/1) ... [2018-11-23 00:26:17,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:17" (1/1) ... [2018-11-23 00:26:17,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:26:17,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:26:17,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:26:17,586 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:26:17,587 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_87485f49-b397-49ce-93a6-bde60bf3cc12/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 00:26:17,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 00:26:17,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 00:26:17,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:26:17,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:26:17,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 00:26:17,817 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:26:17,817 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-11-23 00:26:17,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:26:17 BoogieIcfgContainer [2018-11-23 00:26:17,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:26:17,818 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 00:26:17,818 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 00:26:17,821 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 00:26:17,822 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 00:26:17,822 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 12:26:17" (1/3) ... [2018-11-23 00:26:17,823 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54064c4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:26:17, skipping insertion in model container [2018-11-23 00:26:17,823 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 00:26:17,823 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:17" (2/3) ... [2018-11-23 00:26:17,824 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54064c4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:26:17, skipping insertion in model container [2018-11-23 00:26:17,824 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 00:26:17,824 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:26:17" (3/3) ... [2018-11-23 00:26:17,825 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrpbrk_true-termination_true-no-overflow.c [2018-11-23 00:26:17,876 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 00:26:17,878 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 00:26:17,878 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 00:26:17,878 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 00:26:17,878 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:26:17,878 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:26:17,878 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 00:26:17,878 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:26:17,878 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 00:26:17,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-23 00:26:17,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 00:26:17,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:26:17,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:26:17,918 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:26:17,918 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 00:26:17,919 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 00:26:17,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-23 00:26:17,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 00:26:17,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:26:17,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:26:17,921 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:26:17,921 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 00:26:17,928 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 22#L14true assume !(build_nondet_String_~length~0 < 1); 18#L14-2true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 10#L19true main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 16#L14-3true assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 12#L14-5true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 8#L19-1true main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, 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; 4#L31-4true [2018-11-23 00:26:17,929 INFO L796 eck$LassoCheckResult]: Loop: 4#L31-4true call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 11#L31-1true assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 9#L34-5true assume !true; 5#L34-6true call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 23#L36true assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 6#L31-3true cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 4#L31-4true [2018-11-23 00:26:17,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:26:17,934 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2018-11-23 00:26:17,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:26:17,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:26:17,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:17,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:26:17,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:26:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:26:18,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:26:18,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1602834410, now seen corresponding path program 1 times [2018-11-23 00:26:18,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:26:18,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:26:18,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:18,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:26:18,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:26:18,090 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 00:26:18,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:26:18,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 00:26:18,094 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:26:18,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 00:26:18,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 00:26:18,105 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-23 00:26:18,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:26:18,111 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-11-23 00:26:18,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 00:26:18,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2018-11-23 00:26:18,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 00:26:18,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 20 transitions. [2018-11-23 00:26:18,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-23 00:26:18,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-23 00:26:18,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2018-11-23 00:26:18,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:26:18,118 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-23 00:26:18,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2018-11-23 00:26:18,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 00:26:18,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 00:26:18,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-11-23 00:26:18,136 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-23 00:26:18,136 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-23 00:26:18,136 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 00:26:18,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2018-11-23 00:26:18,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 00:26:18,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:26:18,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:26:18,137 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:26:18,137 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:26:18,138 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 62#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 63#L14 assume !(build_nondet_String_~length~0 < 1); 65#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 58#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 59#L14-3 assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 60#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 55#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, 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; 50#L31-4 [2018-11-23 00:26:18,138 INFO L796 eck$LassoCheckResult]: Loop: 50#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 51#L31-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 56#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 57#L34-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 61#L34-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6; 52#L34-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 53#L36 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 54#L31-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 50#L31-4 [2018-11-23 00:26:18,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:26:18,138 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 2 times [2018-11-23 00:26:18,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:26:18,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:26:18,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:18,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:26:18,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:26:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:26:18,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:26:18,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 1 times [2018-11-23 00:26:18,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:26:18,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:26:18,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:18,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:26:18,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:26:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:26:18,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:26:18,194 INFO L82 PathProgramCache]: Analyzing trace with hash -955886854, now seen corresponding path program 1 times [2018-11-23 00:26:18,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:26:18,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:26:18,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:18,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:26:18,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:26:18,399 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 00:26:18,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:26:18,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 00:26:18,520 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-11-23 00:26:18,672 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-23 00:26:18,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 00:26:18,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 00:26:18,673 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-11-23 00:26:18,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:26:18,824 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 00:26:18,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 00:26:18,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2018-11-23 00:26:18,827 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-23 00:26:18,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 35 transitions. [2018-11-23 00:26:18,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-23 00:26:18,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-23 00:26:18,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 35 transitions. [2018-11-23 00:26:18,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:26:18,829 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-23 00:26:18,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 35 transitions. [2018-11-23 00:26:18,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-11-23 00:26:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 00:26:18,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 00:26:18,832 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 00:26:18,833 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 00:26:18,833 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 00:26:18,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-11-23 00:26:18,835 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-23 00:26:18,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:26:18,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:26:18,835 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:26:18,835 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:26:18,836 INFO L794 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 131#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 132#L14 assume !(build_nondet_String_~length~0 < 1); 137#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 126#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 127#L14-3 assume !(build_nondet_String_~length~0 < 1); 129#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 130#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, 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; 142#L31-4 [2018-11-23 00:26:18,836 INFO L796 eck$LassoCheckResult]: Loop: 142#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 141#L31-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 124#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 125#L34-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 138#L34-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6; 139#L34-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 144#L36 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 143#L31-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 142#L31-4 [2018-11-23 00:26:18,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:26:18,836 INFO L82 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2018-11-23 00:26:18,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:26:18,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:26:18,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:18,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:26:18,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:26:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:26:18,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:26:18,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 2 times [2018-11-23 00:26:18,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:26:18,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:26:18,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:18,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:26:18,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:26:18,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:26:18,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:26:18,876 INFO L82 PathProgramCache]: Analyzing trace with hash -254822276, now seen corresponding path program 1 times [2018-11-23 00:26:18,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:26:18,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:26:18,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:18,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:26:18,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:26:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:26:19,023 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-11-23 00:26:19,154 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-23 00:26:19,359 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 102 [2018-11-23 00:26:19,456 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:26:19,457 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:26:19,457 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:26:19,457 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:26:19,457 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 00:26:19,457 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:26:19,457 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:26:19,457 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:26:19,458 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_true-termination_true-no-overflow.c_Iteration3_Lasso [2018-11-23 00:26:19,458 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:26:19,458 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:26:19,475 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 00:26:19,480 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 00:26:19,481 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 00:26:19,483 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 00:26:19,488 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 00:26:19,490 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 00:26:19,671 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2018-11-23 00:26:19,768 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 00:26:19,769 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 00:26:19,771 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 00:26:19,773 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 00:26:19,774 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 00:26:19,776 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 00:26:19,777 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 00:26:19,778 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 00:26:19,780 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 00:26:19,787 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 00:26:19,789 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 00:26:19,790 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 00:26:19,792 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 00:26:20,096 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:26:20,099 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 00:26:20,100 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 00:26:20,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:26:20,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:26:20,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:26:20,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:26:20,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:26:20,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:26:20,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:26:20,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:26:20,105 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 00:26:20,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:26:20,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:26:20,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:26:20,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:26:20,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:26:20,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:26:20,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:26:20,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:26:20,108 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 00:26:20,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:26:20,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:26:20,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:26:20,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:26:20,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:26:20,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:26:20,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:26:20,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:26:20,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 00:26:20,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:26:20,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:26:20,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:26:20,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:26:20,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:26:20,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:26:20,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:26:20,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:26:20,112 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 00:26:20,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:26:20,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:26:20,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:26:20,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:26:20,116 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:26:20,116 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:26:20,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:26:20,118 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 00:26:20,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:26:20,119 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:26:20,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:26:20,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:26:20,123 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 00:26:20,123 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:26:20,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:26:20,133 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 00:26:20,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:26:20,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:26:20,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:26:20,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:26:20,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:26:20,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:26:20,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:26:20,149 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 00:26:20,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:26:20,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:26:20,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:26:20,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:26:20,153 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:26:20,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:26:20,175 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 00:26:20,191 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 00:26:20,191 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 00:26:20,193 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 00:26:20,194 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 00:26:20,194 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 00:26:20,195 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1, ULTIMATE.start_cstrpbrk_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1 - 1*ULTIMATE.start_cstrpbrk_~sc1~0.offset Supporting invariants [] [2018-11-23 00:26:20,217 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2018-11-23 00:26:20,223 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 00:26:20,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:26:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:26:20,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:26:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:26:20,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:26:20,283 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 00:26:20,285 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 00:26:20,286 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-23 00:26:20,328 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 44 states and 52 transitions. Complement of second has 4 states. [2018-11-23 00:26:20,328 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 00:26:20,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 00:26:20,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2018-11-23 00:26:20,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 8 letters. [2018-11-23 00:26:20,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:26:20,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 16 letters. Loop has 8 letters. [2018-11-23 00:26:20,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:26:20,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 16 letters. [2018-11-23 00:26:20,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:26:20,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2018-11-23 00:26:20,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:26:20,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 22 states and 27 transitions. [2018-11-23 00:26:20,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-23 00:26:20,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 00:26:20,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2018-11-23 00:26:20,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 00:26:20,334 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-23 00:26:20,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2018-11-23 00:26:20,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 00:26:20,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 00:26:20,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-11-23 00:26:20,335 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-23 00:26:20,335 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-23 00:26:20,335 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 00:26:20,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2018-11-23 00:26:20,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:26:20,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:26:20,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:26:20,336 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:26:20,336 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 00:26:20,336 INFO L794 eck$LassoCheckResult]: Stem: 309#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 307#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 308#L14 assume !(build_nondet_String_~length~0 < 1); 311#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 302#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 303#L14-3 assume !(build_nondet_String_~length~0 < 1); 304#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 297#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, 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; 290#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 292#L31-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 298#L34-5 [2018-11-23 00:26:20,336 INFO L796 eck$LassoCheckResult]: Loop: 298#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 299#L34-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 305#L34-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 298#L34-5 [2018-11-23 00:26:20,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:26:20,336 INFO L82 PathProgramCache]: Analyzing trace with hash -2074270767, now seen corresponding path program 1 times [2018-11-23 00:26:20,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:26:20,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:26:20,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:20,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:26:20,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:26:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:26:20,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:26:20,356 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 1 times [2018-11-23 00:26:20,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:26:20,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:26:20,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:20,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:26:20,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:26:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:26:20,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:26:20,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1389069017, now seen corresponding path program 1 times [2018-11-23 00:26:20,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:26:20,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:26:20,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:20,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:26:20,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:26:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:26:20,772 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 114 [2018-11-23 00:26:20,841 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:26:20,841 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:26:20,841 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:26:20,842 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:26:20,842 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 00:26:20,842 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:26:20,842 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:26:20,842 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:26:20,842 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_true-termination_true-no-overflow.c_Iteration4_Lasso [2018-11-23 00:26:20,842 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:26:20,842 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:26:20,846 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 00:26:20,848 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 00:26:20,850 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 00:26:20,852 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 00:26:20,855 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 00:26:20,857 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 00:26:20,858 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 00:26:20,859 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 00:26:21,004 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2018-11-23 00:26:21,055 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 00:26:21,056 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 00:26:21,057 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 00:26:21,058 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 00:26:21,060 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 00:26:21,061 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 00:26:21,062 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 00:26:21,063 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 00:26:21,064 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 00:26:21,065 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 00:26:21,066 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 00:26:21,428 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-23 00:26:21,438 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:26:21,438 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 00:26:21,438 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 00:26:21,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:26:21,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:26:21,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:26:21,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:26:21,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:26:21,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:26:21,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:26:21,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:26:21,440 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 00:26:21,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:26:21,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:26:21,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:26:21,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:26:21,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:26:21,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:26:21,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:26:21,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:26:21,446 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 00:26:21,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:26:21,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:26:21,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:26:21,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:26:21,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:26:21,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:26:21,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:26:21,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:26:21,447 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 00:26:21,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:26:21,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:26:21,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:26:21,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:26:21,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:26:21,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:26:21,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:26:21,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:26:21,449 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 00:26:21,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:26:21,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:26:21,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:26:21,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:26:21,450 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:26:21,450 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:26:21,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:26:21,452 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 00:26:21,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:26:21,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:26:21,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:26:21,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:26:21,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:26:21,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:26:21,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:26:21,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:26:21,453 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 00:26:21,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:26:21,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:26:21,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:26:21,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:26:21,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:26:21,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:26:21,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:26:21,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:26:21,455 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 00:26:21,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:26:21,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:26:21,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:26:21,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:26:21,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:26:21,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:26:21,477 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 00:26:21,491 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 00:26:21,491 INFO L444 ModelExtractionUtils]: 41 out of 46 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 00:26:21,492 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 00:26:21,492 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 00:26:21,493 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 00:26:21,493 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0.base)_2, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0.base)_2 - 1*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2018-11-23 00:26:21,532 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-23 00:26:21,534 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 00:26:21,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:26:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:26:21,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:26:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:26:21,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:26:21,582 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 00:26:21,582 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 00:26:21,582 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-23 00:26:21,611 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 49 states and 59 transitions. Complement of second has 5 states. [2018-11-23 00:26:21,613 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 00:26:21,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 00:26:21,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2018-11-23 00:26:21,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-23 00:26:21,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:26:21,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 13 letters. Loop has 3 letters. [2018-11-23 00:26:21,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:26:21,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-23 00:26:21,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:26:21,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 59 transitions. [2018-11-23 00:26:21,617 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:26:21,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 35 states and 42 transitions. [2018-11-23 00:26:21,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-23 00:26:21,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-23 00:26:21,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2018-11-23 00:26:21,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 00:26:21,618 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-23 00:26:21,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2018-11-23 00:26:21,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2018-11-23 00:26:21,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 00:26:21,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-11-23 00:26:21,622 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-23 00:26:21,622 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-23 00:26:21,622 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 00:26:21,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2018-11-23 00:26:21,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:26:21,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:26:21,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:26:21,625 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:26:21,626 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 00:26:21,626 INFO L794 eck$LassoCheckResult]: Stem: 478#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 476#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 477#L14 assume !(build_nondet_String_~length~0 < 1); 480#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 470#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 471#L14-3 assume !(build_nondet_String_~length~0 < 1); 473#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 465#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, 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; 457#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 458#L31-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 472#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 479#L34-1 assume !cstrpbrk_#t~short7; 475#L34-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6; 462#L34-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 463#L36 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 464#L31-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 459#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 461#L31-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 466#L34-5 [2018-11-23 00:26:21,626 INFO L796 eck$LassoCheckResult]: Loop: 466#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 467#L34-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 474#L34-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 466#L34-5 [2018-11-23 00:26:21,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:26:21,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1703936771, now seen corresponding path program 1 times [2018-11-23 00:26:21,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:26:21,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:26:21,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:21,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:26:21,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:26:21,689 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 00:26:21,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:26:21,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 00:26:21,689 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 00:26:21,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:26:21,690 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 2 times [2018-11-23 00:26:21,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:26:21,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:26:21,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:21,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:26:21,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:26:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:26:21,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 00:26:21,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 00:26:21,805 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-11-23 00:26:21,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:26:21,849 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-11-23 00:26:21,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 00:26:21,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2018-11-23 00:26:21,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:26:21,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 31 transitions. [2018-11-23 00:26:21,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 00:26:21,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 00:26:21,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2018-11-23 00:26:21,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 00:26:21,851 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 00:26:21,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2018-11-23 00:26:21,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 00:26:21,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 00:26:21,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 00:26:21,854 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 00:26:21,854 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 00:26:21,854 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 00:26:21,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-11-23 00:26:21,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:26:21,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:26:21,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:26:21,855 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:26:21,855 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 00:26:21,855 INFO L794 eck$LassoCheckResult]: Stem: 553#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 551#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 552#L14 assume !(build_nondet_String_~length~0 < 1); 556#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 545#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 546#L14-3 assume !(build_nondet_String_~length~0 < 1); 547#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 540#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, 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; 532#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 533#L31-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 550#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 554#L34-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 555#L34-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6; 537#L34-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 538#L36 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 539#L31-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 534#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 536#L31-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 541#L34-5 [2018-11-23 00:26:21,855 INFO L796 eck$LassoCheckResult]: Loop: 541#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 542#L34-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 548#L34-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 541#L34-5 [2018-11-23 00:26:21,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:26:21,855 INFO L82 PathProgramCache]: Analyzing trace with hash -71070591, now seen corresponding path program 2 times [2018-11-23 00:26:21,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:26:21,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:26:21,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:21,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:26:21,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:26:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:26:21,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:26:21,877 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 3 times [2018-11-23 00:26:21,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:26:21,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:26:21,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:21,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:26:21,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:26:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:26:21,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:26:21,886 INFO L82 PathProgramCache]: Analyzing trace with hash 154934313, now seen corresponding path program 1 times [2018-11-23 00:26:21,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:26:21,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:26:21,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:21,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:26:21,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:26:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:26:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:26:22,096 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-11-23 00:26:22,573 WARN L180 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 151 [2018-11-23 00:26:23,098 WARN L180 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 109 [2018-11-23 00:26:23,100 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:26:23,100 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:26:23,100 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:26:23,100 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:26:23,100 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 00:26:23,100 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:26:23,100 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:26:23,100 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:26:23,100 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_true-termination_true-no-overflow.c_Iteration6_Lasso [2018-11-23 00:26:23,100 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:26:23,100 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:26:23,105 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 00:26:23,112 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 00:26:23,114 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 00:26:23,115 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 00:26:23,116 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 00:26:23,118 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 00:26:23,119 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 00:26:23,120 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 00:26:23,214 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 00:26:23,579 WARN L180 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2018-11-23 00:26:23,667 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 00:26:23,668 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 00:26:23,669 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 00:26:23,670 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 00:26:23,671 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 00:26:23,672 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 00:26:23,674 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 00:26:23,675 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 00:26:23,676 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 00:26:23,677 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 00:26:23,678 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 00:26:23,897 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 68 [2018-11-23 00:26:24,696 WARN L180 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 65 [2018-11-23 00:26:24,903 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-11-23 00:26:24,924 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:26:24,924 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 00:26:24,924 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 00:26:24,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:26:24,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:26:24,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:26:24,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:26:24,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:26:24,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:26:24,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:26:24,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:26:24,927 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 00:26:24,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:26:24,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:26:24,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:26:24,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:26:24,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:26:24,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:26:24,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:26:24,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:26:24,932 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 00:26:24,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:26:24,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:26:24,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:26:24,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:26:24,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:26:24,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:26:24,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:26:24,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:26:24,934 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 00:26:24,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:26:24,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:26:24,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:26:24,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:26:24,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:26:24,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:26:24,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:26:24,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:26:24,935 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 00:26:24,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:26:24,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:26:24,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:26:24,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:26:24,937 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:26:24,937 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:26:24,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:26:24,938 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 00:26:24,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:26:24,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:26:24,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:26:24,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:26:24,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:26:24,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:26:24,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:26:24,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:26:24,940 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 00:26:24,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:26:24,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:26:24,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:26:24,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:26:24,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:26:24,941 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:26:24,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:26:24,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:26:24,942 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 00:26:24,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:26:24,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:26:24,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:26:24,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:26:24,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:26:24,943 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:26:24,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:26:24,945 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 00:26:24,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:26:24,945 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:26:24,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:26:24,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:26:24,946 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 00:26:24,946 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:26:24,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:26:24,950 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 00:26:24,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:26:24,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:26:24,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:26:24,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:26:24,953 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:26:24,954 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:26:24,964 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 00:26:24,979 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 00:26:24,979 INFO L444 ModelExtractionUtils]: 40 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 00:26:24,980 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 00:26:24,981 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 00:26:24,981 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 00:26:24,981 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_3) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_3 Supporting invariants [] [2018-11-23 00:26:25,061 INFO L297 tatePredicateManager]: 18 out of 19 supporting invariants were superfluous and have been removed [2018-11-23 00:26:25,063 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 00:26:25,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:26:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:26:25,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:26:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:26:25,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:26:25,131 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 00:26:25,131 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-23 00:26:25,131 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-23 00:26:25,180 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 43 states and 48 transitions. Complement of second has 7 states. [2018-11-23 00:26:25,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 00:26:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 00:26:25,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-23 00:26:25,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-23 00:26:25,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:26:25,181 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 00:26:25,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:26:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:26:25,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:26:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:26:25,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:26:25,268 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 00:26:25,269 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-23 00:26:25,269 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-23 00:26:25,306 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 43 states and 48 transitions. Complement of second has 7 states. [2018-11-23 00:26:25,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 00:26:25,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 00:26:25,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-23 00:26:25,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-23 00:26:25,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:26:25,308 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 00:26:25,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:26:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:26:25,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:26:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:26:25,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:26:25,371 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 00:26:25,371 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-23 00:26:25,372 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-23 00:26:25,412 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 42 states and 48 transitions. Complement of second has 6 states. [2018-11-23 00:26:25,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 00:26:25,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 00:26:25,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-23 00:26:25,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-23 00:26:25,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:26:25,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 21 letters. Loop has 3 letters. [2018-11-23 00:26:25,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:26:25,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 18 letters. Loop has 6 letters. [2018-11-23 00:26:25,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:26:25,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 48 transitions. [2018-11-23 00:26:25,415 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 00:26:25,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 0 states and 0 transitions. [2018-11-23 00:26:25,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 00:26:25,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 00:26:25,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 00:26:25,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:26:25,416 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 00:26:25,416 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 00:26:25,416 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 00:26:25,416 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 00:26:25,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 00:26:25,416 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 00:26:25,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 00:26:25,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 12:26:25 BoogieIcfgContainer [2018-11-23 00:26:25,421 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 00:26:25,422 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:26:25,422 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:26:25,422 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:26:25,422 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:26:17" (3/4) ... [2018-11-23 00:26:25,425 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 00:26:25,425 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:26:25,426 INFO L168 Benchmark]: Toolchain (without parser) took 8084.06 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 263.7 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -165.1 MB). Peak memory consumption was 98.6 MB. Max. memory is 11.5 GB. [2018-11-23 00:26:25,427 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:26:25,427 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.64 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:26:25,427 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.39 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:26:25,428 INFO L168 Benchmark]: Boogie Preprocessor took 59.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -196.5 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:26:25,428 INFO L168 Benchmark]: RCFGBuilder took 231.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-23 00:26:25,429 INFO L168 Benchmark]: BuchiAutomizer took 7603.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 118.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 986.9 kB). Peak memory consumption was 119.5 MB. Max. memory is 11.5 GB. [2018-11-23 00:26:25,429 INFO L168 Benchmark]: Witness Printer took 3.81 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:26:25,432 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 156.64 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.39 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -196.5 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 231.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7603.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 118.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 986.9 kB). Peak memory consumption was 119.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.81 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[build_nondet_String()] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[malloc(length * sizeof(char))] and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.5s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 6.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 132 SDtfs, 156 SDslu, 135 SDs, 0 SdLazy, 195 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital369 mio100 ax100 hnf99 lsp92 ukn69 mio100 lsp45 div131 bol100 ite100 ukn100 eq170 hnf79 smp82 dnf1036 smp24 tf100 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 4 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...