./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/run_dir_15a43bcf-23ba-40a9-9fb8-8d53cb1c3c59/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_15a43bcf-23ba-40a9-9fb8-8d53cb1c3c59/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_15a43bcf-23ba-40a9-9fb8-8d53cb1c3c59/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_15a43bcf-23ba-40a9-9fb8-8d53cb1c3c59/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrpbrk_malloc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_15a43bcf-23ba-40a9-9fb8-8d53cb1c3c59/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_15a43bcf-23ba-40a9-9fb8-8d53cb1c3c59/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-11-15 23:31:51,026 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:31:51,028 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:31:51,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:31:51,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:31:51,043 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:31:51,045 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:31:51,054 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:31:51,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:31:51,062 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:31:51,063 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:31:51,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:31:51,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:31:51,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:31:51,067 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:31:51,068 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:31:51,069 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:31:51,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:31:51,072 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:31:51,075 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:31:51,078 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:31:51,080 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:31:51,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:31:51,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:31:51,086 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:31:51,086 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:31:51,086 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:31:51,087 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:31:51,088 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:31:51,088 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:31:51,089 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:31:51,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:31:51,090 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:31:51,090 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:31:51,091 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:31:51,092 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:31:51,092 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:31:51,092 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:31:51,093 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:31:51,093 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:31:51,094 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:31:51,095 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_15a43bcf-23ba-40a9-9fb8-8d53cb1c3c59/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 23:31:51,120 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:31:51,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:31:51,122 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:31:51,122 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:31:51,122 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:31:51,122 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:31:51,123 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:31:51,123 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:31:51,123 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:31:51,123 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:31:51,123 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:31:51,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:31:51,124 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:31:51,124 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:31:51,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:31:51,124 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:31:51,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:31:51,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:31:51,125 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:31:51,125 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:31:51,125 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:31:51,126 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:31:51,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:31:51,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:31:51,126 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:31:51,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:31:51,127 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:31:51,127 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:31:51,128 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:31:51,128 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/run_dir_15a43bcf-23ba-40a9-9fb8-8d53cb1c3c59/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-11-15 23:31:51,170 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:31:51,179 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:31:51,181 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:31:51,183 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:31:51,183 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:31:51,184 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_15a43bcf-23ba-40a9-9fb8-8d53cb1c3c59/bin/uautomizer/../../sv-benchmarks/c/termination-15/cstrpbrk_malloc.i [2019-11-15 23:31:51,229 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_15a43bcf-23ba-40a9-9fb8-8d53cb1c3c59/bin/uautomizer/data/f41542b6d/3a9255a0973447f69a0403d77ae97e74/FLAGc16ed06b1 [2019-11-15 23:31:51,658 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:31:51,659 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_15a43bcf-23ba-40a9-9fb8-8d53cb1c3c59/sv-benchmarks/c/termination-15/cstrpbrk_malloc.i [2019-11-15 23:31:51,668 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_15a43bcf-23ba-40a9-9fb8-8d53cb1c3c59/bin/uautomizer/data/f41542b6d/3a9255a0973447f69a0403d77ae97e74/FLAGc16ed06b1 [2019-11-15 23:31:52,003 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_15a43bcf-23ba-40a9-9fb8-8d53cb1c3c59/bin/uautomizer/data/f41542b6d/3a9255a0973447f69a0403d77ae97e74 [2019-11-15 23:31:52,005 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:31:52,006 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:31:52,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:31:52,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:31:52,010 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:31:52,011 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:31:52" (1/1) ... [2019-11-15 23:31:52,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c482975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:31:52, skipping insertion in model container [2019-11-15 23:31:52,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:31:52" (1/1) ... [2019-11-15 23:31:52,020 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:31:52,057 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:31:52,489 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:31:52,498 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:31:52,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:31:52,590 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:31:52,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:31:52 WrapperNode [2019-11-15 23:31:52,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:31:52,591 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:31:52,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:31:52,592 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:31:52,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:31:52" (1/1) ... [2019-11-15 23:31:52,614 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:31:52" (1/1) ... [2019-11-15 23:31:52,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:31:52,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:31:52,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:31:52,635 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:31:52,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:31:52" (1/1) ... [2019-11-15 23:31:52,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:31:52" (1/1) ... [2019-11-15 23:31:52,646 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:31:52" (1/1) ... [2019-11-15 23:31:52,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:31:52" (1/1) ... [2019-11-15 23:31:52,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:31:52" (1/1) ... [2019-11-15 23:31:52,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:31:52" (1/1) ... [2019-11-15 23:31:52,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:31:52" (1/1) ... [2019-11-15 23:31:52,660 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:31:52,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:31:52,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:31:52,661 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:31:52,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:31:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15a43bcf-23ba-40a9-9fb8-8d53cb1c3c59/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-11-15 23:31:52,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:31:52,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:31:52,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:31:52,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:31:52,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:31:52,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:31:52,941 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:31:52,941 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 23:31:52,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:31:52 BoogieIcfgContainer [2019-11-15 23:31:52,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:31:52,943 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:31:52,943 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:31:52,946 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:31:52,947 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:31:52,947 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:31:52" (1/3) ... [2019-11-15 23:31:52,948 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f9f829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:31:52, skipping insertion in model container [2019-11-15 23:31:52,949 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:31:52,949 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:31:52" (2/3) ... [2019-11-15 23:31:52,949 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f9f829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:31:52, skipping insertion in model container [2019-11-15 23:31:52,949 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:31:52,949 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:31:52" (3/3) ... [2019-11-15 23:31:52,951 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrpbrk_malloc.i [2019-11-15 23:31:52,990 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:31:52,990 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:31:52,990 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:31:52,991 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:31:52,991 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:31:52,991 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:31:52,991 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:31:52,991 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:31:53,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 23:31:53,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 23:31:53,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:31:53,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:31:53,028 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:31:53,029 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 23:31:53,029 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:31:53,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 23:31:53,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 23:31:53,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:31:53,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:31:53,032 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:31:53,032 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 23:31:53,038 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-11-15 23:31:53,039 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-11-15 23:31:53,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:31:53,044 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-15 23:31:53,051 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:31:53,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971021434] [2019-11-15 23:31:53,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:31:53,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:31:53,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:31:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:31:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:31:53,199 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:31:53,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:31:53,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-11-15 23:31:53,201 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:31:53,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87570569] [2019-11-15 23:31:53,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:31:53,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:31:53,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:31:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:31:53,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:31:53,231 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87570569] [2019-11-15 23:31:53,232 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:31:53,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:31:53,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661421058] [2019-11-15 23:31:53,237 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:31:53,237 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:31:53,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 23:31:53,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:31:53,254 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-11-15 23:31:53,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:31:53,260 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-11-15 23:31:53,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:31:53,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-11-15 23:31:53,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 23:31:53,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-11-15 23:31:53,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 23:31:53,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 23:31:53,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-11-15 23:31:53,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:31:53,270 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 23:31:53,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-11-15 23:31:53,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-15 23:31:53,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 23:31:53,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-11-15 23:31:53,291 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 23:31:53,291 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 23:31:53,291 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:31:53,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-11-15 23:31:53,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 23:31:53,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:31:53,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:31:53,293 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:31:53,293 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:31:53,293 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-11-15 23:31:53,293 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~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208; 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-11-15 23:31:53,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:31:53,294 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-11-15 23:31:53,294 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:31:53,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709105477] [2019-11-15 23:31:53,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:31:53,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:31:53,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:31:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:31:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:31:53,331 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:31:53,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:31:53,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-11-15 23:31:53,332 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:31:53,332 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870173987] [2019-11-15 23:31:53,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:31:53,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:31:53,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:31:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:31:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:31:53,361 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:31:53,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:31:53,362 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-11-15 23:31:53,362 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:31:53,362 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849309151] [2019-11-15 23:31:53,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:31:53,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:31:53,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:31:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:31:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:31:53,441 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:31:53,659 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-15 23:31:53,962 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-11-15 23:31:54,387 WARN L191 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-11-15 23:31:54,528 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-15 23:31:54,540 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:31:54,540 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:31:54,540 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:31:54,541 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:31:54,541 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:31:54,541 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:31:54,541 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:31:54,541 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:31:54,541 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_malloc.i_Iteration2_Lasso [2019-11-15 23:31:54,542 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:31:54,542 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:31:54,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:54,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:54,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:54,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-11-15 23:31:54,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:54,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:54,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-11-15 23:31:54,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:54,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:54,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:54,973 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-11-15 23:31:55,199 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-11-15 23:31:55,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:55,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:55,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:55,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:55,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:55,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:55,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:55,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:55,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:55,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:55,678 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2019-11-15 23:31:56,151 WARN L191 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-15 23:31:56,202 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:31:56,207 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:31:56,209 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-11-15 23:31:56,210 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:56,211 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:56,212 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:56,212 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:56,213 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:56,214 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:56,215 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:56,218 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:56,219 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-11-15 23:31:56,220 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:56,220 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:56,221 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:56,221 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:56,222 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:56,223 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:56,223 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:56,225 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:56,225 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-11-15 23:31:56,226 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:56,226 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:56,227 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:56,227 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:56,227 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:56,228 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:56,228 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:56,229 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:56,230 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-11-15 23:31:56,231 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:56,231 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:56,232 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:56,233 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:56,239 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:31:56,239 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:31:56,252 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:56,256 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-11-15 23:31:56,265 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:56,265 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:56,266 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:56,266 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:56,266 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:56,267 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:56,267 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:56,268 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:56,268 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-11-15 23:31:56,269 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:56,269 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:56,269 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:56,269 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:56,269 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:56,269 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:56,269 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:56,270 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:56,271 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-11-15 23:31:56,271 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:56,271 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:56,271 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:56,272 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:56,273 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:31:56,273 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:31:56,275 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:56,276 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-11-15 23:31:56,276 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:56,276 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:56,276 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:56,276 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:56,276 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:56,277 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:56,277 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:56,277 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:56,278 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-11-15 23:31:56,278 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:56,278 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:56,278 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:56,278 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:56,278 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:56,279 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:56,279 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:56,279 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:56,279 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-11-15 23:31:56,280 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:56,280 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:56,280 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:56,280 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:56,281 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:31:56,281 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:31:56,291 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:56,291 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-11-15 23:31:56,292 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:56,292 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:56,292 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:56,292 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:56,293 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:56,293 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:56,293 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:56,295 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:56,296 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-11-15 23:31:56,296 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:56,297 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:56,297 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:56,297 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:31:56,297 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:56,299 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:31:56,299 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:56,310 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:56,310 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-11-15 23:31:56,311 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:56,311 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:56,311 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:56,311 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:56,317 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:31:56,317 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:31:56,358 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:31:56,399 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:31:56,400 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 23:31:56,402 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:31:56,403 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:31:56,403 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:31:56,404 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrpbrk_~sc1~0.base)_1, ULTIMATE.start_cstrpbrk_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~sc1~0.base)_1 - 1*ULTIMATE.start_cstrpbrk_~sc1~0.offset Supporting invariants [] [2019-11-15 23:31:56,446 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-15 23:31:56,453 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 23:31:56,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:31:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:31:56,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:31:56,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:31:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:31:56,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:31:56,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:31:56,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:31:56,533 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-11-15 23:31:56,533 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 23:31:56,573 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-11-15 23:31:56,578 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-11-15 23:31:56,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:31:56,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-11-15 23:31:56,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-15 23:31:56,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:31:56,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-11-15 23:31:56,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:31:56,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-11-15 23:31:56,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:31:56,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-11-15 23:31:56,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:31:56,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-11-15 23:31:56,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 23:31:56,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 23:31:56,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-11-15 23:31:56,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:31:56,585 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 23:31:56,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-11-15 23:31:56,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-15 23:31:56,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 23:31:56,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-11-15 23:31:56,587 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 23:31:56,587 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 23:31:56,587 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:31:56,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-11-15 23:31:56,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:31:56,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:31:56,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:31:56,589 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:31:56,589 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:31:56,589 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-11-15 23:31:56,589 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~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;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-11-15 23:31:56,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:31:56,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-11-15 23:31:56,590 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:31:56,590 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029521069] [2019-11-15 23:31:56,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:31:56,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:31:56,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:31:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:31:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:31:56,622 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:31:56,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:31:56,623 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-11-15 23:31:56,623 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:31:56,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729302672] [2019-11-15 23:31:56,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:31:56,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:31:56,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:31:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:31:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:31:56,641 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:31:56,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:31:56,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-11-15 23:31:56,642 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:31:56,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368079855] [2019-11-15 23:31:56,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:31:56,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:31:56,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:31:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:31:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:31:56,718 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:31:56,901 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-15 23:31:57,282 WARN L191 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 103 [2019-11-15 23:31:57,402 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-15 23:31:57,404 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:31:57,404 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:31:57,404 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:31:57,404 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:31:57,404 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:31:57,404 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:31:57,404 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:31:57,405 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:31:57,405 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_malloc.i_Iteration3_Lasso [2019-11-15 23:31:57,405 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:31:57,405 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:31:57,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:57,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:57,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:57,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:57,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:57,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:57,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:57,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:57,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:57,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:57,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:57,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:57,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:57,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:57,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:57,770 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2019-11-15 23:31:57,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:57,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:57,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:57,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:57,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:58,625 WARN L191 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 23:31:58,796 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-11-15 23:31:58,832 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:31:58,832 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:31:58,833 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-11-15 23:31:58,833 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:58,834 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:58,834 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:58,834 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:58,834 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:58,834 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:58,835 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:58,835 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:58,836 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-11-15 23:31:58,836 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:58,837 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:58,837 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:58,837 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:58,842 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:58,842 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:58,842 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:58,843 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:58,843 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-11-15 23:31:58,843 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:58,844 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:58,844 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:58,844 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:58,845 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:31:58,845 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:31:58,847 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:58,847 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-11-15 23:31:58,848 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:58,848 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:58,848 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:58,848 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:58,848 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:58,849 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:58,849 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:58,849 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:58,849 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-11-15 23:31:58,850 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:58,850 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:58,850 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:58,850 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:58,850 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:58,851 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:58,851 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:58,851 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:58,852 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-11-15 23:31:58,852 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:58,852 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:58,852 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:58,852 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:58,852 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:58,853 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:58,853 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:58,853 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:58,854 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-11-15 23:31:58,854 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:58,854 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:58,854 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:58,854 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:58,855 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:58,855 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:58,855 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:58,856 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:58,856 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-11-15 23:31:58,856 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:58,856 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:58,857 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:58,857 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:58,863 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:31:58,864 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:31:58,874 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:58,874 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-11-15 23:31:58,875 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:58,875 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:58,875 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:58,876 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:58,876 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:58,877 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:58,877 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:58,878 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:58,879 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-11-15 23:31:58,879 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:58,879 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:58,879 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:58,879 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:58,880 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:58,880 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:58,880 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:58,881 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:58,881 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-11-15 23:31:58,882 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:58,882 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:58,882 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:58,882 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:58,882 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:58,882 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:58,883 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:58,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:58,884 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-11-15 23:31:58,884 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:58,884 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:58,884 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:58,884 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:58,884 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:58,885 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:58,885 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:58,886 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:58,886 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-11-15 23:31:58,886 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:58,887 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:58,887 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:58,887 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:58,887 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:58,887 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:58,887 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:58,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:58,888 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-11-15 23:31:58,889 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:58,889 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:58,889 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:58,889 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:58,889 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:58,890 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:58,890 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:58,890 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:58,891 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-11-15 23:31:58,891 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:58,891 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:58,891 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:58,892 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:58,892 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:31:58,893 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:31:58,894 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:58,895 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-11-15 23:31:58,895 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:58,896 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:58,896 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:58,896 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:58,900 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:31:58,900 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:31:58,972 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:31:59,006 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 23:31:59,006 INFO L444 ModelExtractionUtils]: 39 out of 46 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 23:31:59,007 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:31:59,008 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:31:59,008 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:31:59,008 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-11-15 23:31:59,062 INFO L297 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2019-11-15 23:31:59,064 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 23:31:59,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:31:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:31:59,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:31:59,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:31:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:31:59,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:31:59,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:31:59,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:31:59,128 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-11-15 23:31:59,128 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 23:31:59,167 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-11-15 23:31:59,168 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-11-15 23:31:59,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:31:59,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-15 23:31:59,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-15 23:31:59,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:31:59,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-15 23:31:59,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:31:59,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-11-15 23:31:59,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:31:59,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-11-15 23:31:59,172 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:31:59,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-11-15 23:31:59,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 23:31:59,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 23:31:59,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-11-15 23:31:59,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:31:59,173 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-11-15 23:31:59,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-11-15 23:31:59,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-11-15 23:31:59,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-15 23:31:59,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-11-15 23:31:59,176 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-15 23:31:59,176 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-15 23:31:59,176 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:31:59,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-11-15 23:31:59,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:31:59,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:31:59,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:31:59,180 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:31:59,180 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:31:59,180 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~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208; 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-11-15 23:31:59,180 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~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;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-11-15 23:31:59,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:31:59,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-11-15 23:31:59,181 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:31:59,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264230415] [2019-11-15 23:31:59,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:31:59,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:31:59,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:31:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:31:59,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:31:59,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264230415] [2019-11-15 23:31:59,273 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:31:59,273 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:31:59,273 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512800961] [2019-11-15 23:31:59,273 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:31:59,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:31:59,274 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-11-15 23:31:59,274 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:31:59,274 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038423871] [2019-11-15 23:31:59,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:31:59,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:31:59,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:31:59,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:31:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:31:59,282 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:31:59,498 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-15 23:31:59,498 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:31:59,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:31:59,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:31:59,499 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-15 23:31:59,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:31:59,599 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-11-15 23:31:59,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:31:59,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-11-15 23:31:59,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:31:59,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2019-11-15 23:31:59,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 23:31:59,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 23:31:59,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2019-11-15 23:31:59,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:31:59,602 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-15 23:31:59,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2019-11-15 23:31:59,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-11-15 23:31:59,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-15 23:31:59,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-11-15 23:31:59,605 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-15 23:31:59,605 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-15 23:31:59,605 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:31:59,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2019-11-15 23:31:59,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:31:59,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:31:59,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:31:59,606 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:31:59,606 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:31:59,607 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~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208; 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-11-15 23:31:59,607 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~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;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-11-15 23:31:59,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:31:59,607 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-11-15 23:31:59,607 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:31:59,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951685104] [2019-11-15 23:31:59,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:31:59,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:31:59,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:31:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:31:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:31:59,634 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:31:59,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:31:59,635 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-11-15 23:31:59,635 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:31:59,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182442389] [2019-11-15 23:31:59,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:31:59,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:31:59,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:31:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:31:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:31:59,648 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:31:59,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:31:59,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-11-15 23:31:59,649 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:31:59,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105349047] [2019-11-15 23:31:59,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:31:59,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:31:59,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:31:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:31:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:31:59,710 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:32:00,484 WARN L191 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 136 [2019-11-15 23:32:01,429 WARN L191 SmtUtils]: Spent 925.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 108 [2019-11-15 23:32:01,431 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:32:01,431 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:32:01,431 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:32:01,432 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:32:01,432 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:32:01,432 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:32:01,432 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:32:01,432 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:32:01,432 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_malloc.i_Iteration5_Lasso [2019-11-15 23:32:01,432 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:32:01,432 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:32:01,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:01,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:01,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:01,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:01,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:01,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:01,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:01,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:01,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:01,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:01,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:01,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:01,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:01,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:01,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-11-15 23:32:01,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:01,663 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-15 23:32:02,375 WARN L191 SmtUtils]: Spent 707.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 95 [2019-11-15 23:32:02,520 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-11-15 23:32:02,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:02,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:02,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:02,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:02,865 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-11-15 23:32:03,339 WARN L191 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 23:32:03,622 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2019-11-15 23:32:03,779 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-11-15 23:32:03,791 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:32:03,791 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:32:03,792 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-11-15 23:32:03,793 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:03,793 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:32:03,793 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:03,793 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:03,794 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:03,794 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:32:03,794 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:32:03,795 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:03,795 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-11-15 23:32:03,796 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:03,796 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:32:03,796 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:03,796 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:03,796 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:03,796 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:32:03,797 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:32:03,797 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:03,797 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-11-15 23:32:03,798 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:03,798 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:32:03,798 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:03,798 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:03,799 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:03,799 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:32:03,799 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:32:03,799 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:03,800 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-11-15 23:32:03,800 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:03,800 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:32:03,801 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:03,801 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:03,801 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:03,801 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:32:03,801 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:32:03,802 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:03,802 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-11-15 23:32:03,803 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:03,803 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:32:03,803 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:03,803 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:03,803 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:03,804 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:32:03,804 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:32:03,804 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:03,805 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-11-15 23:32:03,805 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:03,805 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:03,806 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:03,806 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:03,806 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:32:03,807 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:32:03,808 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:03,808 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-11-15 23:32:03,809 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:03,809 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:32:03,809 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:03,809 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:03,810 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:03,810 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:32:03,810 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:32:03,811 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:03,811 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-11-15 23:32:03,811 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:03,812 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:32:03,812 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:03,812 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:03,812 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:03,812 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:32:03,812 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:32:03,813 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:03,813 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-11-15 23:32:03,814 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:03,814 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:32:03,814 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:03,814 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:03,814 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:03,815 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:32:03,815 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:32:03,815 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:03,816 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-11-15 23:32:03,816 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:03,816 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:03,816 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:03,817 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:03,817 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:32:03,818 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:32:03,819 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:03,819 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-11-15 23:32:03,820 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:03,820 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:32:03,820 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:03,820 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:03,821 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:03,821 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:32:03,821 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:32:03,822 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:03,822 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-11-15 23:32:03,822 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:03,823 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:32:03,823 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:03,823 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:03,823 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:03,823 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:32:03,824 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:32:03,824 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:03,824 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-11-15 23:32:03,825 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:03,825 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:32:03,825 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:03,825 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:03,826 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:03,826 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:32:03,826 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:32:03,827 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:03,827 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-11-15 23:32:03,828 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:03,828 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:32:03,828 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:03,828 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:03,828 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:03,828 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:32:03,829 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:32:03,829 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:03,829 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-11-15 23:32:03,830 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:03,830 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:32:03,830 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:03,830 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:03,831 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:03,831 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:32:03,831 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:32:03,831 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:03,832 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-11-15 23:32:03,832 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:03,832 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:03,833 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:03,833 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:03,834 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:32:03,834 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:32:03,835 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:03,835 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-11-15 23:32:03,836 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:03,836 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:03,836 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:03,836 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:03,837 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:32:03,838 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:32:03,839 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:03,840 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-11-15 23:32:03,840 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:03,840 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:03,840 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:03,841 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:03,841 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:32:03,842 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:32:03,843 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:03,843 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-11-15 23:32:03,844 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:03,844 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:03,844 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:03,844 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:03,846 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:32:03,846 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:32:03,850 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:03,851 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-11-15 23:32:03,851 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:03,852 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:03,852 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:03,852 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:03,853 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:32:03,853 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:32:03,854 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:03,854 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-11-15 23:32:03,855 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:03,855 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:03,855 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:03,855 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:03,859 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:32:03,859 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:32:03,878 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:32:03,901 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:32:03,901 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 23:32:03,902 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:32:03,903 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:32:03,903 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:32:03,903 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-11-15 23:32:04,018 INFO L297 tatePredicateManager]: 26 out of 26 supporting invariants were superfluous and have been removed [2019-11-15 23:32:04,020 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 23:32:04,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:04,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:32:04,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:32:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:04,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:32:04,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:32:04,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:04,097 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-11-15 23:32:04,097 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 23:32:04,130 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-11-15 23:32:04,131 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-11-15 23:32:04,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:32:04,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-15 23:32:04,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 23:32:04,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:32:04,132 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:32:04,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:04,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:32:04,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:32:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:04,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:32:04,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:32:04,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:04,228 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-11-15 23:32:04,228 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 23:32:04,251 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-11-15 23:32:04,255 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-11-15 23:32:04,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:32:04,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-15 23:32:04,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 23:32:04,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:32:04,256 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:32:04,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:04,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:32:04,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:32:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:04,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:32:04,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:32:04,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:04,325 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-11-15 23:32:04,325 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 23:32:04,346 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-11-15 23:32:04,347 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-11-15 23:32:04,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:32:04,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2019-11-15 23:32:04,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 23:32:04,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:32:04,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-15 23:32:04,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:32:04,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-11-15 23:32:04,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:32:04,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2019-11-15 23:32:04,351 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:32:04,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-11-15 23:32:04,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:32:04,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:32:04,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:32:04,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:32:04,352 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:32:04,352 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:32:04,352 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:32:04,353 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:32:04,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:32:04,353 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:32:04,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:32:04,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:32:04 BoogieIcfgContainer [2019-11-15 23:32:04,359 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:32:04,359 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:32:04,360 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:32:04,360 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:32:04,360 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:31:52" (3/4) ... [2019-11-15 23:32:04,364 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:32:04,364 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:32:04,365 INFO L168 Benchmark]: Toolchain (without parser) took 12359.01 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 284.2 MB). Free memory was 944.7 MB in the beginning and 1.3 GB in the end (delta: -313.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:32:04,366 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:32:04,368 INFO L168 Benchmark]: CACSL2BoogieTranslator took 584.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:32:04,369 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:32:04,369 INFO L168 Benchmark]: Boogie Preprocessor took 25.11 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:32:04,370 INFO L168 Benchmark]: RCFGBuilder took 282.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:32:04,372 INFO L168 Benchmark]: BuchiAutomizer took 11416.09 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 144.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -169.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:32:04,373 INFO L168 Benchmark]: Witness Printer took 4.45 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:32:04,376 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 584.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.11 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 282.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11416.09 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 144.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -169.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.45 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 unknown-#length-unknown[sc1] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[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 11.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 10.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 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: 22ms 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...