./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/cstrpbrk_mixed_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_540c6300-ed31-4da0-bd01-65be94caf446/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_540c6300-ed31-4da0-bd01-65be94caf446/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_540c6300-ed31-4da0-bd01-65be94caf446/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_540c6300-ed31-4da0-bd01-65be94caf446/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrpbrk_mixed_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_540c6300-ed31-4da0-bd01-65be94caf446/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_540c6300-ed31-4da0-bd01-65be94caf446/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 c9cfd4c0ab406cfeab77b774b2e25db3fba848a9 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 15:07:57,827 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:07:57,828 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:07:57,836 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:07:57,836 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:07:57,836 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:07:57,837 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:07:57,838 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:07:57,840 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:07:57,840 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:07:57,841 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:07:57,841 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:07:57,841 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:07:57,842 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:07:57,843 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:07:57,843 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:07:57,843 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:07:57,844 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:07:57,846 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:07:57,846 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:07:57,847 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:07:57,848 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:07:57,849 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:07:57,850 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:07:57,850 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:07:57,850 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:07:57,851 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:07:57,851 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:07:57,852 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:07:57,852 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:07:57,852 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:07:57,853 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:07:57,853 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:07:57,853 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:07:57,854 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:07:57,854 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:07:57,854 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_540c6300-ed31-4da0-bd01-65be94caf446/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 15:07:57,864 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:07:57,864 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:07:57,865 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 15:07:57,865 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 15:07:57,865 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 15:07:57,866 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 15:07:57,866 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 15:07:57,866 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 15:07:57,866 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 15:07:57,866 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 15:07:57,866 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 15:07:57,866 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:07:57,866 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 15:07:57,866 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:07:57,867 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:07:57,867 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 15:07:57,867 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 15:07:57,867 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 15:07:57,867 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:07:57,867 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 15:07:57,870 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:07:57,870 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 15:07:57,870 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:07:57,871 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:07:57,871 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 15:07:57,871 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:07:57,871 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 15:07:57,871 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 15:07:57,872 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 15:07:57,872 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_540c6300-ed31-4da0-bd01-65be94caf446/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 -> c9cfd4c0ab406cfeab77b774b2e25db3fba848a9 [2018-11-18 15:07:57,893 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:07:57,902 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:07:57,905 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:07:57,906 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:07:57,906 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:07:57,907 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_540c6300-ed31-4da0-bd01-65be94caf446/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrpbrk_mixed_alloca_true-termination.c.i [2018-11-18 15:07:57,945 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_540c6300-ed31-4da0-bd01-65be94caf446/bin-2019/uautomizer/data/7da8d85b4/2bd8c955e6834a5daf4e05b33a80a636/FLAGe61fb1791 [2018-11-18 15:07:58,369 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:07:58,370 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_540c6300-ed31-4da0-bd01-65be94caf446/sv-benchmarks/c/termination-15/cstrpbrk_mixed_alloca_true-termination.c.i [2018-11-18 15:07:58,375 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_540c6300-ed31-4da0-bd01-65be94caf446/bin-2019/uautomizer/data/7da8d85b4/2bd8c955e6834a5daf4e05b33a80a636/FLAGe61fb1791 [2018-11-18 15:07:58,383 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_540c6300-ed31-4da0-bd01-65be94caf446/bin-2019/uautomizer/data/7da8d85b4/2bd8c955e6834a5daf4e05b33a80a636 [2018-11-18 15:07:58,385 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:07:58,386 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:07:58,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:07:58,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:07:58,389 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:07:58,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:07:58" (1/1) ... [2018-11-18 15:07:58,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@249d3f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:07:58, skipping insertion in model container [2018-11-18 15:07:58,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:07:58" (1/1) ... [2018-11-18 15:07:58,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:07:58,422 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:07:58,614 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:07:58,620 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:07:58,700 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:07:58,732 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:07:58,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:07:58 WrapperNode [2018-11-18 15:07:58,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:07:58,732 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:07:58,733 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:07:58,733 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:07:58,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:07:58" (1/1) ... [2018-11-18 15:07:58,748 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:07:58" (1/1) ... [2018-11-18 15:07:58,763 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:07:58,763 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:07:58,763 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:07:58,763 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:07:58,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:07:58" (1/1) ... [2018-11-18 15:07:58,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:07:58" (1/1) ... [2018-11-18 15:07:58,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:07:58" (1/1) ... [2018-11-18 15:07:58,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:07:58" (1/1) ... [2018-11-18 15:07:58,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:07:58" (1/1) ... [2018-11-18 15:07:58,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:07:58" (1/1) ... [2018-11-18 15:07:58,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:07:58" (1/1) ... [2018-11-18 15:07:58,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:07:58,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:07:58,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:07:58,779 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:07:58,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:07:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_540c6300-ed31-4da0-bd01-65be94caf446/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-18 15:07:58,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 15:07:58,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 15:07:58,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 15:07:58,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 15:07:58,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:07:58,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:07:59,031 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:07:59,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:07:59 BoogieIcfgContainer [2018-11-18 15:07:59,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:07:59,032 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 15:07:59,032 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 15:07:59,036 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 15:07:59,036 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:07:59,037 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 03:07:58" (1/3) ... [2018-11-18 15:07:59,038 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1cda069a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 03:07:59, skipping insertion in model container [2018-11-18 15:07:59,038 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:07:59,038 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:07:58" (2/3) ... [2018-11-18 15:07:59,038 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1cda069a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 03:07:59, skipping insertion in model container [2018-11-18 15:07:59,038 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:07:59,038 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:07:59" (3/3) ... [2018-11-18 15:07:59,040 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrpbrk_mixed_alloca_true-termination.c.i [2018-11-18 15:07:59,088 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 15:07:59,089 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 15:07:59,089 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 15:07:59,089 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 15:07:59,089 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:07:59,089 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:07:59,089 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 15:07:59,089 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:07:59,089 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 15:07:59,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-18 15:07:59,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 15:07:59,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:07:59,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:07:59,127 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 15:07:59,127 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 15:07:59,128 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 15:07:59,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-18 15:07:59,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 15:07:59,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:07:59,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:07:59,129 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 15:07:59,130 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 15:07:59,135 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 13#L382true assume !(main_~length1~0 < 1); 17#L382-2true assume !(main_~length2~0 < 1); 10#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 6#L369-4true [2018-11-18 15:07:59,135 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true assume true;call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 19#L369-1true assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 4#L372-6true assume !true; 7#L372-7true call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 9#L374true assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 5#L369-3true cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 6#L369-4true [2018-11-18 15:07:59,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:07:59,140 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-18 15:07:59,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:07:59,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:07:59,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:07:59,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:07:59,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:07:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:07:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:07:59,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:07:59,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1454947914, now seen corresponding path program 1 times [2018-11-18 15:07:59,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:07:59,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:07:59,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:07:59,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:07:59,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:07:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:07:59,264 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-18 15:07:59,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:07:59,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 15:07:59,269 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:07:59,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 15:07:59,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 15:07:59,281 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-18 15:07:59,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:07:59,285 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2018-11-18 15:07:59,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 15:07:59,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2018-11-18 15:07:59,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 15:07:59,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 14 states and 18 transitions. [2018-11-18 15:07:59,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 15:07:59,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 15:07:59,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2018-11-18 15:07:59,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:07:59,292 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-18 15:07:59,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2018-11-18 15:07:59,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-18 15:07:59,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 15:07:59,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-11-18 15:07:59,313 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-18 15:07:59,313 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-18 15:07:59,313 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 15:07:59,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2018-11-18 15:07:59,314 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 15:07:59,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:07:59,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:07:59,314 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 15:07:59,314 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:07:59,315 INFO L794 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 54#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 55#L382 assume !(main_~length1~0 < 1); 56#L382-2 assume !(main_~length2~0 < 1); 53#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 49#L369-4 [2018-11-18 15:07:59,315 INFO L796 eck$LassoCheckResult]: Loop: 49#L369-4 assume true;call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 50#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 46#L372-6 assume true; 47#L372-1 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 57#L372-2 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 59#L372-4 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210; 51#L372-7 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 52#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 48#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 49#L369-4 [2018-11-18 15:07:59,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:07:59,315 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-18 15:07:59,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:07:59,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:07:59,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:07:59,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:07:59,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:07:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:07:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:07:59,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:07:59,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1329778143, now seen corresponding path program 1 times [2018-11-18 15:07:59,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:07:59,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:07:59,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:07:59,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:07:59,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:07:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:07:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:07:59,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:07:59,366 INFO L82 PathProgramCache]: Analyzing trace with hash 152793724, now seen corresponding path program 1 times [2018-11-18 15:07:59,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:07:59,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:07:59,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:07:59,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:07:59,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:07:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:07:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:07:59,575 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-11-18 15:07:59,725 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-18 15:07:59,910 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2018-11-18 15:07:59,992 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:07:59,993 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:07:59,993 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:07:59,994 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:07:59,994 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:07:59,994 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:07:59,994 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:07:59,994 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:07:59,994 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_mixed_alloca_true-termination.c.i_Iteration2_Lasso [2018-11-18 15:07:59,994 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:07:59,995 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:08:00,015 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-18 15:08:00,019 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-18 15:08:00,020 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-18 15:08:00,022 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-18 15:08:00,024 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-18 15:08:00,025 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-18 15:08:00,027 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-18 15:08:00,029 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-18 15:08:00,030 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-18 15:08:00,032 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-18 15:08:00,034 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-18 15:08:00,046 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-18 15:08:00,048 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-18 15:08:00,050 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-18 15:08:00,052 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-18 15:08:00,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:00,054 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-18 15:08:00,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-18 15:08:00,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-18 15:08:00,315 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-18 15:08:00,693 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:08:00,697 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:08:00,699 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-18 15:08:00,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:00,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:00,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:00,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:00,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:00,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:00,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:00,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:00,705 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-18 15:08:00,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:00,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:00,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:00,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:00,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:00,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:00,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:00,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:00,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:08:00,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:00,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:00,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:00,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:00,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:00,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:00,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:00,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:00,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:08:00,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:00,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:00,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:00,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:00,713 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:08:00,714 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:08:00,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:00,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:08:00,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:00,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:00,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:00,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:00,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:00,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:00,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:00,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:00,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:08:00,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:00,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:00,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:00,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:00,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:00,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:00,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:00,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:00,724 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-18 15:08:00,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:00,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:00,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:00,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:00,726 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:08:00,726 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:08:00,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:00,733 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-18 15:08:00,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:00,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:00,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:00,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:00,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:00,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:00,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:00,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:00,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:08:00,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:00,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:00,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:00,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:00,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:00,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:00,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:00,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:00,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:08:00,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:00,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:00,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:00,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:00,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:00,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:00,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:00,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:00,744 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-18 15:08:00,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:00,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:00,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:00,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:00,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:00,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:00,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:00,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:00,750 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-18 15:08:00,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:00,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:00,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:00,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:00,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:00,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:00,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:00,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:00,753 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-18 15:08:00,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:00,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:00,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:00,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:00,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:00,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:00,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:00,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:00,755 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-18 15:08:00,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:00,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:00,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:00,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:00,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:00,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:00,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:00,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:00,758 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-18 15:08:00,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:00,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:00,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:00,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:00,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:00,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:00,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:00,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:00,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:08:00,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:00,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:00,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:00,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:00,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:00,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:00,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:00,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:00,766 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-18 15:08:00,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:00,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:00,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:00,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:00,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:00,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:00,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:00,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:00,768 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-18 15:08:00,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:00,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:00,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:00,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:00,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:00,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:00,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:00,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:00,770 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-18 15:08:00,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:00,770 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 15:08:00,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:00,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:00,773 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:08:00,773 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:08:00,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:00,786 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-18 15:08:00,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:00,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:00,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:00,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:00,788 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:08:00,788 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:08:00,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:00,790 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-18 15:08:00,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:00,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:00,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:00,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:00,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:00,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:00,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:00,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:00,793 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-18 15:08:00,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:00,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:00,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:00,794 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:08:00,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:00,797 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:08:00,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:00,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:00,804 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-18 15:08:00,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:00,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:00,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:00,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:00,809 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:08:00,809 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:08:00,844 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 15:08:00,869 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 15:08:00,869 INFO L444 ModelExtractionUtils]: 44 out of 52 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-18 15:08:00,875 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 15:08:00,876 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 15:08:00,876 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 15:08:00,877 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~sc1~0.offset, v_rep(select #length ULTIMATE.start_cstrpbrk_~sc1~0.base)_1) = -1*ULTIMATE.start_cstrpbrk_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~sc1~0.base)_1 Supporting invariants [] [2018-11-18 15:08:00,938 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2018-11-18 15:08:00,942 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 15:08:00,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:08:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:08:00,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:08:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:08:00,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:08:00,987 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-18 15:08:00,989 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-18 15:08:00,989 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-18 15:08:01,019 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 4 states. [2018-11-18 15:08:01,019 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-18 15:08:01,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 15:08:01,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-18 15:08:01,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 5 letters. Loop has 9 letters. [2018-11-18 15:08:01,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:08:01,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 14 letters. Loop has 9 letters. [2018-11-18 15:08:01,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:08:01,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 5 letters. Loop has 18 letters. [2018-11-18 15:08:01,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:08:01,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2018-11-18 15:08:01,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:08:01,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 20 states and 27 transitions. [2018-11-18 15:08:01,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-18 15:08:01,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 15:08:01,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2018-11-18 15:08:01,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:08:01,024 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-18 15:08:01,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2018-11-18 15:08:01,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-18 15:08:01,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 15:08:01,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-11-18 15:08:01,026 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-18 15:08:01,026 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-18 15:08:01,026 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 15:08:01,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2018-11-18 15:08:01,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:08:01,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:08:01,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:08:01,027 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:08:01,027 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 15:08:01,027 INFO L794 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 189#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 190#L382 assume !(main_~length1~0 < 1); 191#L382-2 assume !(main_~length2~0 < 1); 188#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 185#L369-4 assume true;call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 187#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 177#L372-6 [2018-11-18 15:08:01,028 INFO L796 eck$LassoCheckResult]: Loop: 177#L372-6 assume true; 178#L372-1 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 192#L372-2 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 195#L372-4 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 177#L372-6 [2018-11-18 15:08:01,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:08:01,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-11-18 15:08:01,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:08:01,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:08:01,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:08:01,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:08:01,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:08:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:08:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:08:01,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:08:01,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1787563, now seen corresponding path program 1 times [2018-11-18 15:08:01,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:08:01,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:08:01,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:08:01,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:08:01,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:08:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:08:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:08:01,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:08:01,057 INFO L82 PathProgramCache]: Analyzing trace with hash 2145109973, now seen corresponding path program 1 times [2018-11-18 15:08:01,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:08:01,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:08:01,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:08:01,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:08:01,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:08:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:08:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:08:01,362 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 96 [2018-11-18 15:08:01,433 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:08:01,433 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:08:01,433 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:08:01,433 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:08:01,433 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:08:01,433 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:08:01,433 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:08:01,433 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:08:01,433 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_mixed_alloca_true-termination.c.i_Iteration3_Lasso [2018-11-18 15:08:01,434 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:08:01,434 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:08:01,438 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-18 15:08:01,439 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-18 15:08:01,440 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-18 15:08:01,441 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-18 15:08:01,443 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-18 15:08:01,455 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-18 15:08:01,456 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-18 15:08:01,456 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-18 15:08:01,458 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-18 15:08:01,459 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-18 15:08:01,460 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-18 15:08:01,461 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-18 15:08:01,461 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-18 15:08:01,463 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-18 15:08:01,463 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-18 15:08:01,464 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-18 15:08:01,465 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-18 15:08:01,470 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-18 15:08:01,642 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2018-11-18 15:08:01,699 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-18 15:08:01,700 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-18 15:08:01,701 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-18 15:08:02,066 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:08:02,067 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:08:02,067 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-18 15:08:02,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:02,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:02,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:02,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:02,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:02,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:02,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:02,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:02,069 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-18 15:08:02,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:02,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:02,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:02,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:02,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:02,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:02,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:02,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:02,071 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-18 15:08:02,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:02,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:02,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:02,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:02,072 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:08:02,072 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:08:02,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:02,074 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-18 15:08:02,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:02,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:02,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:02,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:02,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:02,074 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:02,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:02,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:02,075 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-18 15:08:02,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:02,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:02,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:02,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:02,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:02,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:02,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:02,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:02,077 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-18 15:08:02,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:02,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:02,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:02,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:02,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:02,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:02,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:02,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:02,080 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-18 15:08:02,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:02,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:02,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:02,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:02,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:02,080 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:02,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:02,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:02,081 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-18 15:08:02,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:02,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:02,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:02,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:02,082 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:08:02,082 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:08:02,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:02,083 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-18 15:08:02,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:02,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:02,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:02,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:02,085 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:08:02,085 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:08:02,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:02,086 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-18 15:08:02,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:02,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:02,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:02,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:02,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:02,087 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:02,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:02,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:02,088 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-18 15:08:02,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:02,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:02,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:02,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:02,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:02,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:02,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:02,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:02,090 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-18 15:08:02,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:02,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:02,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:02,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:02,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:02,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:02,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:02,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:02,091 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-18 15:08:02,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:02,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:02,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:02,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:02,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:02,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:02,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:02,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:02,093 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-18 15:08:02,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:02,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:02,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:02,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:02,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:02,094 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:02,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:02,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:02,095 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-18 15:08:02,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:02,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:02,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:02,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:02,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:02,096 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:02,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:02,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:02,097 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-18 15:08:02,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:02,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:02,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:02,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:02,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:02,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:02,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:02,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:02,098 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-18 15:08:02,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:02,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:02,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:02,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:02,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:02,099 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:02,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:02,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:02,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-18 15:08:02,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:02,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:02,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:02,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:02,101 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:08:02,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:08:02,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:02,103 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-18 15:08:02,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:02,103 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 15:08:02,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:02,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:02,105 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:08:02,105 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:08:02,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:02,111 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-18 15:08:02,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:02,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:02,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:02,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:02,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:08:02,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:08:02,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:02,114 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-18 15:08:02,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:02,115 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 15:08:02,115 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-18 15:08:02,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:02,138 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2018-11-18 15:08:02,138 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-18 15:08:02,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:02,217 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-18 15:08:02,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:02,217 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 15:08:02,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:02,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:02,218 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:08:02,218 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:08:02,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:02,223 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-18 15:08:02,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:02,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:02,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:02,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:02,224 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:08:02,224 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:08:02,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:02,227 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-18 15:08:02,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:02,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:02,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:02,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:02,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:08:02,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:08:02,242 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 15:08:02,253 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 15:08:02,253 INFO L444 ModelExtractionUtils]: 34 out of 40 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 15:08:02,253 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 15:08:02,254 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 15:08:02,254 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 15:08:02,254 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2) = 2*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2 Supporting invariants [] [2018-11-18 15:08:02,297 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-18 15:08:02,299 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 15:08:02,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:08:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:08:02,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:08:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:08:02,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:08:02,366 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-18 15:08:02,366 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 15:08:02,366 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-18 15:08:02,409 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 49 states and 63 transitions. Complement of second has 8 states. [2018-11-18 15:08:02,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 15:08:02,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 15:08:02,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-18 15:08:02,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-18 15:08:02,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:08:02,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-18 15:08:02,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:08:02,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 7 letters. Loop has 8 letters. [2018-11-18 15:08:02,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:08:02,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 63 transitions. [2018-11-18 15:08:02,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:08:02,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 34 states and 44 transitions. [2018-11-18 15:08:02,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 15:08:02,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 15:08:02,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2018-11-18 15:08:02,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:08:02,416 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2018-11-18 15:08:02,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2018-11-18 15:08:02,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-11-18 15:08:02,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 15:08:02,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-11-18 15:08:02,419 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-18 15:08:02,419 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-18 15:08:02,419 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 15:08:02,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2018-11-18 15:08:02,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:08:02,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:08:02,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:08:02,420 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:08:02,420 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 15:08:02,420 INFO L794 eck$LassoCheckResult]: Stem: 389#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 384#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 385#L382 assume !(main_~length1~0 < 1); 386#L382-2 assume !(main_~length2~0 < 1); 383#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 379#L369-4 assume true;call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 380#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 393#L372-6 assume true; 397#L372-1 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 395#L372-2 assume !cstrpbrk_#t~short210; 394#L372-4 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210; 377#L372-7 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 378#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 375#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 376#L369-4 assume true;call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 382#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 371#L372-6 [2018-11-18 15:08:02,421 INFO L796 eck$LassoCheckResult]: Loop: 371#L372-6 assume true; 372#L372-1 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 387#L372-2 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 390#L372-4 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 371#L372-6 [2018-11-18 15:08:02,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:08:02,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1714078621, now seen corresponding path program 1 times [2018-11-18 15:08:02,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:08:02,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:08:02,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:08:02,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:08:02,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:08:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:08:02,481 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-18 15:08:02,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:08:02,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 15:08:02,482 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:08:02,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:08:02,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1787563, now seen corresponding path program 2 times [2018-11-18 15:08:02,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:08:02,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:08:02,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:08:02,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:08:02,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:08:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:08:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:08:02,662 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-11-18 15:08:02,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 15:08:02,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:08:02,663 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-18 15:08:02,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:08:02,750 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2018-11-18 15:08:02,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:08:02,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. [2018-11-18 15:08:02,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 15:08:02,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 39 transitions. [2018-11-18 15:08:02,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 15:08:02,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 15:08:02,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 39 transitions. [2018-11-18 15:08:02,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:08:02,755 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-18 15:08:02,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 39 transitions. [2018-11-18 15:08:02,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-18 15:08:02,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 15:08:02,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-11-18 15:08:02,757 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-11-18 15:08:02,757 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-11-18 15:08:02,757 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 15:08:02,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 37 transitions. [2018-11-18 15:08:02,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:08:02,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:08:02,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:08:02,762 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:08:02,762 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 15:08:02,763 INFO L794 eck$LassoCheckResult]: Stem: 467#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 464#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 465#L382 assume !(main_~length1~0 < 1); 466#L382-2 assume !(main_~length2~0 < 1); 463#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 457#L369-4 assume true;call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 458#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 477#L372-6 assume true; 469#L372-1 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 470#L372-2 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 475#L372-4 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210; 461#L372-7 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 462#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 455#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 456#L369-4 assume true;call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 460#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 451#L372-6 [2018-11-18 15:08:02,763 INFO L796 eck$LassoCheckResult]: Loop: 451#L372-6 assume true; 452#L372-1 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 468#L372-2 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 471#L372-4 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 451#L372-6 [2018-11-18 15:08:02,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:08:02,763 INFO L82 PathProgramCache]: Analyzing trace with hash 805881313, now seen corresponding path program 2 times [2018-11-18 15:08:02,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:08:02,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:08:02,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:08:02,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:08:02,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:08:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:08:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:08:02,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:08:02,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1787563, now seen corresponding path program 3 times [2018-11-18 15:08:02,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:08:02,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:08:02,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:08:02,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:08:02,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:08:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:08:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:08:02,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:08:02,789 INFO L82 PathProgramCache]: Analyzing trace with hash -795992949, now seen corresponding path program 1 times [2018-11-18 15:08:02,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:08:02,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:08:02,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:08:02,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:08:02,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:08:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:08:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:08:03,289 WARN L180 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 130 [2018-11-18 15:08:03,834 WARN L180 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 107 [2018-11-18 15:08:03,835 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:08:03,836 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:08:03,836 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:08:03,836 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:08:03,836 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:08:03,836 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:08:03,836 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:08:03,836 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:08:03,836 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_mixed_alloca_true-termination.c.i_Iteration5_Lasso [2018-11-18 15:08:03,836 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:08:03,836 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:08:03,841 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-18 15:08:03,847 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-18 15:08:03,849 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-18 15:08:03,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-18 15:08:03,853 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-18 15:08:03,854 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-18 15:08:03,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-18 15:08:03,856 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-18 15:08:03,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-18 15:08:03,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-18 15:08:03,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-18 15:08:03,861 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-18 15:08:03,862 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-18 15:08:03,863 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-18 15:08:03,864 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-18 15:08:03,865 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-18 15:08:03,866 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-18 15:08:03,993 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 15:08:04,378 WARN L180 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 94 [2018-11-18 15:08:04,453 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-18 15:08:04,454 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-18 15:08:04,455 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-18 15:08:04,824 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2018-11-18 15:08:05,046 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:08:05,046 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:08:05,046 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-18 15:08:05,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:05,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:05,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:05,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:05,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:05,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:05,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:05,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:05,048 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-18 15:08:05,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:05,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:05,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:05,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:05,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:05,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:05,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:05,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:05,049 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-18 15:08:05,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:05,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:05,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:05,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:05,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:05,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:05,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:05,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:05,050 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-18 15:08:05,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:05,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:05,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:05,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:05,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:05,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:05,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:05,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:05,052 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-18 15:08:05,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:05,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:05,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:05,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:05,053 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:08:05,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:08:05,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:05,054 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-18 15:08:05,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:05,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:05,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:05,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:05,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:05,055 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:05,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:05,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:05,056 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-18 15:08:05,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:05,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:05,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:05,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:05,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:05,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:05,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:05,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:05,058 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-18 15:08:05,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:05,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:05,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:05,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:05,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:05,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:05,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:05,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:05,060 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-18 15:08:05,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:05,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:05,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:05,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:05,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:05,061 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:05,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:05,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:05,061 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-18 15:08:05,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:05,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:05,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:05,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:05,066 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:08:05,066 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:08:05,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:05,068 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-18 15:08:05,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:05,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:05,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:05,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:05,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:05,069 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:05,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:05,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:05,070 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-18 15:08:05,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:05,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:05,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:05,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:05,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:05,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:05,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:05,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:05,072 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-18 15:08:05,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:05,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:05,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:05,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:05,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:05,073 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:05,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:05,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:05,073 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-18 15:08:05,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:05,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:05,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:05,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:05,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:05,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:05,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:05,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:05,075 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-18 15:08:05,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:05,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:05,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:05,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:05,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:05,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:05,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:05,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:05,077 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-18 15:08:05,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:05,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:05,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:05,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:05,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:05,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:05,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:05,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:05,079 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-18 15:08:05,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:05,080 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-11-18 15:08:05,080 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-18 15:08:05,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:05,102 INFO L402 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2018-11-18 15:08:05,102 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-18 15:08:05,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:05,206 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-18 15:08:05,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:05,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:05,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:05,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:05,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:08:05,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:08:05,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:05,209 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-18 15:08:05,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:05,209 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 15:08:05,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:05,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:05,214 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:08:05,214 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:08:05,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:05,219 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-18 15:08:05,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:05,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:05,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:05,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:05,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:08:05,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:08:05,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:05,224 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-18 15:08:05,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:05,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:05,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:05,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:05,225 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:08:05,225 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:08:05,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:05,226 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-18 15:08:05,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:05,226 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 15:08:05,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:05,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:05,227 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:08:05,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:08:05,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:05,232 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-18 15:08:05,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:05,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:05,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:05,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:05,233 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:08:05,233 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:08:05,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:05,234 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-18 15:08:05,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:05,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:05,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:05,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:05,235 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:08:05,235 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:08:05,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:05,236 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-18 15:08:05,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:05,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:05,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:05,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:05,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:08:05,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:08:05,252 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 15:08:05,262 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 15:08:05,262 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 15:08:05,263 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 15:08:05,263 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 15:08:05,263 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 15:08:05,263 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3 + 2*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2018-11-18 15:08:05,381 INFO L297 tatePredicateManager]: 27 out of 29 supporting invariants were superfluous and have been removed [2018-11-18 15:08:05,384 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 15:08:05,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:08:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:08:05,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:08:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:08:05,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:08:05,462 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-18 15:08:05,462 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 15:08:05,462 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 37 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-18 15:08:05,502 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 37 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 47 states and 57 transitions. Complement of second has 8 states. [2018-11-18 15:08:05,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 15:08:05,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 15:08:05,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-18 15:08:05,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-18 15:08:05,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:08:05,504 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 15:08:05,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:08:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:08:05,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:08:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:08:05,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:08:05,574 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-18 15:08:05,574 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 15:08:05,574 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 37 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-18 15:08:05,609 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 37 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 47 states and 57 transitions. Complement of second has 8 states. [2018-11-18 15:08:05,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 15:08:05,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 15:08:05,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-18 15:08:05,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-18 15:08:05,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:08:05,611 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 15:08:05,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:08:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:08:05,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:08:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:08:05,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:08:05,682 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-18 15:08:05,683 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 15:08:05,683 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 37 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-18 15:08:05,734 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 37 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 49 states and 61 transitions. Complement of second has 7 states. [2018-11-18 15:08:05,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 15:08:05,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 15:08:05,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2018-11-18 15:08:05,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-18 15:08:05,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:08:05,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 20 letters. Loop has 4 letters. [2018-11-18 15:08:05,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:08:05,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 16 letters. Loop has 8 letters. [2018-11-18 15:08:05,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:08:05,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 61 transitions. [2018-11-18 15:08:05,740 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 15:08:05,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 0 states and 0 transitions. [2018-11-18 15:08:05,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 15:08:05,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 15:08:05,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 15:08:05,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:08:05,741 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:08:05,741 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:08:05,741 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:08:05,741 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 15:08:05,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 15:08:05,741 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 15:08:05,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 15:08:05,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 03:08:05 BoogieIcfgContainer [2018-11-18 15:08:05,749 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 15:08:05,749 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 15:08:05,749 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 15:08:05,749 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 15:08:05,750 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:07:59" (3/4) ... [2018-11-18 15:08:05,752 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 15:08:05,753 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 15:08:05,753 INFO L168 Benchmark]: Toolchain (without parser) took 7367.89 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 249.6 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -149.7 MB). Peak memory consumption was 99.8 MB. Max. memory is 11.5 GB. [2018-11-18 15:08:05,754 INFO L168 Benchmark]: CDTParser took 0.14 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-18 15:08:05,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. [2018-11-18 15:08:05,755 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:08:05,755 INFO L168 Benchmark]: Boogie Preprocessor took 15.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:08:05,755 INFO L168 Benchmark]: RCFGBuilder took 253.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-18 15:08:05,756 INFO L168 Benchmark]: BuchiAutomizer took 6716.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 116.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -14.2 MB). Peak memory consumption was 102.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:08:05,756 INFO L168 Benchmark]: Witness Printer took 3.58 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-18 15:08:05,759 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.14 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 345.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 253.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6716.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 116.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -14.2 MB). Peak memory consumption was 102.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.58 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[sc1] and consists of 3 locations. One deterministic module has affine ranking function 2 * s + unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] + 2 * s and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.6s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 113 SDtfs, 153 SDslu, 83 SDs, 0 SdLazy, 101 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital368 mio100 ax100 hnf99 lsp91 ukn71 mio100 lsp36 div119 bol100 ite100 ukn100 eq174 hnf82 smp92 dnf624 smp28 tf100 neg96 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 126ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 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...