./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrpbrk_malloc.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_dd5e0209-5032-4b92-b6e4-b622e9f08c7e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_dd5e0209-5032-4b92-b6e4-b622e9f08c7e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_dd5e0209-5032-4b92-b6e4-b622e9f08c7e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_dd5e0209-5032-4b92-b6e4-b622e9f08c7e/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrpbrk_malloc.i -s /tmp/vcloud-vcloud-master/worker/working_dir_dd5e0209-5032-4b92-b6e4-b622e9f08c7e/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_dd5e0209-5032-4b92-b6e4-b622e9f08c7e/bin/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 490e2fc9530e2aed3bf6518ae9d012c90796da95 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:58:52,691 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:58:52,693 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:58:52,703 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:58:52,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:58:52,705 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:58:52,707 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:58:52,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:58:52,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:58:52,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:58:52,716 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:58:52,717 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:58:52,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:58:52,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:58:52,719 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:58:52,720 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:58:52,720 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:58:52,721 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:58:52,722 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:58:52,730 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:58:52,731 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:58:52,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:58:52,733 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:58:52,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:58:52,735 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:58:52,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:58:52,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:58:52,737 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:58:52,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:58:52,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:58:52,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:58:52,739 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:58:52,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:58:52,739 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:58:52,740 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:58:52,740 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:58:52,741 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:58:52,741 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:58:52,741 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:58:52,742 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:58:52,742 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:58:52,743 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_dd5e0209-5032-4b92-b6e4-b622e9f08c7e/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:58:52,759 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:58:52,769 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:58:52,770 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:58:52,770 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:58:52,771 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:58:52,771 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:58:52,771 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:58:52,771 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:58:52,771 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:58:52,771 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:58:52,772 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:58:52,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:58:52,772 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:58:52,772 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:58:52,772 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:58:52,772 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:58:52,773 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:58:52,773 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:58:52,773 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:58:52,773 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:58:52,773 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:58:52,773 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:58:52,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:58:52,774 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:58:52,774 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:58:52,775 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:58:52,775 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:58:52,776 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:58:52,776 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:58:52,777 INFO L138 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_dd5e0209-5032-4b92-b6e4-b622e9f08c7e/bin/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 -> 490e2fc9530e2aed3bf6518ae9d012c90796da95 [2019-10-22 08:58:52,810 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:58:52,822 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:58:52,825 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:58:52,827 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:58:52,827 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:58:52,828 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_dd5e0209-5032-4b92-b6e4-b622e9f08c7e/bin/uautomizer/../../sv-benchmarks/c/termination-15/cstrpbrk_malloc.i [2019-10-22 08:58:52,887 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dd5e0209-5032-4b92-b6e4-b622e9f08c7e/bin/uautomizer/data/164a2153b/066c078402b44367a916a0d9d9165cd6/FLAG427d95196 [2019-10-22 08:58:53,324 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:58:53,324 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_dd5e0209-5032-4b92-b6e4-b622e9f08c7e/sv-benchmarks/c/termination-15/cstrpbrk_malloc.i [2019-10-22 08:58:53,332 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dd5e0209-5032-4b92-b6e4-b622e9f08c7e/bin/uautomizer/data/164a2153b/066c078402b44367a916a0d9d9165cd6/FLAG427d95196 [2019-10-22 08:58:53,342 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_dd5e0209-5032-4b92-b6e4-b622e9f08c7e/bin/uautomizer/data/164a2153b/066c078402b44367a916a0d9d9165cd6 [2019-10-22 08:58:53,344 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:58:53,345 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:58:53,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:53,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:58:53,350 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:58:53,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:53" (1/1) ... [2019-10-22 08:58:53,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56389653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:53, skipping insertion in model container [2019-10-22 08:58:53,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:53" (1/1) ... [2019-10-22 08:58:53,360 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:58:53,387 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:58:53,736 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:53,753 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:58:53,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:53,863 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:58:53,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:53 WrapperNode [2019-10-22 08:58:53,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:53,864 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:53,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:58:53,864 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:58:53,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:53" (1/1) ... [2019-10-22 08:58:53,886 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:53" (1/1) ... [2019-10-22 08:58:53,909 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:53,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:58:53,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:58:53,909 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:58:53,920 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:53" (1/1) ... [2019-10-22 08:58:53,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:53" (1/1) ... [2019-10-22 08:58:53,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:53" (1/1) ... [2019-10-22 08:58:53,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:53" (1/1) ... [2019-10-22 08:58:53,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:53" (1/1) ... [2019-10-22 08:58:53,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:53" (1/1) ... [2019-10-22 08:58:53,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:53" (1/1) ... [2019-10-22 08:58:53,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:58:53,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:58:53,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:58:53,942 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:58:53,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd5e0209-5032-4b92-b6e4-b622e9f08c7e/bin/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 [2019-10-22 08:58:54,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:58:54,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:58:54,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:58:54,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:58:54,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:58:54,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:58:54,336 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:58:54,336 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:58:54,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:54 BoogieIcfgContainer [2019-10-22 08:58:54,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:58:54,338 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:58:54,338 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:58:54,342 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:58:54,342 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:54,343 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:58:53" (1/3) ... [2019-10-22 08:58:54,344 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79ae481d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:54, skipping insertion in model container [2019-10-22 08:58:54,344 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:54,344 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:53" (2/3) ... [2019-10-22 08:58:54,344 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79ae481d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:54, skipping insertion in model container [2019-10-22 08:58:54,344 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:54,344 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:54" (3/3) ... [2019-10-22 08:58:54,346 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrpbrk_malloc.i [2019-10-22 08:58:54,389 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:58:54,389 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:58:54,389 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:58:54,389 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:58:54,390 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:58:54,390 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:58:54,390 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:58:54,390 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:58:54,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 08:58:54,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:58:54,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:54,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:54,436 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:58:54,436 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:58:54,436 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:58:54,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 08:58:54,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:58:54,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:54,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:54,439 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:58:54,439 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:58:54,447 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 10#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(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.allocOnHeap(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 + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 6#L369-4true [2019-10-22 08:58:54,447 INFO L793 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 18#L369-1true assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 8#L374true assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 5#L369-3true cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 6#L369-4true [2019-10-22 08:58:54,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:54,455 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-10-22 08:58:54,463 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:54,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583349167] [2019-10-22 08:58:54,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:54,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:54,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:54,644 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:54,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:54,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-10-22 08:58:54,646 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:54,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149835119] [2019-10-22 08:58:54,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:54,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:54,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:54,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:54,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149835119] [2019-10-22 08:58:54,685 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:54,685 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:58:54,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340932019] [2019-10-22 08:58:54,692 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:58:54,693 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:54,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 08:58:54,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:58:54,707 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-10-22 08:58:54,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:54,713 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-10-22 08:58:54,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:58:54,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-10-22 08:58:54,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:58:54,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-10-22 08:58:54,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 08:58:54,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 08:58:54,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-10-22 08:58:54,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:54,722 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-10-22 08:58:54,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-10-22 08:58:54,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-10-22 08:58:54,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 08:58:54,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-10-22 08:58:54,752 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-10-22 08:58:54,752 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-10-22 08:58:54,752 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:58:54,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-10-22 08:58:54,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:58:54,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:54,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:54,753 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:58:54,753 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:54,754 INFO L791 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(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.allocOnHeap(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 + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 47#L369-4 [2019-10-22 08:58:54,754 INFO L793 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 48#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 56#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 53#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 54#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209; 44#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 45#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 46#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 47#L369-4 [2019-10-22 08:58:54,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:54,755 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-10-22 08:58:54,755 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:54,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075518569] [2019-10-22 08:58:54,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:54,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:54,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:54,794 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:54,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:54,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-10-22 08:58:54,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:54,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864405439] [2019-10-22 08:58:54,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:54,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:54,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:54,828 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:54,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:54,829 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-10-22 08:58:54,829 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:54,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362181210] [2019-10-22 08:58:54,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:54,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:54,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:54,918 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:55,254 WARN L191 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-10-22 08:58:55,560 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-10-22 08:58:55,845 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-10-22 08:58:55,963 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-10-22 08:58:55,979 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:55,979 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:55,981 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:55,981 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:55,981 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:55,981 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:55,981 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:55,982 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:55,982 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_malloc.i_Iteration2_Lasso [2019-10-22 08:58:55,982 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:55,982 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:56,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,397 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-10-22 08:58:56,565 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-10-22 08:58:56,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:57,018 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2019-10-22 08:58:57,339 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-10-22 08:58:57,374 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:57,380 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:57,382 INFO L120 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 [2019-10-22 08:58:57,383 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:57,384 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:57,384 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:57,384 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:57,384 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:57,386 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:57,386 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:57,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:57,390 INFO L120 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 [2019-10-22 08:58:57,391 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:57,391 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:57,391 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:57,391 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:57,392 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:57,392 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:57,392 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:57,393 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:57,394 INFO L120 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 [2019-10-22 08:58:57,394 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:57,394 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:57,394 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:57,395 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:57,395 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:57,395 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:57,395 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:57,396 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:57,396 INFO L120 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 [2019-10-22 08:58:57,397 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:57,397 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:57,397 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:57,397 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:57,400 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:57,400 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:57,404 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:57,404 INFO L120 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 [2019-10-22 08:58:57,405 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:57,405 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:57,405 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:57,405 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:57,406 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:57,406 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:57,406 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:57,407 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:57,407 INFO L120 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 [2019-10-22 08:58:57,408 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:57,408 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:57,408 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:57,408 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:57,409 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:57,409 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:57,409 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:57,410 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:57,411 INFO L120 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 [2019-10-22 08:58:57,412 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:57,412 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:57,412 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:57,412 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:57,414 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:57,414 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:57,417 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:57,418 INFO L120 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 [2019-10-22 08:58:57,419 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:57,419 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:57,419 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:57,419 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:57,419 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:57,420 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:57,420 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:57,421 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:57,421 INFO L120 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 [2019-10-22 08:58:57,422 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:57,422 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:57,423 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:57,423 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:57,423 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:57,423 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:57,423 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:57,424 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:57,425 INFO L120 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 [2019-10-22 08:58:57,425 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:57,425 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:57,426 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:57,426 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:57,428 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:57,428 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:57,431 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:57,431 INFO L120 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 [2019-10-22 08:58:57,432 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:57,432 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:57,432 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:57,432 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:57,433 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:57,433 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:57,433 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:57,436 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:57,437 INFO L120 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 [2019-10-22 08:58:57,437 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:57,438 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:57,438 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:57,438 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:58:57,438 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:57,444 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:58:57,444 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:57,469 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:57,474 INFO L120 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 [2019-10-22 08:58:57,474 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:57,475 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:57,475 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:57,475 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:57,484 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:57,486 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:57,528 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:57,565 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:58:57,565 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:58:57,570 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:57,572 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:58:57,574 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:57,575 INFO L512 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 [] [2019-10-22 08:58:57,614 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-10-22 08:58:57,623 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:58:57,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:57,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:57,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:57,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:58:57,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:57,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:57,712 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 [2019-10-22 08:58:57,713 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-10-22 08:58:57,759 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2019-10-22 08:58:57,760 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 [2019-10-22 08:58:57,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:58:57,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-10-22 08:58:57,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-10-22 08:58:57,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:57,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-10-22 08:58:57,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:57,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-10-22 08:58:57,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:57,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-10-22 08:58:57,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:57,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-10-22 08:58:57,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 08:58:57,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:58:57,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-10-22 08:58:57,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:57,768 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 08:58:57,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-10-22 08:58:57,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-22 08:58:57,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-22 08:58:57,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-10-22 08:58:57,770 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 08:58:57,770 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 08:58:57,770 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:58:57,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-10-22 08:58:57,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:57,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:57,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:57,772 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:57,772 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:57,772 INFO L791 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 181#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 182#L382 assume !(main_~length1~0 < 1); 183#L382-2 assume !(main_~length2~0 < 1); 180#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(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.allocOnHeap(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 + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 177#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 179#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 189#L372-5 [2019-10-22 08:58:57,772 INFO L793 eck$LassoCheckResult]: Loop: 189#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 184#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 185#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, 1 + cstrpbrk_#t~post211.offset;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 189#L372-5 [2019-10-22 08:58:57,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:57,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-10-22 08:58:57,773 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:57,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990689645] [2019-10-22 08:58:57,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:57,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:57,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:57,804 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:57,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:57,807 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-10-22 08:58:57,807 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:57,807 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617754136] [2019-10-22 08:58:57,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:57,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:57,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:57,826 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:57,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:57,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-10-22 08:58:57,831 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:57,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345035548] [2019-10-22 08:58:57,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:57,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:57,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:57,886 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:58,365 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 103 [2019-10-22 08:58:58,461 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:58,461 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:58,462 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:58,462 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:58,462 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:58,462 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:58,462 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:58,462 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:58,462 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_malloc.i_Iteration3_Lasso [2019-10-22 08:58:58,462 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:58,462 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:58,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:58,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:58,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:58,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:58,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:58,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:58,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:58,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:58,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:58,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:58,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:58,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:58,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:58,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:58,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:58,748 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2019-10-22 08:58:58,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:58,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:58,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:58,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:58,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:59,510 WARN L191 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 08:58:59,654 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-10-22 08:58:59,683 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:59,683 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:59,684 INFO L120 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 [2019-10-22 08:58:59,684 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:59,685 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:59,685 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:59,685 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:59,685 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:59,685 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:59,686 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:59,687 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:59,687 INFO L120 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 [2019-10-22 08:58:59,687 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:59,688 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:59,688 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:59,688 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:59,688 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:59,688 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:59,688 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:59,689 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:59,689 INFO L120 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 [2019-10-22 08:58:59,690 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:59,690 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:59,690 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:59,690 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:59,691 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:59,692 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:59,693 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:59,694 INFO L120 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 [2019-10-22 08:58:59,695 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:59,695 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:59,695 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:59,695 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:59,695 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:59,695 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:59,695 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:59,696 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:59,696 INFO L120 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 [2019-10-22 08:58:59,697 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:59,697 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:59,697 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:59,697 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:59,697 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:59,698 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:59,698 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:59,698 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:59,699 INFO L120 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 [2019-10-22 08:58:59,699 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:59,700 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:59,700 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:59,700 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:59,700 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:59,700 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:59,700 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:59,701 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:59,701 INFO L120 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 [2019-10-22 08:58:59,702 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:59,702 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:59,702 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:59,702 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:59,703 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:59,703 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:59,703 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:59,704 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:59,704 INFO L120 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 [2019-10-22 08:58:59,705 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:59,705 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:59,705 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:59,705 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:59,706 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:59,706 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:59,708 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:59,709 INFO L120 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 [2019-10-22 08:58:59,709 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:59,709 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:59,709 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:59,710 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:59,710 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:59,710 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:59,710 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:59,711 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:59,711 INFO L120 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 [2019-10-22 08:58:59,712 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:59,712 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:59,712 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:59,712 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:59,712 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:59,713 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:59,713 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:59,713 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:59,714 INFO L120 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 [2019-10-22 08:58:59,714 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:59,715 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:59,715 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:59,715 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:59,715 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:59,715 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:59,716 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:59,716 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:59,717 INFO L120 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 [2019-10-22 08:58:59,717 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:59,717 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:59,718 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:59,718 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:59,718 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:59,718 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:59,718 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:59,719 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:59,720 INFO L120 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 [2019-10-22 08:58:59,720 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:59,720 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:59,720 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:59,720 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:59,721 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:59,721 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:59,721 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:59,722 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:59,722 INFO L120 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 [2019-10-22 08:58:59,723 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:59,723 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:59,723 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:59,723 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:59,724 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:59,724 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:59,724 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:59,724 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:59,725 INFO L120 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 [2019-10-22 08:58:59,725 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:59,725 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:59,726 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:59,726 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:59,727 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:59,727 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:59,729 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:59,729 INFO L120 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 [2019-10-22 08:58:59,730 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:59,730 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:59,731 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:59,731 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:59,735 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:59,735 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:59,775 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:59,806 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:58:59,807 INFO L444 ModelExtractionUtils]: 39 out of 46 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:58:59,807 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:59,808 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:58:59,809 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:59,809 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0.base)_2, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0.base)_2 - 1*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2019-10-22 08:58:59,883 INFO L297 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2019-10-22 08:58:59,884 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:58:59,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:59,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:59,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:59,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:58:59,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:59,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:59,944 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 [2019-10-22 08:58:59,944 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-10-22 08:58:59,977 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 57 transitions. Complement of second has 5 states. [2019-10-22 08:58:59,979 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 [2019-10-22 08:58:59,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:58:59,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-10-22 08:58:59,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-10-22 08:58:59,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:59,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-10-22 08:58:59,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:59,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-10-22 08:58:59,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:59,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-10-22 08:58:59,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:59,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-10-22 08:58:59,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:58:59,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:58:59,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-10-22 08:58:59,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:59,986 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-10-22 08:58:59,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-10-22 08:58:59,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-10-22 08:58:59,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 08:58:59,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-10-22 08:58:59,989 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-10-22 08:58:59,989 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-10-22 08:58:59,989 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:58:59,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-10-22 08:58:59,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:59,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:59,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:59,992 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:59,992 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:59,993 INFO L791 eck$LassoCheckResult]: Stem: 369#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 362#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 363#L382 assume !(main_~length1~0 < 1); 364#L382-2 assume !(main_~length2~0 < 1); 361#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(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.allocOnHeap(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 + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 357#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 358#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 371#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 367#L372-1 assume !cstrpbrk_#t~short210; 368#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209; 353#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 354#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 355#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 356#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 360#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 370#L372-5 [2019-10-22 08:58:59,993 INFO L793 eck$LassoCheckResult]: Loop: 370#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 365#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 366#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, 1 + cstrpbrk_#t~post211.offset;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 370#L372-5 [2019-10-22 08:58:59,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:59,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-10-22 08:58:59,993 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:59,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512918912] [2019-10-22 08:58:59,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:59,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:59,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:00,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:00,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512918912] [2019-10-22 08:59:00,074 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:00,074 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:59:00,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713720560] [2019-10-22 08:59:00,074 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:00,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:00,075 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-10-22 08:59:00,075 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:00,075 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111833013] [2019-10-22 08:59:00,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:00,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:00,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:00,092 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:00,282 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-10-22 08:59:00,282 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:00,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:59:00,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:59:00,283 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-10-22 08:59:00,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:00,387 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-10-22 08:59:00,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:59:00,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-10-22 08:59:00,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:59:00,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2019-10-22 08:59:00,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:59:00,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:59:00,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2019-10-22 08:59:00,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:00,390 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-10-22 08:59:00,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2019-10-22 08:59:00,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-10-22 08:59:00,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-22 08:59:00,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-10-22 08:59:00,392 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-10-22 08:59:00,393 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-10-22 08:59:00,393 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:59:00,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2019-10-22 08:59:00,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:00,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:00,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:00,394 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:00,395 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:00,395 INFO L791 eck$LassoCheckResult]: Stem: 437#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 434#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 435#L382 assume !(main_~length1~0 < 1); 436#L382-2 assume !(main_~length2~0 < 1); 433#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(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.allocOnHeap(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 + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 429#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 430#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 443#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 447#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 446#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209; 425#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 426#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 427#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 428#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 432#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 442#L372-5 [2019-10-22 08:59:00,395 INFO L793 eck$LassoCheckResult]: Loop: 442#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 438#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 439#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, 1 + cstrpbrk_#t~post211.offset;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 442#L372-5 [2019-10-22 08:59:00,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:00,395 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-10-22 08:59:00,396 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:00,396 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269411700] [2019-10-22 08:59:00,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:00,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:00,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:00,426 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:00,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:00,427 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-10-22 08:59:00,427 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:00,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290543672] [2019-10-22 08:59:00,427 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:00,427 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:00,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:00,435 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:00,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:00,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-10-22 08:59:00,436 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:00,436 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108454034] [2019-10-22 08:59:00,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:00,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:00,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:00,479 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:01,137 WARN L191 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 136 [2019-10-22 08:59:01,908 WARN L191 SmtUtils]: Spent 750.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 108 [2019-10-22 08:59:01,910 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:01,910 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:01,910 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:01,910 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:01,910 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:01,910 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:01,910 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:01,910 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:01,911 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_malloc.i_Iteration5_Lasso [2019-10-22 08:59:01,911 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:01,911 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:01,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:01,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:01,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:01,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:01,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:01,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:01,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:01,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:01,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:01,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:01,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:01,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:01,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:01,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:01,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:01,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:02,101 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-10-22 08:59:02,624 WARN L191 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 95 [2019-10-22 08:59:02,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:02,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:02,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:02,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:03,336 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 08:59:03,552 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2019-10-22 08:59:03,659 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-10-22 08:59:03,667 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:03,667 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:03,667 INFO L120 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 [2019-10-22 08:59:03,668 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:03,668 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:03,668 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:03,668 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:03,668 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:03,669 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:03,669 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:03,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:03,670 INFO L120 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 [2019-10-22 08:59:03,670 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:03,671 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:03,671 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:03,671 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:03,671 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:03,671 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:03,671 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:03,672 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:03,672 INFO L120 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 [2019-10-22 08:59:03,673 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:03,673 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:03,673 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:03,673 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:03,673 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:03,673 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:03,673 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:03,674 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:03,674 INFO L120 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 [2019-10-22 08:59:03,675 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:03,675 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:03,675 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:03,675 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:03,675 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:03,676 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:03,676 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:03,676 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:03,677 INFO L120 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 [2019-10-22 08:59:03,677 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:03,677 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:03,677 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:03,678 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:03,678 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:03,678 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:03,678 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:03,678 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:03,679 INFO L120 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 [2019-10-22 08:59:03,679 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:03,679 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:03,679 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:03,679 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:03,680 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:03,680 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:03,681 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:03,682 INFO L120 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 [2019-10-22 08:59:03,683 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:03,683 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:03,683 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:03,683 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:03,683 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:03,684 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:03,684 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:03,684 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:03,685 INFO L120 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 [2019-10-22 08:59:03,685 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:03,685 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:03,685 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:03,686 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:03,686 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:03,686 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:03,686 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:03,687 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:03,687 INFO L120 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 [2019-10-22 08:59:03,688 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:03,688 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:03,688 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:03,688 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:03,688 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:03,688 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:03,688 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:03,689 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:03,689 INFO L120 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 [2019-10-22 08:59:03,690 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:03,690 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:03,690 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:03,690 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:03,691 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:03,691 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:03,693 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:03,693 INFO L120 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 [2019-10-22 08:59:03,694 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:03,694 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:03,694 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:03,694 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:03,694 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:03,695 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:03,695 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:03,695 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:03,696 INFO L120 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 [2019-10-22 08:59:03,696 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:03,696 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:03,696 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:03,696 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:03,697 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:03,697 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:03,697 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:03,697 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:03,698 INFO L120 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 [2019-10-22 08:59:03,698 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:03,699 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:03,699 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:03,699 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:03,699 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:03,699 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:03,700 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:03,700 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:03,700 INFO L120 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 [2019-10-22 08:59:03,701 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:03,701 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:03,701 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:03,701 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:03,701 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:03,702 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:03,702 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:03,702 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:03,703 INFO L120 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 [2019-10-22 08:59:03,703 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:03,703 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:03,704 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:03,704 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:03,704 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:03,704 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:03,704 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:03,705 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:03,705 INFO L120 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 [2019-10-22 08:59:03,705 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:03,705 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:03,706 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:03,706 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:03,707 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:03,707 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:03,708 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:03,709 INFO L120 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 [2019-10-22 08:59:03,709 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:03,709 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:03,709 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:03,710 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:03,711 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:03,711 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:03,713 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:03,713 INFO L120 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 [2019-10-22 08:59:03,713 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:03,714 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:03,714 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:03,714 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:03,715 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:03,715 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:03,716 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:03,717 INFO L120 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 [2019-10-22 08:59:03,717 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:03,717 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:03,717 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:03,717 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:03,719 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:03,719 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:03,724 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:03,724 INFO L120 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 [2019-10-22 08:59:03,724 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:03,725 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:03,725 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:03,725 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:03,725 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:03,725 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:03,727 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:03,727 INFO L120 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 [2019-10-22 08:59:03,728 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:03,728 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:03,728 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:03,728 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:03,731 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:03,731 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:03,751 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:03,774 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:59:03,775 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:59:03,775 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:03,776 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:03,776 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:03,776 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0.base)_3) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0.base)_3 Supporting invariants [] [2019-10-22 08:59:03,901 INFO L297 tatePredicateManager]: 26 out of 26 supporting invariants were superfluous and have been removed [2019-10-22 08:59:03,902 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:59:03,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:03,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:03,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:03,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:03,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:59:03,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:03,950 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 [2019-10-22 08:59:03,951 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 08:59:03,971 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 51 transitions. Complement of second has 5 states. [2019-10-22 08:59:03,973 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 [2019-10-22 08:59:03,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:03,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-10-22 08:59:03,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-10-22 08:59:03,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:03,974 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:59:03,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:04,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:04,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:04,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:59:04,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:04,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:04,022 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:59:04,022 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 08:59:04,044 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 51 transitions. Complement of second has 5 states. [2019-10-22 08:59:04,047 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 [2019-10-22 08:59:04,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:04,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-10-22 08:59:04,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-10-22 08:59:04,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:04,048 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:59:04,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:04,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:04,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:04,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:59:04,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:04,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:04,094 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:59:04,095 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 08:59:04,115 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 53 transitions. Complement of second has 4 states. [2019-10-22 08:59:04,115 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 [2019-10-22 08:59:04,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:04,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2019-10-22 08:59:04,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-10-22 08:59:04,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:04,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-10-22 08:59:04,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:04,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-10-22 08:59:04,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:04,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2019-10-22 08:59:04,120 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:04,120 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-10-22 08:59:04,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:59:04,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:59:04,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:59:04,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:04,120 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:04,120 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:04,120 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:04,121 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:59:04,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:59:04,121 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:04,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:59:04,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:59:04 BoogieIcfgContainer [2019-10-22 08:59:04,126 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:59:04,126 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:59:04,126 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:59:04,126 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:59:04,127 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:54" (3/4) ... [2019-10-22 08:59:04,129 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:59:04,130 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:59:04,131 INFO L168 Benchmark]: Toolchain (without parser) took 10785.86 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 384.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -203.8 MB). Peak memory consumption was 181.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:04,131 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:04,132 INFO L168 Benchmark]: CACSL2BoogieTranslator took 517.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -192.6 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:04,132 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.80 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:04,133 INFO L168 Benchmark]: Boogie Preprocessor took 31.30 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:04,133 INFO L168 Benchmark]: RCFGBuilder took 396.78 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: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:04,134 INFO L168 Benchmark]: BuchiAutomizer took 9788.13 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 223.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -39.6 MB). Peak memory consumption was 184.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:04,134 INFO L168 Benchmark]: Witness Printer took 3.48 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:04,137 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 517.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -192.6 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.80 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.30 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 396.78 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: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9788.13 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 223.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -39.6 MB). Peak memory consumption was 184.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.48 ms. Allocated memory is still 1.4 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 unknown-#length-unknown[s] + -1 * s and consists of 3 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 9.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 109 SDtfs, 104 SDslu, 52 SDs, 0 SdLazy, 97 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital375 mio100 ax100 hnf99 lsp92 ukn72 mio100 lsp32 div126 bol100 ite100 ukn100 eq167 hnf82 smp87 dnf698 smp43 tf100 neg96 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...