./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strlcat.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2c57cb90-8bc8-43ed-9ce9-6e63d9b4e9ce/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2c57cb90-8bc8-43ed-9ce9-6e63d9b4e9ce/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2c57cb90-8bc8-43ed-9ce9-6e63d9b4e9ce/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2c57cb90-8bc8-43ed-9ce9-6e63d9b4e9ce/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strlcat.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2c57cb90-8bc8-43ed-9ce9-6e63d9b4e9ce/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2c57cb90-8bc8-43ed-9ce9-6e63d9b4e9ce/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 31c220d29d6dec1ef33d2c1aa086e47a745ff101 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:00:33,573 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:00:33,582 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:00:33,591 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:00:33,591 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:00:33,592 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:00:33,593 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:00:33,594 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:00:33,596 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:00:33,596 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:00:33,597 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:00:33,598 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:00:33,599 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:00:33,599 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:00:33,600 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:00:33,601 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:00:33,602 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:00:33,603 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:00:33,604 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:00:33,606 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:00:33,607 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:00:33,608 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:00:33,609 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:00:33,610 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:00:33,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:00:33,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:00:33,613 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:00:33,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:00:33,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:00:33,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:00:33,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:00:33,616 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:00:33,617 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:00:33,617 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:00:33,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:00:33,619 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:00:33,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:00:33,620 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:00:33,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:00:33,621 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:00:33,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:00:33,622 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2c57cb90-8bc8-43ed-9ce9-6e63d9b4e9ce/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 09:00:33,635 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:00:33,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:00:33,636 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:00:33,637 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:00:33,637 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:00:33,637 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:00:33,637 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:00:33,637 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:00:33,637 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:00:33,637 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:00:33,638 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:00:33,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:00:33,638 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:00:33,638 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:00:33,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:00:33,638 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:00:33,638 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:00:33,639 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:00:33,639 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:00:33,639 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:00:33,639 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:00:33,639 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:00:33,639 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:00:33,640 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:00:33,640 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:00:33,640 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:00:33,640 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:00:33,640 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:00:33,641 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:00:33,641 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_2c57cb90-8bc8-43ed-9ce9-6e63d9b4e9ce/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 -> 31c220d29d6dec1ef33d2c1aa086e47a745ff101 [2019-10-22 09:00:33,664 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:00:33,674 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:00:33,676 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:00:33,678 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:00:33,678 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:00:33,679 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2c57cb90-8bc8-43ed-9ce9-6e63d9b4e9ce/bin/uautomizer/../../sv-benchmarks/c/termination-libowfat/strlcat.i [2019-10-22 09:00:33,724 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2c57cb90-8bc8-43ed-9ce9-6e63d9b4e9ce/bin/uautomizer/data/c6dc54d8d/c59a0491d30a4ea9a2819e02949f9f2d/FLAG19b075861 [2019-10-22 09:00:34,151 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:00:34,151 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2c57cb90-8bc8-43ed-9ce9-6e63d9b4e9ce/sv-benchmarks/c/termination-libowfat/strlcat.i [2019-10-22 09:00:34,161 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2c57cb90-8bc8-43ed-9ce9-6e63d9b4e9ce/bin/uautomizer/data/c6dc54d8d/c59a0491d30a4ea9a2819e02949f9f2d/FLAG19b075861 [2019-10-22 09:00:34,171 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2c57cb90-8bc8-43ed-9ce9-6e63d9b4e9ce/bin/uautomizer/data/c6dc54d8d/c59a0491d30a4ea9a2819e02949f9f2d [2019-10-22 09:00:34,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:00:34,175 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:00:34,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:34,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:00:34,180 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:00:34,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:34" (1/1) ... [2019-10-22 09:00:34,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61050187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:34, skipping insertion in model container [2019-10-22 09:00:34,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:34" (1/1) ... [2019-10-22 09:00:34,190 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:00:34,223 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:00:34,538 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:34,548 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:00:34,594 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:34,644 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:00:34,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:34 WrapperNode [2019-10-22 09:00:34,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:34,645 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:34,645 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:00:34,645 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:00:34,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:34" (1/1) ... [2019-10-22 09:00:34,672 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:34" (1/1) ... [2019-10-22 09:00:34,695 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:34,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:00:34,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:00:34,696 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:00:34,702 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:34" (1/1) ... [2019-10-22 09:00:34,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:34" (1/1) ... [2019-10-22 09:00:34,706 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:34" (1/1) ... [2019-10-22 09:00:34,706 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:34" (1/1) ... [2019-10-22 09:00:34,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:34" (1/1) ... [2019-10-22 09:00:34,718 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:34" (1/1) ... [2019-10-22 09:00:34,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:34" (1/1) ... [2019-10-22 09:00:34,722 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:00:34,722 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:00:34,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:00:34,722 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:00:34,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c57cb90-8bc8-43ed-9ce9-6e63d9b4e9ce/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:34,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:00:34,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:00:34,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:00:34,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:00:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:00:34,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:00:35,176 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:00:35,176 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-10-22 09:00:35,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:35 BoogieIcfgContainer [2019-10-22 09:00:35,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:00:35,178 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:00:35,178 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:00:35,183 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:00:35,185 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:35,185 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:00:34" (1/3) ... [2019-10-22 09:00:35,186 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@499133c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:35, skipping insertion in model container [2019-10-22 09:00:35,186 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:35,186 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:34" (2/3) ... [2019-10-22 09:00:35,187 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@499133c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:35, skipping insertion in model container [2019-10-22 09:00:35,187 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:35,187 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:35" (3/3) ... [2019-10-22 09:00:35,189 INFO L371 chiAutomizerObserver]: Analyzing ICFG strlcat.i [2019-10-22 09:00:35,234 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:00:35,235 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:00:35,235 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:00:35,236 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:00:35,236 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:00:35,236 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:00:35,236 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:00:35,236 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:00:35,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-10-22 09:00:35,273 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-10-22 09:00:35,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:35,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:35,283 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 09:00:35,284 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:35,284 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:00:35,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-10-22 09:00:35,285 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-10-22 09:00:35,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:35,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:35,286 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 09:00:35,286 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:35,291 INFO L791 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 15#L-1true havoc main_#res;havoc main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~ret19, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet15;havoc main_#t~nondet15; 23#L539true assume !(main_~in_len~0 < 1);call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet17;havoc main_#t~nondet17; 14#L543true assume !(main_~out_len~0 < 1);call main_#t~malloc18.base, main_#t~malloc18.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc18.base, main_#t~malloc18.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strlcat_#in~dst.base, strlcat_#in~dst.offset, strlcat_#in~src.base, strlcat_#in~src.offset, strlcat_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcat_#res;havoc strlcat_#t~post8.base, strlcat_#t~post8.offset, strlcat_#t~mem5, strlcat_#t~post6, strlcat_#t~short7, strlcat_#t~ret9, strlcat_#t~post11.base, strlcat_#t~post11.offset, strlcat_#t~mem12, strlcat_#t~post13, strlcat_#t~post14.base, strlcat_#t~post14.offset, strlcat_#t~mem10, strlcat_~dst.base, strlcat_~dst.offset, strlcat_~src.base, strlcat_~src.offset, strlcat_~siz, strlcat_~d~0.base, strlcat_~d~0.offset, strlcat_~s~0.base, strlcat_~s~0.offset, strlcat_~n~0, strlcat_~dlen~0;strlcat_~dst.base, strlcat_~dst.offset := strlcat_#in~dst.base, strlcat_#in~dst.offset;strlcat_~src.base, strlcat_~src.offset := strlcat_#in~src.base, strlcat_#in~src.offset;strlcat_~siz := strlcat_#in~siz;strlcat_~d~0.base, strlcat_~d~0.offset := strlcat_~dst.base, strlcat_~dst.offset;strlcat_~s~0.base, strlcat_~s~0.offset := strlcat_~src.base, strlcat_~src.offset;strlcat_~n~0 := strlcat_~siz;havoc strlcat_~dlen~0; 3#L521-5true [2019-10-22 09:00:35,291 INFO L793 eck$LassoCheckResult]: Loop: 3#L521-5true call strlcat_#t~mem5 := read~int(strlcat_~d~0.base, strlcat_~d~0.offset, 1);strlcat_#t~short7 := 0 != strlcat_#t~mem5; 18#L521-1true assume strlcat_#t~short7;strlcat_#t~post6 := strlcat_~n~0;strlcat_~n~0 := strlcat_#t~post6 - 1;strlcat_#t~short7 := 0 != strlcat_#t~post6 % 4294967296; 22#L521-3true assume !!strlcat_#t~short7;havoc strlcat_#t~short7;havoc strlcat_#t~post6;havoc strlcat_#t~mem5;strlcat_#t~post8.base, strlcat_#t~post8.offset := strlcat_~d~0.base, strlcat_~d~0.offset;strlcat_~d~0.base, strlcat_~d~0.offset := strlcat_#t~post8.base, 1 + strlcat_#t~post8.offset;havoc strlcat_#t~post8.base, strlcat_#t~post8.offset; 3#L521-5true [2019-10-22 09:00:35,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:35,296 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2019-10-22 09:00:35,303 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:35,303 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793037215] [2019-10-22 09:00:35,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:35,442 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:35,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:35,443 INFO L82 PathProgramCache]: Analyzing trace with hash 46776, now seen corresponding path program 1 times [2019-10-22 09:00:35,443 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:35,443 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639590150] [2019-10-22 09:00:35,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:35,463 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:35,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:35,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907761, now seen corresponding path program 1 times [2019-10-22 09:00:35,465 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:35,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676837186] [2019-10-22 09:00:35,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:35,568 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:35,687 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-10-22 09:00:36,126 WARN L191 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 103 [2019-10-22 09:00:36,246 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-10-22 09:00:36,256 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:36,257 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:36,257 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:36,257 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:36,257 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:36,257 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:36,257 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:36,257 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:36,258 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcat.i_Iteration1_Lasso [2019-10-22 09:00:36,258 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:36,258 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:36,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,591 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-10-22 09:00:36,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,456 WARN L191 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 09:00:37,509 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:37,519 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:37,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:37,522 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,522 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,523 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,523 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,524 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,526 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,526 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,527 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:37,528 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,528 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,528 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,528 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,530 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:37,530 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:37,549 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:37,550 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,550 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,550 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,550 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,550 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,551 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,551 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,551 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:37,552 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,552 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,552 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,553 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,553 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,553 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,553 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,554 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:37,555 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,555 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,555 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,555 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,556 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,556 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,556 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,557 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:37,557 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,558 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,558 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,558 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,558 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,558 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,559 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,559 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:37,565 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,565 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,565 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,565 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,565 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,566 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,566 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:37,573 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,573 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,573 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,573 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,573 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,574 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,574 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,575 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:37,576 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,576 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,576 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,576 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,576 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,577 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,577 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,577 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:37,578 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,579 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,579 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,579 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,586 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:37,587 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:37,641 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:37,666 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:00:37,666 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:00:37,668 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:37,670 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:37,670 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:37,671 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlcat_~d~0.offset, v_rep(select #length ULTIMATE.start_strlcat_~d~0.base)_1) = -1*ULTIMATE.start_strlcat_~d~0.offset + 1*v_rep(select #length ULTIMATE.start_strlcat_~d~0.base)_1 Supporting invariants [] [2019-10-22 09:00:37,694 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-10-22 09:00:37,702 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:00:37,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:37,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:37,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:37,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:00:37,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:37,805 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:00:37,806 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 3 states. [2019-10-22 09:00:37,881 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 3 states. Result 76 states and 104 transitions. Complement of second has 7 states. [2019-10-22 09:00:37,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:37,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:37,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2019-10-22 09:00:37,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 69 transitions. Stem has 4 letters. Loop has 3 letters. [2019-10-22 09:00:37,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:37,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 69 transitions. Stem has 7 letters. Loop has 3 letters. [2019-10-22 09:00:37,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:37,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 69 transitions. Stem has 4 letters. Loop has 6 letters. [2019-10-22 09:00:37,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:37,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 104 transitions. [2019-10-22 09:00:37,892 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-10-22 09:00:37,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 36 states and 45 transitions. [2019-10-22 09:00:37,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-10-22 09:00:37,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-10-22 09:00:37,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2019-10-22 09:00:37,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:37,898 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-10-22 09:00:37,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2019-10-22 09:00:37,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2019-10-22 09:00:37,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-22 09:00:37,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-10-22 09:00:37,926 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-10-22 09:00:37,926 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-10-22 09:00:37,926 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:00:37,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2019-10-22 09:00:37,927 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 09:00:37,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:37,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:37,928 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:37,928 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:00:37,928 INFO L791 eck$LassoCheckResult]: Stem: 206#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 204#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~ret19, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet15;havoc main_#t~nondet15; 205#L539 assume !(main_~in_len~0 < 1);call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet17;havoc main_#t~nondet17; 203#L543 assume !(main_~out_len~0 < 1);call main_#t~malloc18.base, main_#t~malloc18.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc18.base, main_#t~malloc18.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strlcat_#in~dst.base, strlcat_#in~dst.offset, strlcat_#in~src.base, strlcat_#in~src.offset, strlcat_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcat_#res;havoc strlcat_#t~post8.base, strlcat_#t~post8.offset, strlcat_#t~mem5, strlcat_#t~post6, strlcat_#t~short7, strlcat_#t~ret9, strlcat_#t~post11.base, strlcat_#t~post11.offset, strlcat_#t~mem12, strlcat_#t~post13, strlcat_#t~post14.base, strlcat_#t~post14.offset, strlcat_#t~mem10, strlcat_~dst.base, strlcat_~dst.offset, strlcat_~src.base, strlcat_~src.offset, strlcat_~siz, strlcat_~d~0.base, strlcat_~d~0.offset, strlcat_~s~0.base, strlcat_~s~0.offset, strlcat_~n~0, strlcat_~dlen~0;strlcat_~dst.base, strlcat_~dst.offset := strlcat_#in~dst.base, strlcat_#in~dst.offset;strlcat_~src.base, strlcat_~src.offset := strlcat_#in~src.base, strlcat_#in~src.offset;strlcat_~siz := strlcat_#in~siz;strlcat_~d~0.base, strlcat_~d~0.offset := strlcat_~dst.base, strlcat_~dst.offset;strlcat_~s~0.base, strlcat_~s~0.offset := strlcat_~src.base, strlcat_~src.offset;strlcat_~n~0 := strlcat_~siz;havoc strlcat_~dlen~0; 184#L521-5 call strlcat_#t~mem5 := read~int(strlcat_~d~0.base, strlcat_~d~0.offset, 1);strlcat_#t~short7 := 0 != strlcat_#t~mem5; 186#L521-1 assume !strlcat_#t~short7; 207#L521-3 assume !strlcat_#t~short7;havoc strlcat_#t~short7;havoc strlcat_#t~post6;havoc strlcat_#t~mem5; 198#L521-6 assume strlcat_~d~0.base == strlcat_~dst.base;strlcat_~dlen~0 := (if strlcat_~d~0.offset - strlcat_~dst.offset < 0 && 0 != (strlcat_~d~0.offset - strlcat_~dst.offset) % 1 then 1 + (strlcat_~d~0.offset - strlcat_~dst.offset) / 1 else (strlcat_~d~0.offset - strlcat_~dst.offset) / 1);strlcat_~n~0 := strlcat_~siz - strlcat_~dlen~0; 199#L525 assume !(0 == strlcat_~n~0 % 4294967296); 195#L527-3 [2019-10-22 09:00:37,928 INFO L793 eck$LassoCheckResult]: Loop: 195#L527-3 call strlcat_#t~mem10 := read~int(strlcat_~s~0.base, strlcat_~s~0.offset, 1); 190#L527-1 assume !!(0 != strlcat_#t~mem10);havoc strlcat_#t~mem10; 191#L528 assume !(1 != strlcat_~n~0 % 4294967296); 194#L528-2 strlcat_#t~post14.base, strlcat_#t~post14.offset := strlcat_~s~0.base, strlcat_~s~0.offset;strlcat_~s~0.base, strlcat_~s~0.offset := strlcat_#t~post14.base, 1 + strlcat_#t~post14.offset;havoc strlcat_#t~post14.base, strlcat_#t~post14.offset; 195#L527-3 [2019-10-22 09:00:37,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:37,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1271629448, now seen corresponding path program 1 times [2019-10-22 09:00:37,929 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:37,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469056927] [2019-10-22 09:00:37,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:37,982 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:37,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:37,983 INFO L82 PathProgramCache]: Analyzing trace with hash 2898824, now seen corresponding path program 1 times [2019-10-22 09:00:37,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:37,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051946277] [2019-10-22 09:00:37,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:37,992 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:37,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:37,993 INFO L82 PathProgramCache]: Analyzing trace with hash -701290865, now seen corresponding path program 1 times [2019-10-22 09:00:37,993 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:37,993 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805730356] [2019-10-22 09:00:37,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:38,070 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:38,569 WARN L191 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 132 [2019-10-22 09:00:38,940 WARN L191 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 107 [2019-10-22 09:00:38,942 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:38,942 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:38,942 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:38,942 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:38,942 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:38,942 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:38,942 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:38,942 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:38,942 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcat.i_Iteration2_Lasso [2019-10-22 09:00:38,942 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:38,943 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:38,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:39,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:39,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:39,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:39,301 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 92 [2019-10-22 09:00:39,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:39,676 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-10-22 09:00:40,029 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 09:00:40,161 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:40,161 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:40,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:40,162 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,162 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:40,162 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,163 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,163 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,163 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:40,163 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:40,164 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:40,165 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,165 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:40,165 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,165 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,165 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,165 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:40,166 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:40,166 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:40,167 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,167 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,167 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,167 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,168 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:40,168 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:40,170 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:40,171 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,171 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:40,171 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,171 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,171 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,172 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:40,172 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:40,172 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:40,173 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,173 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:40,174 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,174 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,174 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,174 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:40,174 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:40,175 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:40,176 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,176 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:40,176 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,176 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,176 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,177 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:40,177 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:40,178 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:40,178 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,179 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:40,179 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,179 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,179 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,179 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:40,180 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:40,180 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:40,181 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,181 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:40,181 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,181 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,181 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,182 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:40,182 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:40,183 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:40,184 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,184 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:40,184 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,184 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,185 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,185 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:40,185 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:40,186 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:40,186 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,186 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:40,187 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,187 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,187 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,187 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:40,187 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:40,188 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:40,189 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,189 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,189 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,189 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,190 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:40,190 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:40,192 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:40,193 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,193 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:40,193 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,193 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,194 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,194 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:40,194 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:40,194 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:40,195 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,195 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:40,196 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,196 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,196 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,196 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:40,196 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:40,197 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:40,198 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,198 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:40,198 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,198 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,198 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,198 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:40,198 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:40,199 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:40,200 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,200 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:40,200 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,200 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,201 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,201 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:40,201 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:40,202 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:40,202 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,202 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:40,203 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,203 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,203 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,203 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:40,204 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:40,204 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:40,205 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,205 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:40,205 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,206 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,206 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,206 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:40,206 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:40,206 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:40,207 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,208 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,208 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,208 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,209 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:40,209 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:40,211 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:40,212 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,212 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:40,212 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,212 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,212 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,213 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:40,213 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:40,213 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:40,214 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,214 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:40,214 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,214 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,214 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,215 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:40,215 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:40,216 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:40,216 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,217 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,217 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,217 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,218 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:40,218 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:40,220 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,221 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:40,221 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,221 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,221 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,221 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,222 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:40,222 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:40,224 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,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-10-22 09:00:40,225 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,225 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,225 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,225 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,226 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:40,226 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:40,228 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:40,229 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,229 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,229 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,229 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,230 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:40,230 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:40,237 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:40,238 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,238 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 09:00:40,238 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,238 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,243 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:00:40,243 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:40,268 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:40,269 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,269 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,270 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,270 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,270 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:40,271 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:40,272 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:40,273 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,273 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:40,274 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,274 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:40,274 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,274 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:40,274 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:40,276 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:40,277 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,277 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,277 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,277 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,278 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:40,278 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:40,280 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:40,281 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,281 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,281 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,281 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,286 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:40,286 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:40,331 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:40,365 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:00:40,366 INFO L444 ModelExtractionUtils]: 56 out of 61 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 09:00:40,366 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:40,367 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:40,368 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:40,368 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strlcat_~s~0.base)_1, ULTIMATE.start_strlcat_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_strlcat_~s~0.base)_1 - 1*ULTIMATE.start_strlcat_~s~0.offset Supporting invariants [] [2019-10-22 09:00:40,420 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2019-10-22 09:00:40,422 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:00:40,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:40,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:40,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:40,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:40,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:00:40,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:40,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:40,473 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:00:40,474 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-10-22 09:00:40,489 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 35 states and 44 transitions. Complement of second has 4 states. [2019-10-22 09:00:40,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:40,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:40,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2019-10-22 09:00:40,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 9 letters. Loop has 4 letters. [2019-10-22 09:00:40,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:40,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 13 letters. Loop has 4 letters. [2019-10-22 09:00:40,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:40,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 9 letters. Loop has 8 letters. [2019-10-22 09:00:40,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:40,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2019-10-22 09:00:40,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:00:40,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 16 states and 20 transitions. [2019-10-22 09:00:40,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 09:00:40,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 09:00:40,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2019-10-22 09:00:40,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:40,494 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-10-22 09:00:40,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2019-10-22 09:00:40,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-22 09:00:40,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-22 09:00:40,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-10-22 09:00:40,498 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-10-22 09:00:40,498 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-10-22 09:00:40,498 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:00:40,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2019-10-22 09:00:40,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:00:40,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:40,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:40,499 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:40,499 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:40,501 INFO L791 eck$LassoCheckResult]: Stem: 373#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 371#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~ret19, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet15;havoc main_#t~nondet15; 372#L539 assume !(main_~in_len~0 < 1);call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet17;havoc main_#t~nondet17; 370#L543 assume !(main_~out_len~0 < 1);call main_#t~malloc18.base, main_#t~malloc18.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc18.base, main_#t~malloc18.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strlcat_#in~dst.base, strlcat_#in~dst.offset, strlcat_#in~src.base, strlcat_#in~src.offset, strlcat_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcat_#res;havoc strlcat_#t~post8.base, strlcat_#t~post8.offset, strlcat_#t~mem5, strlcat_#t~post6, strlcat_#t~short7, strlcat_#t~ret9, strlcat_#t~post11.base, strlcat_#t~post11.offset, strlcat_#t~mem12, strlcat_#t~post13, strlcat_#t~post14.base, strlcat_#t~post14.offset, strlcat_#t~mem10, strlcat_~dst.base, strlcat_~dst.offset, strlcat_~src.base, strlcat_~src.offset, strlcat_~siz, strlcat_~d~0.base, strlcat_~d~0.offset, strlcat_~s~0.base, strlcat_~s~0.offset, strlcat_~n~0, strlcat_~dlen~0;strlcat_~dst.base, strlcat_~dst.offset := strlcat_#in~dst.base, strlcat_#in~dst.offset;strlcat_~src.base, strlcat_~src.offset := strlcat_#in~src.base, strlcat_#in~src.offset;strlcat_~siz := strlcat_#in~siz;strlcat_~d~0.base, strlcat_~d~0.offset := strlcat_~dst.base, strlcat_~dst.offset;strlcat_~s~0.base, strlcat_~s~0.offset := strlcat_~src.base, strlcat_~src.offset;strlcat_~n~0 := strlcat_~siz;havoc strlcat_~dlen~0; 361#L521-5 call strlcat_#t~mem5 := read~int(strlcat_~d~0.base, strlcat_~d~0.offset, 1);strlcat_#t~short7 := 0 != strlcat_#t~mem5; 363#L521-1 assume !strlcat_#t~short7; 374#L521-3 assume !strlcat_#t~short7;havoc strlcat_#t~short7;havoc strlcat_#t~post6;havoc strlcat_#t~mem5; 367#L521-6 assume strlcat_~d~0.base == strlcat_~dst.base;strlcat_~dlen~0 := (if strlcat_~d~0.offset - strlcat_~dst.offset < 0 && 0 != (strlcat_~d~0.offset - strlcat_~dst.offset) % 1 then 1 + (strlcat_~d~0.offset - strlcat_~dst.offset) / 1 else (strlcat_~d~0.offset - strlcat_~dst.offset) / 1);strlcat_~n~0 := strlcat_~siz - strlcat_~dlen~0; 368#L525 assume 0 == strlcat_~n~0 % 4294967296;strlen_#in~s.base, strlen_#in~s.offset := strlcat_~s~0.base, strlcat_~s~0.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 369#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 365#L509-4 [2019-10-22 09:00:40,501 INFO L793 eck$LassoCheckResult]: Loop: 365#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 366#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 376#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 365#L509-4 [2019-10-22 09:00:40,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:40,501 INFO L82 PathProgramCache]: Analyzing trace with hash 765806520, now seen corresponding path program 1 times [2019-10-22 09:00:40,501 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:40,501 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521977227] [2019-10-22 09:00:40,502 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:40,502 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:40,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:40,547 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:40,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:40,549 INFO L82 PathProgramCache]: Analyzing trace with hash 73645, now seen corresponding path program 1 times [2019-10-22 09:00:40,549 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:40,549 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556303843] [2019-10-22 09:00:40,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:40,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:40,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:40,555 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:40,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:40,555 INFO L82 PathProgramCache]: Analyzing trace with hash -724195178, now seen corresponding path program 1 times [2019-10-22 09:00:40,557 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:40,557 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647835916] [2019-10-22 09:00:40,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:40,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:40,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:40,596 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:41,157 WARN L191 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 140 [2019-10-22 09:00:41,600 WARN L191 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 115 [2019-10-22 09:00:41,601 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:41,601 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:41,601 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:41,601 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:41,601 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:41,601 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:41,601 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:41,601 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:41,601 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcat.i_Iteration3_Lasso [2019-10-22 09:00:41,602 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:41,602 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:41,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:41,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:41,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:41,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:41,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:41,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:41,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:41,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:41,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:41,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:41,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:41,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:41,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:41,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:41,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:41,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:41,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:41,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:41,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:41,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:41,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:41,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:41,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:41,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:41,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:41,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:41,953 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 99 [2019-10-22 09:00:41,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:42,317 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-10-22 09:00:42,744 WARN L191 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-10-22 09:00:42,873 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:42,873 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:42,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-10-22 09:00:42,874 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,874 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:42,874 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,874 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,875 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:42,876 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:42,877 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:42,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:42,878 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,878 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:42,878 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:42,878 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,878 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,878 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:42,878 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:42,879 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:42,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-10-22 09:00:42,880 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,880 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:42,880 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:42,880 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,880 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,881 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:42,881 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:42,881 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:42,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-10-22 09:00:42,882 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,882 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:42,882 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:42,882 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,882 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,882 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:42,882 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:42,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:42,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:42,884 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,884 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:42,884 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:42,884 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,884 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,885 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:42,885 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:42,885 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:42,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:42,886 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,886 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:42,886 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:42,886 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,886 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,886 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:42,886 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:42,887 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:42,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:42,888 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,888 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:42,888 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:42,888 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,889 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,889 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:42,889 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:42,889 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:42,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:42,890 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,890 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:42,890 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,890 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,891 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:42,892 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:42,895 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:42,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:42,896 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,896 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:42,897 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:42,897 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,897 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,897 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:42,897 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:42,897 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:42,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:42,898 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,898 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:42,898 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:42,899 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,899 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,899 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:42,899 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:42,899 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:42,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:42,900 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,901 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:42,901 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:42,901 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,901 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,901 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:42,901 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:42,902 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:42,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:42,902 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,902 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:42,902 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,903 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,903 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:42,903 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:42,905 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:42,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:42,905 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,905 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:42,906 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:42,906 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,906 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,906 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:42,906 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:42,907 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:42,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:42,908 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,908 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:42,908 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:42,908 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,908 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,908 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:42,909 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:42,909 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:42,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:42,910 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,910 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:42,910 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:42,910 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,910 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,910 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:42,910 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:42,911 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:42,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:42,912 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,912 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:42,912 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:42,912 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,912 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,913 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:42,913 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:42,913 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:42,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:42,914 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,914 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:42,914 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:42,914 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,914 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,915 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:42,915 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:42,915 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:42,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:42,916 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,916 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:42,916 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:42,917 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,917 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,917 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:42,917 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:42,917 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:42,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:42,918 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,918 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:42,918 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:42,918 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,918 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,919 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:42,919 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:42,919 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:42,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:42,920 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,920 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:42,921 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:42,921 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,921 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,921 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:42,921 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:42,921 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:42,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:42,922 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,922 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:42,922 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:42,922 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,923 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,923 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:42,923 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:42,924 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:42,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:42,924 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,925 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:42,925 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:42,925 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,925 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,925 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:42,925 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:42,926 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:42,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:42,926 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,926 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:42,926 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:42,927 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,927 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,927 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:42,927 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:42,928 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:42,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:42,928 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,929 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:42,929 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:42,929 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,929 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,929 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:42,929 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:42,930 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:42,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:42,930 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,930 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:42,930 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:42,931 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,931 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,931 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:42,931 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:42,932 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:42,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:42,933 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,933 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:42,933 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,933 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,933 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:42,934 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:42,935 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:42,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:42,935 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,936 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:42,936 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,936 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,937 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:42,937 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:42,938 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:42,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:42,939 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,939 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:42,939 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,939 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,940 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:42,941 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:42,945 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:42,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:42,946 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,946 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 09:00:42,946 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,946 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,950 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:00:42,950 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:42,970 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:42,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:42,970 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,970 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:42,971 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,971 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,971 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:42,972 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:42,973 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:42,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:42,973 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:42,973 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:42,973 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:42,974 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:42,977 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:42,977 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:42,999 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:43,023 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 09:00:43,023 INFO L444 ModelExtractionUtils]: 54 out of 61 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 09:00:43,024 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:43,025 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:43,025 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:43,025 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlen_~s.offset, v_rep(select #length ULTIMATE.start_strlen_~s.base)_1) = -1*ULTIMATE.start_strlen_~s.offset + 1*v_rep(select #length ULTIMATE.start_strlen_~s.base)_1 Supporting invariants [] [2019-10-22 09:00:43,063 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2019-10-22 09:00:43,064 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:00:43,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:43,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:43,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:43,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:00:43,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:43,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:43,111 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:00:43,111 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-10-22 09:00:43,118 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 19 states and 24 transitions. Complement of second has 4 states. [2019-10-22 09:00:43,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:43,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:43,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-10-22 09:00:43,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 3 letters. [2019-10-22 09:00:43,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:43,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 13 letters. Loop has 3 letters. [2019-10-22 09:00:43,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:43,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2019-10-22 09:00:43,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:43,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2019-10-22 09:00:43,120 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:43,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2019-10-22 09:00:43,121 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:00:43,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:00:43,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:00:43,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:43,121 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:43,121 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:43,121 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:43,121 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:00:43,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:00:43,121 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:43,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:00:43,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:00:43 BoogieIcfgContainer [2019-10-22 09:00:43,127 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:00:43,128 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:00:43,128 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:00:43,128 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:00:43,128 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:35" (3/4) ... [2019-10-22 09:00:43,131 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:00:43,132 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:00:43,133 INFO L168 Benchmark]: Toolchain (without parser) took 8958.09 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 226.5 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -169.1 MB). Peak memory consumption was 57.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:43,133 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:43,134 INFO L168 Benchmark]: CACSL2BoogieTranslator took 468.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -183.0 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:43,134 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:43,135 INFO L168 Benchmark]: Boogie Preprocessor took 26.56 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:43,135 INFO L168 Benchmark]: RCFGBuilder took 455.73 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-10-22 09:00:43,136 INFO L168 Benchmark]: BuchiAutomizer took 7949.27 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 89.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -15.2 MB). Peak memory consumption was 73.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:43,136 INFO L168 Benchmark]: Witness Printer took 3.95 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:43,138 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 468.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -183.0 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.56 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 455.73 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 7949.27 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 89.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -15.2 MB). Peak memory consumption was 73.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.95 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * d + unknown-#length-unknown[d] and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 7.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 59 SDtfs, 89 SDslu, 27 SDs, 0 SdLazy, 21 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital234 mio100 ax100 hnf99 lsp95 ukn83 mio100 lsp44 div189 bol100 ite100 ukn100 eq163 hnf64 smp93 dnf207 smp97 tf100 neg97 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 11 VariablesLoop: 7 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...