./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-dietlibc/strstr.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-dietlibc/strstr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 4f0de1cabcaa1e7c1b5012604e9626b39d1f0fa44ba0399b8bd31764898831fc --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 23:04:21,742 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 23:04:21,768 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 23:04:21,820 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 23:04:21,820 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 23:04:21,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 23:04:21,824 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 23:04:21,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 23:04:21,828 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 23:04:21,832 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 23:04:21,833 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 23:04:21,833 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 23:04:21,833 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 23:04:21,834 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 23:04:21,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 23:04:21,835 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 23:04:21,836 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 23:04:21,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 23:04:21,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 23:04:21,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 23:04:21,842 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 23:04:21,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 23:04:21,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 23:04:21,848 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 23:04:21,852 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 23:04:21,855 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 23:04:21,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 23:04:21,856 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 23:04:21,857 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 23:04:21,858 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 23:04:21,858 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 23:04:21,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 23:04:21,859 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 23:04:21,860 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 23:04:21,861 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 23:04:21,862 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 23:04:21,863 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 23:04:21,863 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 23:04:21,863 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 23:04:21,864 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 23:04:21,864 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 23:04:21,865 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-14 23:04:21,892 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 23:04:21,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 23:04:21,893 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 23:04:21,893 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 23:04:21,894 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 23:04:21,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 23:04:21,894 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 23:04:21,895 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-14 23:04:21,895 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-14 23:04:21,895 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-14 23:04:21,896 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-14 23:04:21,896 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-14 23:04:21,896 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-14 23:04:21,896 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 23:04:21,897 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 23:04:21,897 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 23:04:21,897 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 23:04:21,897 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-14 23:04:21,897 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-14 23:04:21,897 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-14 23:04:21,898 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 23:04:21,898 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-14 23:04:21,898 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 23:04:21,898 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-14 23:04:21,899 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 23:04:21,900 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 23:04:21,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 23:04:21,900 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 23:04:21,900 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 23:04:21,901 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-14 23:04:21,901 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 4f0de1cabcaa1e7c1b5012604e9626b39d1f0fa44ba0399b8bd31764898831fc [2021-12-14 23:04:22,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 23:04:22,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 23:04:22,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 23:04:22,125 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 23:04:22,126 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 23:04:22,126 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strstr.i [2021-12-14 23:04:22,189 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f16e1764/5089c0c7404d4a8dbe3dbaae5485026c/FLAGc25094d04 [2021-12-14 23:04:22,583 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 23:04:22,584 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strstr.i [2021-12-14 23:04:22,592 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f16e1764/5089c0c7404d4a8dbe3dbaae5485026c/FLAGc25094d04 [2021-12-14 23:04:22,604 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f16e1764/5089c0c7404d4a8dbe3dbaae5485026c [2021-12-14 23:04:22,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 23:04:22,608 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 23:04:22,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 23:04:22,609 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 23:04:22,612 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 23:04:22,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:04:22" (1/1) ... [2021-12-14 23:04:22,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2863414a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:04:22, skipping insertion in model container [2021-12-14 23:04:22,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:04:22" (1/1) ... [2021-12-14 23:04:22,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 23:04:22,645 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 23:04:22,907 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:04:22,912 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 23:04:22,942 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:04:22,962 INFO L208 MainTranslator]: Completed translation [2021-12-14 23:04:22,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:04:22 WrapperNode [2021-12-14 23:04:22,962 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 23:04:22,963 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 23:04:22,963 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 23:04:22,964 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 23:04:22,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:04:22" (1/1) ... [2021-12-14 23:04:22,984 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:04:22" (1/1) ... [2021-12-14 23:04:23,026 INFO L137 Inliner]: procedures = 116, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 177 [2021-12-14 23:04:23,027 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 23:04:23,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 23:04:23,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 23:04:23,028 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 23:04:23,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:04:22" (1/1) ... [2021-12-14 23:04:23,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:04:22" (1/1) ... [2021-12-14 23:04:23,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:04:22" (1/1) ... [2021-12-14 23:04:23,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:04:22" (1/1) ... [2021-12-14 23:04:23,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:04:22" (1/1) ... [2021-12-14 23:04:23,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:04:22" (1/1) ... [2021-12-14 23:04:23,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:04:22" (1/1) ... [2021-12-14 23:04:23,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 23:04:23,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 23:04:23,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 23:04:23,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 23:04:23,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:04:22" (1/1) ... [2021-12-14 23:04:23,110 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:23,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:23,135 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:23,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-14 23:04:23,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 23:04:23,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 23:04:23,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 23:04:23,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 23:04:23,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 23:04:23,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 23:04:23,280 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 23:04:23,281 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 23:04:23,482 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 23:04:23,488 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 23:04:23,488 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-14 23:04:23,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:04:23 BoogieIcfgContainer [2021-12-14 23:04:23,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 23:04:23,490 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-14 23:04:23,491 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-14 23:04:23,497 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-14 23:04:23,497 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:04:23,497 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.12 11:04:22" (1/3) ... [2021-12-14 23:04:23,499 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ffefb06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:04:23, skipping insertion in model container [2021-12-14 23:04:23,499 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:04:23,499 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:04:22" (2/3) ... [2021-12-14 23:04:23,499 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ffefb06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:04:23, skipping insertion in model container [2021-12-14 23:04:23,499 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:04:23,500 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:04:23" (3/3) ... [2021-12-14 23:04:23,501 INFO L388 chiAutomizerObserver]: Analyzing ICFG strstr.i [2021-12-14 23:04:23,546 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-14 23:04:23,546 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-14 23:04:23,546 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-14 23:04:23,546 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-14 23:04:23,546 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-14 23:04:23,547 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-14 23:04:23,547 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-14 23:04:23,547 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-14 23:04:23,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 39 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:23,578 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 19 [2021-12-14 23:04:23,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:04:23,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:04:23,582 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-12-14 23:04:23,582 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:04:23,582 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-14 23:04:23,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 39 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:23,585 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 19 [2021-12-14 23:04:23,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:04:23,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:04:23,585 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-12-14 23:04:23,586 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:04:23,590 INFO L791 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 12#L542true assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 4#L544-3true [2021-12-14 23:04:23,591 INFO L793 eck$LassoCheckResult]: Loop: 4#L544-3true assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 5#L544-2true main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4#L544-3true [2021-12-14 23:04:23,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:23,595 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2021-12-14 23:04:23,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:23,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066479722] [2021-12-14 23:04:23,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:23,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:23,698 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:23,734 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:23,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:23,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2021-12-14 23:04:23,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:23,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571599241] [2021-12-14 23:04:23,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:23,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:23,755 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:23,772 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:23,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:23,774 INFO L85 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2021-12-14 23:04:23,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:23,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726072244] [2021-12-14 23:04:23,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:23,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:23,808 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:23,836 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:24,088 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:04:24,089 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:04:24,089 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:04:24,089 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:04:24,089 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:04:24,089 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:24,090 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:04:24,090 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:04:24,091 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration1_Lasso [2021-12-14 23:04:24,091 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:04:24,091 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:04:24,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:24,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:24,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:24,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:24,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:24,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:24,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:24,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:24,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:24,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:24,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:24,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:24,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:24,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:24,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:24,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:24,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:24,424 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:04:24,428 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:04:24,429 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:24,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:24,435 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:24,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-14 23:04:24,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:24,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:24,460 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:24,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:24,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:24,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:24,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:24,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:24,479 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:24,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-12-14 23:04:24,501 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:24,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:24,503 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:24,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-14 23:04:24,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:24,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:24,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:24,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:24,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:24,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:24,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:24,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:24,530 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:24,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:24,548 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:24,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:24,552 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:24,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-14 23:04:24,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:24,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:24,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:24,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:24,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:24,568 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:24,568 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:24,584 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:24,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:24,599 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:24,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:24,600 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:24,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-14 23:04:24,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:24,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:24,609 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:24,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:24,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:24,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:24,610 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:24,610 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:24,621 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:24,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:24,645 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:24,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:24,646 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:24,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-14 23:04:24,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:24,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:24,655 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:24,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:24,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:24,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:24,656 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:24,656 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:24,666 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:24,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2021-12-14 23:04:24,690 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:24,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:24,691 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:24,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-14 23:04:24,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:24,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:24,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:24,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:24,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:24,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:24,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:24,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:24,701 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:24,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:24,720 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:24,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:24,721 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:24,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-14 23:04:24,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:24,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:24,730 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:24,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:24,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:24,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:24,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:24,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:24,735 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:24,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:24,750 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:24,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:24,751 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:24,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-14 23:04:24,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:24,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:24,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:24,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:24,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:24,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:24,762 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:24,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:24,776 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:24,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:24,792 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:24,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:24,793 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:24,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-14 23:04:24,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:24,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:24,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:24,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:24,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:24,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:24,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:24,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:24,810 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:24,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:24,827 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:24,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:24,828 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:24,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-14 23:04:24,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:24,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:24,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:24,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:24,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:24,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:24,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:24,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:24,837 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:24,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:24,853 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:24,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:24,854 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:24,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-14 23:04:24,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:24,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:24,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:24,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:24,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:24,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:24,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:24,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:24,895 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:24,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:24,916 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:24,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:24,917 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:24,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-14 23:04:24,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:24,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:24,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:24,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:24,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:24,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:24,926 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:24,926 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:24,928 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:24,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:24,946 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:24,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:24,947 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:24,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-14 23:04:24,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:24,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:24,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:24,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:24,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:24,958 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:24,959 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:24,970 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:24,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:24,986 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:24,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:24,987 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:24,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:25,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:25,000 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:25,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:25,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:25,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:25,001 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:25,001 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:25,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-12-14 23:04:25,013 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:25,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:25,037 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:25,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:25,038 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:25,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:25,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:25,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:25,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:25,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:25,062 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:25,062 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:25,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-14 23:04:25,075 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:25,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:25,093 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:25,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:25,094 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:25,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-12-14 23:04:25,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:25,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:25,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:25,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:25,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:25,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:25,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:25,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:25,123 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:25,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2021-12-14 23:04:25,140 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:25,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:25,141 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:25,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-12-14 23:04:25,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:25,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:25,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:25,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:25,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:25,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:25,155 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:25,175 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:25,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:25,191 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:25,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:25,192 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:25,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-12-14 23:04:25,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:25,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:25,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:25,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:25,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:25,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:25,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:25,220 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:04:25,276 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-12-14 23:04:25,277 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2021-12-14 23:04:25,278 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:25,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:25,292 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:25,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-12-14 23:04:25,360 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:04:25,372 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-14 23:04:25,372 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:04:25,373 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_~in_len~0#1) = -1*ULTIMATE.start_main_~i~2#1 + 1*ULTIMATE.start_main_~in_len~0#1 Supporting invariants [] [2021-12-14 23:04:25,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:25,407 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2021-12-14 23:04:25,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:25,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 23:04:25,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:04:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:25,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 23:04:25,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:04:25,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:04:25,504 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 [2021-12-14 23:04:25,506 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 39 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:25,560 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 39 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 112 states and 165 transitions. Complement of second has 7 states. [2021-12-14 23:04:25,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-14 23:04:25,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:25,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2021-12-14 23:04:25,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 112 transitions. Stem has 3 letters. Loop has 2 letters. [2021-12-14 23:04:25,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:04:25,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 112 transitions. Stem has 5 letters. Loop has 2 letters. [2021-12-14 23:04:25,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:04:25,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 112 transitions. Stem has 3 letters. Loop has 4 letters. [2021-12-14 23:04:25,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:04:25,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 165 transitions. [2021-12-14 23:04:25,581 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2021-12-14 23:04:25,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 34 states and 44 transitions. [2021-12-14 23:04:25,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2021-12-14 23:04:25,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2021-12-14 23:04:25,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2021-12-14 23:04:25,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:04:25,586 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2021-12-14 23:04:25,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2021-12-14 23:04:25,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-12-14 23:04:25,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:25,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2021-12-14 23:04:25,602 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2021-12-14 23:04:25,602 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2021-12-14 23:04:25,602 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-14 23:04:25,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2021-12-14 23:04:25,605 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2021-12-14 23:04:25,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:04:25,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:04:25,606 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-14 23:04:25,606 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:04:25,606 INFO L791 eck$LassoCheckResult]: Stem: 235#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 216#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 217#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 205#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 206#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 215#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 209#L552-3 [2021-12-14 23:04:25,606 INFO L793 eck$LassoCheckResult]: Loop: 209#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 211#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 209#L552-3 [2021-12-14 23:04:25,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:25,607 INFO L85 PathProgramCache]: Analyzing trace with hash 889572430, now seen corresponding path program 1 times [2021-12-14 23:04:25,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:25,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908997128] [2021-12-14 23:04:25,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:25,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:25,619 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:25,630 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:25,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:25,631 INFO L85 PathProgramCache]: Analyzing trace with hash 2051, now seen corresponding path program 1 times [2021-12-14 23:04:25,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:25,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617950471] [2021-12-14 23:04:25,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:25,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:25,636 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:25,639 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:25,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:25,640 INFO L85 PathProgramCache]: Analyzing trace with hash 180614416, now seen corresponding path program 1 times [2021-12-14 23:04:25,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:25,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458262748] [2021-12-14 23:04:25,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:25,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:25,654 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:25,680 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:25,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:26,047 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:04:26,047 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:04:26,047 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:04:26,047 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:04:26,047 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:04:26,047 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:26,047 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:04:26,048 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:04:26,048 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration2_Lasso [2021-12-14 23:04:26,048 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:04:26,048 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:04:26,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:26,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:26,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:26,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:26,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:26,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:26,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:26,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:26,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:26,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:26,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:26,454 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:04:26,454 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:04:26,454 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:26,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:26,460 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:26,468 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:26,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:26,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-12-14 23:04:26,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:26,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:26,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:26,477 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:26,478 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:26,492 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:26,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:26,515 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:26,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:26,516 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:26,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-12-14 23:04:26,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:26,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:26,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:26,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:26,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:26,528 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:26,528 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:26,543 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:26,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:26,567 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:26,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:26,568 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:26,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:26,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:26,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:26,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:26,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:26,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:26,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-12-14 23:04:26,587 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:26,587 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:26,597 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:26,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:26,611 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:26,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:26,613 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:26,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-12-14 23:04:26,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:26,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:26,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:26,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:26,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:26,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:26,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:26,643 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:04:26,671 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2021-12-14 23:04:26,672 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2021-12-14 23:04:26,672 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:26,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:26,676 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:26,683 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:04:26,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-12-14 23:04:26,698 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-14 23:04:26,698 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:04:26,698 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~out_len~0#1, ULTIMATE.start_main_~i~3#1) = 1*ULTIMATE.start_main_~out_len~0#1 - 1*ULTIMATE.start_main_~i~3#1 Supporting invariants [] [2021-12-14 23:04:26,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:26,728 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2021-12-14 23:04:26,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:26,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 23:04:26,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:04:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:26,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 23:04:26,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:04:26,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:04:26,784 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 [2021-12-14 23:04:26,785 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 44 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:26,810 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 44 transitions. cyclomatic complexity: 15. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 60 states and 81 transitions. Complement of second has 6 states. [2021-12-14 23:04:26,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-14 23:04:26,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:26,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2021-12-14 23:04:26,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 6 letters. Loop has 2 letters. [2021-12-14 23:04:26,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:04:26,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 8 letters. Loop has 2 letters. [2021-12-14 23:04:26,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:04:26,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 6 letters. Loop has 4 letters. [2021-12-14 23:04:26,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:04:26,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 81 transitions. [2021-12-14 23:04:26,819 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2021-12-14 23:04:26,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 35 states and 46 transitions. [2021-12-14 23:04:26,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2021-12-14 23:04:26,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2021-12-14 23:04:26,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 46 transitions. [2021-12-14 23:04:26,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:04:26,820 INFO L681 BuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2021-12-14 23:04:26,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 46 transitions. [2021-12-14 23:04:26,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-12-14 23:04:26,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 34 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:26,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2021-12-14 23:04:26,828 INFO L704 BuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2021-12-14 23:04:26,828 INFO L587 BuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2021-12-14 23:04:26,828 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-14 23:04:26,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 46 transitions. [2021-12-14 23:04:26,828 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2021-12-14 23:04:26,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:04:26,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:04:26,830 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:04:26,830 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:04:26,830 INFO L791 eck$LassoCheckResult]: Stem: 413#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 396#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 397#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 382#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 383#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 393#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 386#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 387#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 390#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 398#L510-4 [2021-12-14 23:04:26,830 INFO L793 eck$LassoCheckResult]: Loop: 398#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 399#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 407#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 398#L510-4 [2021-12-14 23:04:26,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:26,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1304077847, now seen corresponding path program 1 times [2021-12-14 23:04:26,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:26,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545642858] [2021-12-14 23:04:26,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:26,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:26,859 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:26,876 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:26,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:26,877 INFO L85 PathProgramCache]: Analyzing trace with hash 78610, now seen corresponding path program 1 times [2021-12-14 23:04:26,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:26,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121989501] [2021-12-14 23:04:26,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:26,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:26,882 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:26,885 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:26,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:26,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1803996476, now seen corresponding path program 1 times [2021-12-14 23:04:26,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:26,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120450151] [2021-12-14 23:04:26,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:26,886 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:27,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:04:27,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:04:27,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120450151] [2021-12-14 23:04:27,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120450151] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:04:27,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:04:27,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 23:04:27,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513771181] [2021-12-14 23:04:27,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:04:27,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:04:27,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 23:04:27,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 23:04:27,068 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. cyclomatic complexity: 16 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:27,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:04:27,199 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2021-12-14 23:04:27,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 23:04:27,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 76 transitions. [2021-12-14 23:04:27,201 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 27 [2021-12-14 23:04:27,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 76 transitions. [2021-12-14 23:04:27,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2021-12-14 23:04:27,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2021-12-14 23:04:27,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 76 transitions. [2021-12-14 23:04:27,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:04:27,203 INFO L681 BuchiCegarLoop]: Abstraction has 59 states and 76 transitions. [2021-12-14 23:04:27,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 76 transitions. [2021-12-14 23:04:27,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2021-12-14 23:04:27,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:27,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2021-12-14 23:04:27,205 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2021-12-14 23:04:27,206 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2021-12-14 23:04:27,206 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-14 23:04:27,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2021-12-14 23:04:27,206 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2021-12-14 23:04:27,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:04:27,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:04:27,207 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:04:27,207 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:04:27,207 INFO L791 eck$LassoCheckResult]: Stem: 525#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 506#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 507#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 493#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 494#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 505#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 497#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 498#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 531#L509 assume strlen_~s#1.base == 0 && strlen_~s#1.offset == 0;strlen_#res#1 := 0; 503#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 504#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 513#L510-10 [2021-12-14 23:04:27,209 INFO L793 eck$LassoCheckResult]: Loop: 513#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 514#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 516#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 513#L510-10 [2021-12-14 23:04:27,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:27,209 INFO L85 PathProgramCache]: Analyzing trace with hash -911639398, now seen corresponding path program 1 times [2021-12-14 23:04:27,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:27,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246152583] [2021-12-14 23:04:27,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:27,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:27,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:04:27,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:04:27,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246152583] [2021-12-14 23:04:27,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246152583] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:04:27,259 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:04:27,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 23:04:27,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145762495] [2021-12-14 23:04:27,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:04:27,260 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:04:27,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:27,261 INFO L85 PathProgramCache]: Analyzing trace with hash 100456, now seen corresponding path program 1 times [2021-12-14 23:04:27,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:27,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581877245] [2021-12-14 23:04:27,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:27,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:27,270 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:27,278 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:27,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:04:27,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 23:04:27,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 23:04:27,319 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. cyclomatic complexity: 17 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:27,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:04:27,337 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2021-12-14 23:04:27,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 23:04:27,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2021-12-14 23:04:27,338 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2021-12-14 23:04:27,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 49 transitions. [2021-12-14 23:04:27,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2021-12-14 23:04:27,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2021-12-14 23:04:27,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2021-12-14 23:04:27,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:04:27,340 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2021-12-14 23:04:27,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2021-12-14 23:04:27,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-12-14 23:04:27,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 38 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:27,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2021-12-14 23:04:27,343 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2021-12-14 23:04:27,343 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2021-12-14 23:04:27,343 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-14 23:04:27,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 49 transitions. [2021-12-14 23:04:27,343 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2021-12-14 23:04:27,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:04:27,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:04:27,344 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:04:27,344 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:04:27,344 INFO L791 eck$LassoCheckResult]: Stem: 612#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 593#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 594#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 580#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 581#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 592#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 584#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 586#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 587#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 588#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 589#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 597#L510-4 [2021-12-14 23:04:27,345 INFO L793 eck$LassoCheckResult]: Loop: 597#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 598#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 606#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 597#L510-4 [2021-12-14 23:04:27,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:27,345 INFO L85 PathProgramCache]: Analyzing trace with hash -909922795, now seen corresponding path program 1 times [2021-12-14 23:04:27,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:27,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750357883] [2021-12-14 23:04:27,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:27,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:27,376 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:27,392 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:27,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:27,396 INFO L85 PathProgramCache]: Analyzing trace with hash 78610, now seen corresponding path program 2 times [2021-12-14 23:04:27,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:27,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120170075] [2021-12-14 23:04:27,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:27,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:27,400 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:27,406 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:27,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:27,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1971331970, now seen corresponding path program 1 times [2021-12-14 23:04:27,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:27,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329268442] [2021-12-14 23:04:27,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:27,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:27,427 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:27,439 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:27,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:28,095 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:04:28,095 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:04:28,095 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:04:28,095 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:04:28,095 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:04:28,095 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:28,095 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:04:28,095 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:04:28,095 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration5_Lasso [2021-12-14 23:04:28,095 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:04:28,096 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:04:28,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:28,906 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:04:28,907 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:04:28,907 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:28,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:28,912 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:28,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-12-14 23:04:28,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:28,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:28,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:28,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:28,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:28,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:28,920 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:28,920 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:28,921 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:28,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-12-14 23:04:28,936 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:28,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:28,937 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:28,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-12-14 23:04:28,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:28,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:28,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:28,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:28,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:28,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:28,947 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:28,947 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:28,948 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:28,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2021-12-14 23:04:28,963 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:28,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:28,964 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:28,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-12-14 23:04:28,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:28,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:28,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:28,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:28,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:28,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:28,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:28,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:28,974 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:28,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2021-12-14 23:04:28,988 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:28,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:28,989 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:28,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-12-14 23:04:28,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:28,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:28,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:28,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:28,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:28,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:28,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:28,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:28,998 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:29,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2021-12-14 23:04:29,013 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:29,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:29,014 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:29,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-12-14 23:04:29,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:29,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:29,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:29,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:29,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:29,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:29,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:29,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:29,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:29,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:29,037 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:29,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:29,038 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:29,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-12-14 23:04:29,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:29,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:29,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:29,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:29,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:29,054 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:29,055 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:29,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:29,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:29,102 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:29,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:29,103 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:29,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:29,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:29,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:29,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:29,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:29,116 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:29,116 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:29,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-12-14 23:04:29,127 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:29,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:29,150 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:29,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:29,152 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:29,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:29,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:29,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:29,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:29,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:29,169 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:29,169 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:29,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-12-14 23:04:29,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:29,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2021-12-14 23:04:29,200 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:29,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:29,200 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:29,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-12-14 23:04:29,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:29,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:29,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:29,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:29,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:29,209 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:29,209 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:29,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:29,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:29,233 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:29,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:29,234 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:29,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-12-14 23:04:29,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:29,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:29,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:29,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:29,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:29,243 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:29,244 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:29,253 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:29,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:29,276 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:29,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:29,276 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:29,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-12-14 23:04:29,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:29,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:29,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:29,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:29,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:29,289 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:29,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:29,299 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:29,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2021-12-14 23:04:29,314 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:29,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:29,315 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:29,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-12-14 23:04:29,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:29,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:29,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:29,322 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-14 23:04:29,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:29,327 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2021-12-14 23:04:29,327 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2021-12-14 23:04:29,355 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:29,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:29,377 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:29,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:29,378 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:29,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-12-14 23:04:29,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:29,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:29,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:29,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:29,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:29,398 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:29,398 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:29,419 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:04:29,455 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-12-14 23:04:29,455 INFO L444 ModelExtractionUtils]: 12 out of 55 variables were initially zero. Simplification set additionally 40 variables to zero. [2021-12-14 23:04:29,455 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:29,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:29,460 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:29,468 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:04:29,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-12-14 23:04:29,490 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-14 23:04:29,490 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:04:29,490 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc24#1.base)_2, ULTIMATE.start_strlen_~s#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc24#1.base)_2 - 1*ULTIMATE.start_strlen_~s#1.offset Supporting invariants [] [2021-12-14 23:04:29,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:29,540 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2021-12-14 23:04:29,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:29,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 23:04:29,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:04:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:29,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 23:04:29,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:04:29,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:04:29,667 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2021-12-14 23:04:29,668 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 49 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:29,709 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 49 transitions. cyclomatic complexity: 15. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 45 states and 57 transitions. Complement of second has 7 states. [2021-12-14 23:04:29,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-14 23:04:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:29,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2021-12-14 23:04:29,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 3 letters. [2021-12-14 23:04:29,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:04:29,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 14 letters. Loop has 3 letters. [2021-12-14 23:04:29,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:04:29,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 6 letters. [2021-12-14 23:04:29,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:04:29,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 57 transitions. [2021-12-14 23:04:29,712 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2021-12-14 23:04:29,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 41 states and 52 transitions. [2021-12-14 23:04:29,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2021-12-14 23:04:29,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2021-12-14 23:04:29,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 52 transitions. [2021-12-14 23:04:29,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:04:29,713 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2021-12-14 23:04:29,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 52 transitions. [2021-12-14 23:04:29,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2021-12-14 23:04:29,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.275) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:29,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2021-12-14 23:04:29,715 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 51 transitions. [2021-12-14 23:04:29,715 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 51 transitions. [2021-12-14 23:04:29,715 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-14 23:04:29,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 51 transitions. [2021-12-14 23:04:29,716 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2021-12-14 23:04:29,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:04:29,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:04:29,716 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:04:29,716 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:04:29,716 INFO L791 eck$LassoCheckResult]: Stem: 820#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 801#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 802#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 786#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 787#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 798#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 790#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 791#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 795#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 803#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 804#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 822#L510-5 strlen_#res#1 := strlen_~i~0#1; 796#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 797#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 808#L510-10 [2021-12-14 23:04:29,716 INFO L793 eck$LassoCheckResult]: Loop: 808#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 809#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 811#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 808#L510-10 [2021-12-14 23:04:29,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:29,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1526227897, now seen corresponding path program 1 times [2021-12-14 23:04:29,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:29,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548369214] [2021-12-14 23:04:29,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:29,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:29,727 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:29,737 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:29,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:29,737 INFO L85 PathProgramCache]: Analyzing trace with hash 100456, now seen corresponding path program 2 times [2021-12-14 23:04:29,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:29,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191798614] [2021-12-14 23:04:29,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:29,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:29,740 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:29,743 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:29,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:29,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1331413406, now seen corresponding path program 1 times [2021-12-14 23:04:29,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:29,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468660157] [2021-12-14 23:04:29,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:29,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:29,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:04:29,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:04:29,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468660157] [2021-12-14 23:04:29,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468660157] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:04:29,870 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:04:29,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 23:04:29,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784783273] [2021-12-14 23:04:29,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:04:29,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:04:29,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 23:04:29,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-14 23:04:29,914 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. cyclomatic complexity: 16 Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:30,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:30,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:04:30,103 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2021-12-14 23:04:30,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 23:04:30,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 104 transitions. [2021-12-14 23:04:30,105 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2021-12-14 23:04:30,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 82 states and 104 transitions. [2021-12-14 23:04:30,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2021-12-14 23:04:30,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2021-12-14 23:04:30,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 104 transitions. [2021-12-14 23:04:30,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:04:30,107 INFO L681 BuchiCegarLoop]: Abstraction has 82 states and 104 transitions. [2021-12-14 23:04:30,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 104 transitions. [2021-12-14 23:04:30,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 60. [2021-12-14 23:04:30,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 59 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:30,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2021-12-14 23:04:30,110 INFO L704 BuchiCegarLoop]: Abstraction has 60 states and 76 transitions. [2021-12-14 23:04:30,110 INFO L587 BuchiCegarLoop]: Abstraction has 60 states and 76 transitions. [2021-12-14 23:04:30,111 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-14 23:04:30,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 76 transitions. [2021-12-14 23:04:30,111 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2021-12-14 23:04:30,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:04:30,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:04:30,112 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:04:30,112 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:04:30,112 INFO L791 eck$LassoCheckResult]: Stem: 969#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 950#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 951#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 934#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 936#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 937#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 938#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 993#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 991#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 992#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 983#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 979#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 972#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 973#L510-5 strlen_#res#1 := strlen_~i~0#1; 945#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 946#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 957#L510-10 [2021-12-14 23:04:30,112 INFO L793 eck$LassoCheckResult]: Loop: 957#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 958#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 971#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 957#L510-10 [2021-12-14 23:04:30,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:30,113 INFO L85 PathProgramCache]: Analyzing trace with hash -432721371, now seen corresponding path program 1 times [2021-12-14 23:04:30,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:30,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955806569] [2021-12-14 23:04:30,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:30,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:30,125 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:30,135 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:30,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:30,136 INFO L85 PathProgramCache]: Analyzing trace with hash 100456, now seen corresponding path program 3 times [2021-12-14 23:04:30,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:30,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052288170] [2021-12-14 23:04:30,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:30,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:30,139 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:30,142 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:30,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:30,142 INFO L85 PathProgramCache]: Analyzing trace with hash -2005437500, now seen corresponding path program 1 times [2021-12-14 23:04:30,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:30,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642621860] [2021-12-14 23:04:30,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:30,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:30,153 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:30,164 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:30,988 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:04:30,988 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:04:30,988 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:04:30,988 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:04:30,988 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:04:30,988 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:30,988 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:04:30,988 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:04:30,988 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration7_Lasso [2021-12-14 23:04:30,988 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:04:30,988 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:04:30,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:30,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:30,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:30,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:31,770 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:04:31,771 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:04:31,771 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:31,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:31,784 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:31,794 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:31,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-12-14 23:04:31,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:31,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:31,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:31,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:31,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:31,801 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:31,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:31,802 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:31,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2021-12-14 23:04:31,818 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:31,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:31,819 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:31,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:31,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:31,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:31,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:31,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:31,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:31,840 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:31,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:31,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-12-14 23:04:31,851 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:31,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:31,876 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:31,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:31,877 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:31,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-12-14 23:04:31,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:31,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:31,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:31,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:31,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:31,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:31,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:31,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:31,891 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:31,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:31,906 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:31,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:31,907 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:31,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-12-14 23:04:31,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:31,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:31,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:31,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:31,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:31,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:31,916 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:31,916 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:31,917 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:31,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:31,932 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:31,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:31,933 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:31,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-12-14 23:04:31,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:31,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:31,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:31,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:31,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:31,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:31,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:31,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:31,943 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:31,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2021-12-14 23:04:31,958 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:31,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:31,959 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:31,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-12-14 23:04:31,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:31,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:31,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:31,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:31,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:31,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:31,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:31,970 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:31,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2021-12-14 23:04:31,987 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:31,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:31,988 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:31,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-12-14 23:04:31,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:31,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:31,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:31,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:31,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:31,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:31,996 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:31,996 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:31,997 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:32,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2021-12-14 23:04:32,013 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:32,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:32,013 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:32,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-12-14 23:04:32,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:32,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:32,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:32,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:32,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:32,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:32,025 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:32,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:32,026 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:32,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:32,041 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:32,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:32,042 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:32,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-12-14 23:04:32,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:32,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:32,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:32,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:32,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:32,051 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:32,051 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:32,053 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:32,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2021-12-14 23:04:32,068 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:32,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:32,069 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:32,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-12-14 23:04:32,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:32,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:32,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:32,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:32,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:32,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:32,077 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:32,077 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:32,078 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:32,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2021-12-14 23:04:32,093 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:32,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:32,094 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:32,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-12-14 23:04:32,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:32,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:32,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:32,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:32,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:32,105 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:32,105 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:32,107 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:32,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2021-12-14 23:04:32,122 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:32,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:32,123 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:32,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-12-14 23:04:32,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:32,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:32,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:32,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:32,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:32,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:32,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:32,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:32,141 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:32,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2021-12-14 23:04:32,156 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:32,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:32,158 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:32,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-12-14 23:04:32,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:32,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:32,166 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:32,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:32,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:32,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:32,167 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:32,167 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:32,167 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:32,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2021-12-14 23:04:32,183 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:32,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:32,184 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:32,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-12-14 23:04:32,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:32,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:32,192 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:32,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:32,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:32,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:32,193 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:32,193 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:32,193 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:32,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2021-12-14 23:04:32,208 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:32,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:32,209 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:32,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-12-14 23:04:32,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:32,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:32,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:32,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:32,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:32,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:32,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:32,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:32,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:32,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:32,234 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:32,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:32,235 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:32,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2021-12-14 23:04:32,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:32,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:32,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:32,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:32,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:32,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:32,244 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:32,244 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:32,245 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:32,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:32,260 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:32,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:32,261 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:32,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2021-12-14 23:04:32,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:32,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:32,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:32,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:32,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:32,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:32,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:32,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:32,271 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:32,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2021-12-14 23:04:32,286 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:32,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:32,287 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:32,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2021-12-14 23:04:32,289 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:32,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:32,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:32,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:32,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:32,296 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:32,296 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:32,298 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:32,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2021-12-14 23:04:32,313 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:32,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:32,314 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:32,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2021-12-14 23:04:32,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:32,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:32,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:32,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:32,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:32,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:32,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:32,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:32,324 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:32,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2021-12-14 23:04:32,339 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:32,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:32,340 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:32,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2021-12-14 23:04:32,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:32,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:32,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:32,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:32,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:32,349 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:32,349 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:32,359 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:32,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2021-12-14 23:04:32,378 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:32,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:32,379 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:32,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2021-12-14 23:04:32,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:32,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:32,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:32,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:32,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:32,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:32,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:32,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:32,388 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:32,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:32,403 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:32,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:32,404 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:32,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2021-12-14 23:04:32,406 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:32,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:32,412 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:32,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:32,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:32,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:32,413 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:32,413 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:32,414 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:32,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:32,429 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:32,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:32,430 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:32,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2021-12-14 23:04:32,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:32,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:32,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:32,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:32,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:32,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:32,438 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:32,438 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:32,439 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:32,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:32,454 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:32,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:32,455 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:32,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2021-12-14 23:04:32,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:32,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:32,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:32,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:32,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:32,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:32,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:32,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:32,470 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:32,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:32,485 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:32,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:32,486 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:32,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2021-12-14 23:04:32,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:32,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:32,494 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:32,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:32,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:32,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:32,494 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:32,494 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:32,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:32,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2021-12-14 23:04:32,510 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:32,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:32,511 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:32,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2021-12-14 23:04:32,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:32,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:32,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:32,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:32,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:32,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:32,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:32,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:32,520 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:32,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:32,535 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:32,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:32,536 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:32,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2021-12-14 23:04:32,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:32,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:32,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:32,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:32,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:32,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:32,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:32,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:32,545 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:32,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:32,560 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:32,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:32,560 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:32,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2021-12-14 23:04:32,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:32,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:32,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:32,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:32,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:32,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:32,570 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:32,570 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:32,571 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:32,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:32,586 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:32,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:32,587 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:32,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2021-12-14 23:04:32,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:32,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:32,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:32,596 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-14 23:04:32,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:32,600 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2021-12-14 23:04:32,600 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2021-12-14 23:04:32,607 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:32,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2021-12-14 23:04:32,622 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:32,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:32,623 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:32,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2021-12-14 23:04:32,625 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:32,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:32,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:32,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:32,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:32,632 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:32,632 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:32,634 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:32,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:32,649 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:32,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:32,650 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:32,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2021-12-14 23:04:32,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:32,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:32,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:32,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:32,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:32,659 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:32,660 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:32,663 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:32,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2021-12-14 23:04:32,678 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:32,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:32,679 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:32,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2021-12-14 23:04:32,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:32,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:32,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:32,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:32,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:32,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:32,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:32,713 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:04:32,736 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-12-14 23:04:32,736 INFO L444 ModelExtractionUtils]: 22 out of 55 variables were initially zero. Simplification set additionally 30 variables to zero. [2021-12-14 23:04:32,736 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:32,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:32,737 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:32,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2021-12-14 23:04:32,739 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:04:32,745 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-14 23:04:32,745 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:04:32,745 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~hay~0#1.base)_3, ULTIMATE.start_strlen_~s#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_~hay~0#1.base)_3 - 1*ULTIMATE.start_strlen_~s#1.offset Supporting invariants [] [2021-12-14 23:04:32,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:32,796 INFO L297 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2021-12-14 23:04:32,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:32,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 23:04:32,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:04:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:32,959 WARN L261 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 23:04:32,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:04:32,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:04:32,995 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2021-12-14 23:04:32,996 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 76 transitions. cyclomatic complexity: 23 Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:33,058 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 76 transitions. cyclomatic complexity: 23. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 89 states and 114 transitions. Complement of second has 7 states. [2021-12-14 23:04:33,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-14 23:04:33,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:33,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2021-12-14 23:04:33,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 56 transitions. Stem has 16 letters. Loop has 3 letters. [2021-12-14 23:04:33,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:04:33,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 56 transitions. Stem has 19 letters. Loop has 3 letters. [2021-12-14 23:04:33,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:04:33,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 56 transitions. Stem has 16 letters. Loop has 6 letters. [2021-12-14 23:04:33,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:04:33,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 114 transitions. [2021-12-14 23:04:33,062 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2021-12-14 23:04:33,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 74 states and 94 transitions. [2021-12-14 23:04:33,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2021-12-14 23:04:33,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2021-12-14 23:04:33,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 94 transitions. [2021-12-14 23:04:33,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:04:33,063 INFO L681 BuchiCegarLoop]: Abstraction has 74 states and 94 transitions. [2021-12-14 23:04:33,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 94 transitions. [2021-12-14 23:04:33,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2021-12-14 23:04:33,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.278688524590164) internal successors, (78), 60 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:33,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2021-12-14 23:04:33,066 INFO L704 BuchiCegarLoop]: Abstraction has 61 states and 78 transitions. [2021-12-14 23:04:33,067 INFO L587 BuchiCegarLoop]: Abstraction has 61 states and 78 transitions. [2021-12-14 23:04:33,067 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-14 23:04:33,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 78 transitions. [2021-12-14 23:04:33,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-12-14 23:04:33,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:04:33,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:04:33,068 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:04:33,068 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-14 23:04:33,068 INFO L791 eck$LassoCheckResult]: Stem: 1275#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1254#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1255#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 1238#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 1239#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 1251#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 1243#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 1244#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 1248#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1256#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1257#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 1277#L510-5 strlen_#res#1 := strlen_~i~0#1; 1249#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 1250#L509-2 assume strlen_~s#1.base == 0 && strlen_~s#1.offset == 0;strlen_#res#1 := 0; 1270#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 1260#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 1252#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 1253#L532-3 [2021-12-14 23:04:33,069 INFO L793 eck$LassoCheckResult]: Loop: 1253#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 1276#L533 assume !strstr_#t~short17#1; 1273#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 1274#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 1253#L532-3 [2021-12-14 23:04:33,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:33,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1331460076, now seen corresponding path program 1 times [2021-12-14 23:04:33,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:33,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544164305] [2021-12-14 23:04:33,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:33,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:33,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:04:33,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:04:33,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544164305] [2021-12-14 23:04:33,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544164305] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:04:33,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:04:33,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 23:04:33,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139345821] [2021-12-14 23:04:33,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:04:33,096 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:04:33,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:33,096 INFO L85 PathProgramCache]: Analyzing trace with hash 4089565, now seen corresponding path program 1 times [2021-12-14 23:04:33,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:33,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763312971] [2021-12-14 23:04:33,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:33,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:33,103 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:33,108 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:33,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:04:33,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 23:04:33,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 23:04:33,205 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. cyclomatic complexity: 24 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:33,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:04:33,237 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2021-12-14 23:04:33,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 23:04:33,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 76 transitions. [2021-12-14 23:04:33,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-12-14 23:04:33,239 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 76 transitions. [2021-12-14 23:04:33,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2021-12-14 23:04:33,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2021-12-14 23:04:33,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 76 transitions. [2021-12-14 23:04:33,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:04:33,240 INFO L681 BuchiCegarLoop]: Abstraction has 61 states and 76 transitions. [2021-12-14 23:04:33,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 76 transitions. [2021-12-14 23:04:33,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-12-14 23:04:33,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 60 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:33,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2021-12-14 23:04:33,243 INFO L704 BuchiCegarLoop]: Abstraction has 61 states and 76 transitions. [2021-12-14 23:04:33,243 INFO L587 BuchiCegarLoop]: Abstraction has 61 states and 76 transitions. [2021-12-14 23:04:33,243 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-14 23:04:33,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 76 transitions. [2021-12-14 23:04:33,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-12-14 23:04:33,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:04:33,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:04:33,244 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:04:33,244 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-14 23:04:33,245 INFO L791 eck$LassoCheckResult]: Stem: 1409#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1386#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1387#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 1372#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 1373#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 1430#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 1377#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 1378#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 1382#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1390#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1391#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 1411#L510-5 strlen_#res#1 := strlen_~i~0#1; 1383#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 1384#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1395#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1396#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 1399#L510-11 strlen_#res#1 := strlen_~i~0#1; 1404#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 1394#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 1388#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 1389#L532-3 [2021-12-14 23:04:33,245 INFO L793 eck$LassoCheckResult]: Loop: 1389#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 1410#L533 assume !strstr_#t~short17#1; 1407#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 1408#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 1389#L532-3 [2021-12-14 23:04:33,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:33,245 INFO L85 PathProgramCache]: Analyzing trace with hash -115443887, now seen corresponding path program 1 times [2021-12-14 23:04:33,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:33,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613841805] [2021-12-14 23:04:33,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:33,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:33,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:04:33,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:04:33,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613841805] [2021-12-14 23:04:33,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613841805] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:04:33,302 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:04:33,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 23:04:33,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361658292] [2021-12-14 23:04:33,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:04:33,303 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:04:33,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:33,304 INFO L85 PathProgramCache]: Analyzing trace with hash 4089565, now seen corresponding path program 2 times [2021-12-14 23:04:33,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:33,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969293453] [2021-12-14 23:04:33,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:33,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:33,308 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:33,322 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:33,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:04:33,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 23:04:33,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 23:04:33,414 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. cyclomatic complexity: 22 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:33,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:04:33,454 INFO L93 Difference]: Finished difference Result 100 states and 118 transitions. [2021-12-14 23:04:33,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 23:04:33,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 118 transitions. [2021-12-14 23:04:33,456 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2021-12-14 23:04:33,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 72 states and 86 transitions. [2021-12-14 23:04:33,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2021-12-14 23:04:33,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2021-12-14 23:04:33,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 86 transitions. [2021-12-14 23:04:33,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:04:33,457 INFO L681 BuchiCegarLoop]: Abstraction has 72 states and 86 transitions. [2021-12-14 23:04:33,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 86 transitions. [2021-12-14 23:04:33,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2021-12-14 23:04:33,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.2) internal successors, (66), 54 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:33,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2021-12-14 23:04:33,459 INFO L704 BuchiCegarLoop]: Abstraction has 55 states and 66 transitions. [2021-12-14 23:04:33,459 INFO L587 BuchiCegarLoop]: Abstraction has 55 states and 66 transitions. [2021-12-14 23:04:33,460 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-14 23:04:33,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 66 transitions. [2021-12-14 23:04:33,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-12-14 23:04:33,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:04:33,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:04:33,461 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:04:33,461 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-14 23:04:33,461 INFO L791 eck$LassoCheckResult]: Stem: 1587#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1563#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1564#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 1547#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 1548#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 1560#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 1592#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 1556#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 1554#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 1555#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 1557#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1598#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1596#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 1597#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 1595#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1589#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 1590#L510-5 strlen_#res#1 := strlen_~i~0#1; 1558#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 1559#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1570#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1571#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 1576#L510-11 strlen_#res#1 := strlen_~i~0#1; 1582#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 1569#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 1561#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 1562#L532-3 [2021-12-14 23:04:33,461 INFO L793 eck$LassoCheckResult]: Loop: 1562#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 1588#L533 assume !strstr_#t~short17#1; 1585#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 1586#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 1562#L532-3 [2021-12-14 23:04:33,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:33,461 INFO L85 PathProgramCache]: Analyzing trace with hash 278203018, now seen corresponding path program 1 times [2021-12-14 23:04:33,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:33,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437288381] [2021-12-14 23:04:33,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:33,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:33,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 23:04:33,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:04:33,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437288381] [2021-12-14 23:04:33,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437288381] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:04:33,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122984690] [2021-12-14 23:04:33,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:33,664 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:04:33,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:33,665 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:04:33,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2021-12-14 23:04:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:33,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 23:04:33,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:04:33,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 23:04:33,802 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 23:04:33,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122984690] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:04:33,802 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 23:04:33,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2021-12-14 23:04:33,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500734121] [2021-12-14 23:04:33,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:04:33,802 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:04:33,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:33,803 INFO L85 PathProgramCache]: Analyzing trace with hash 4089565, now seen corresponding path program 3 times [2021-12-14 23:04:33,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:33,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450938573] [2021-12-14 23:04:33,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:33,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:33,807 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:33,809 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:33,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:04:33,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 23:04:33,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-14 23:04:33,899 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. cyclomatic complexity: 18 Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:33,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:04:33,940 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2021-12-14 23:04:33,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 23:04:33,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 73 transitions. [2021-12-14 23:04:33,941 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-12-14 23:04:33,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 41 states and 48 transitions. [2021-12-14 23:04:33,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2021-12-14 23:04:33,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-12-14 23:04:33,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 48 transitions. [2021-12-14 23:04:33,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:04:33,942 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2021-12-14 23:04:33,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 48 transitions. [2021-12-14 23:04:33,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2021-12-14 23:04:33,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:33,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2021-12-14 23:04:33,944 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2021-12-14 23:04:33,944 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2021-12-14 23:04:33,945 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-14 23:04:33,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2021-12-14 23:04:33,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-12-14 23:04:33,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:04:33,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:04:33,946 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:04:33,946 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-14 23:04:33,946 INFO L791 eck$LassoCheckResult]: Stem: 1794#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1773#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1774#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 1759#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 1760#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1761#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 1762#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 1770#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 1763#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 1764#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 1765#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 1766#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 1767#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1775#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1776#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 1788#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 1777#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1778#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 1796#L510-5 strlen_#res#1 := strlen_~i~0#1; 1768#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 1769#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1780#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1781#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 1785#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 1782#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1783#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 1784#L510-11 strlen_#res#1 := strlen_~i~0#1; 1789#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 1779#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 1771#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 1772#L532-3 [2021-12-14 23:04:33,946 INFO L793 eck$LassoCheckResult]: Loop: 1772#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 1795#L533 assume !strstr_#t~short17#1; 1792#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 1793#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 1772#L532-3 [2021-12-14 23:04:33,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:33,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1690519729, now seen corresponding path program 1 times [2021-12-14 23:04:33,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:33,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305962094] [2021-12-14 23:04:33,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:33,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:33,963 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:33,979 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:33,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:33,980 INFO L85 PathProgramCache]: Analyzing trace with hash 4089565, now seen corresponding path program 4 times [2021-12-14 23:04:33,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:33,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382604759] [2021-12-14 23:04:33,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:33,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:33,983 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:33,986 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:33,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:33,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1271781261, now seen corresponding path program 1 times [2021-12-14 23:04:33,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:33,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831194427] [2021-12-14 23:04:33,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:33,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:34,002 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:34,019 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:35,582 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:04:35,582 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:04:35,582 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:04:35,582 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:04:35,582 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:04:35,582 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:35,582 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:04:35,582 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:04:35,582 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration11_Lasso [2021-12-14 23:04:35,583 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:04:35,583 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:04:35,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:35,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:35,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:36,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:36,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:36,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:36,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:36,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:36,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:36,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:36,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:36,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:36,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:36,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:36,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:36,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:36,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:36,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:36,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:36,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:36,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:36,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:36,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:36,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:36,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:36,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:36,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:36,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:36,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:36,813 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:04:36,813 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:04:36,813 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:36,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:36,814 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:36,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2021-12-14 23:04:36,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:36,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:36,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:36,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:36,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:36,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:36,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:36,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:36,822 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:36,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:36,837 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:36,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:36,838 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:36,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2021-12-14 23:04:36,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:36,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:36,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:36,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:36,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:36,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:36,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:36,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:36,846 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:36,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2021-12-14 23:04:36,861 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:36,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:36,862 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:36,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2021-12-14 23:04:36,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:36,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:36,869 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2021-12-14 23:04:36,869 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-14 23:04:36,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:36,894 INFO L401 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2021-12-14 23:04:36,895 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2021-12-14 23:04:36,914 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:36,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2021-12-14 23:04:36,930 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:36,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:36,930 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:36,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2021-12-14 23:04:36,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:36,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:36,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:36,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:36,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:36,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:36,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:36,963 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:04:37,031 INFO L443 ModelExtractionUtils]: Simplification made 38 calls to the SMT solver. [2021-12-14 23:04:37,031 INFO L444 ModelExtractionUtils]: 9 out of 55 variables were initially zero. Simplification set additionally 41 variables to zero. [2021-12-14 23:04:37,031 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:37,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:37,036 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:37,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2021-12-14 23:04:37,038 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:04:37,072 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-14 23:04:37,072 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:04:37,073 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strstr_~haystack#1.offset, v_rep(select #length ULTIMATE.start_strstr_~needle#1.base)_1) = -1*ULTIMATE.start_strstr_~haystack#1.offset + 1*v_rep(select #length ULTIMATE.start_strstr_~needle#1.base)_1 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_strstr_~haystack#1.base)_1 + 1*v_rep(select #length ULTIMATE.start_strstr_~needle#1.base)_1 >= 0] [2021-12-14 23:04:37,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:37,201 INFO L297 tatePredicateManager]: 36 out of 37 supporting invariants were superfluous and have been removed [2021-12-14 23:04:37,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:37,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-14 23:04:37,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:04:37,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 23:04:37,396 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 23:04:37,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 23:04:37,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-14 23:04:37,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:37,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 23:04:37,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:04:37,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:04:37,801 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 3 loop predicates [2021-12-14 23:04:37,801 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 12 Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:38,195 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 12. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 89 states and 109 transitions. Complement of second has 17 states. [2021-12-14 23:04:38,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-14 23:04:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:38,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 72 transitions. [2021-12-14 23:04:38,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 72 transitions. Stem has 30 letters. Loop has 4 letters. [2021-12-14 23:04:38,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:04:38,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 72 transitions. Stem has 34 letters. Loop has 4 letters. [2021-12-14 23:04:38,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:04:38,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 72 transitions. Stem has 30 letters. Loop has 8 letters. [2021-12-14 23:04:38,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:04:38,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 109 transitions. [2021-12-14 23:04:38,198 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2021-12-14 23:04:38,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 86 states and 103 transitions. [2021-12-14 23:04:38,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2021-12-14 23:04:38,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2021-12-14 23:04:38,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 103 transitions. [2021-12-14 23:04:38,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:04:38,199 INFO L681 BuchiCegarLoop]: Abstraction has 86 states and 103 transitions. [2021-12-14 23:04:38,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 103 transitions. [2021-12-14 23:04:38,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2021-12-14 23:04:38,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 1.2) internal successors, (96), 79 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:38,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2021-12-14 23:04:38,202 INFO L704 BuchiCegarLoop]: Abstraction has 80 states and 96 transitions. [2021-12-14 23:04:38,202 INFO L587 BuchiCegarLoop]: Abstraction has 80 states and 96 transitions. [2021-12-14 23:04:38,202 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-14 23:04:38,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 96 transitions. [2021-12-14 23:04:38,202 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2021-12-14 23:04:38,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:04:38,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:04:38,203 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:04:38,203 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:04:38,203 INFO L791 eck$LassoCheckResult]: Stem: 2249#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2219#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 2220#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 2206#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 2207#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2208#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 2209#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 2218#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 2211#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 2212#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 2213#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 2214#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 2215#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 2223#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2224#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 2258#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 2278#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2277#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 2276#L510-5 strlen_#res#1 := strlen_~i~0#1; 2275#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 2274#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 2273#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2271#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 2272#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 2270#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2269#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 2268#L510-11 strlen_#res#1 := strlen_~i~0#1; 2267#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 2266#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 2265#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 2264#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 2261#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 2242#L518-3 [2021-12-14 23:04:38,204 INFO L793 eck$LassoCheckResult]: Loop: 2242#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 2262#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 2241#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 2242#L518-3 [2021-12-14 23:04:38,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:38,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1091824948, now seen corresponding path program 1 times [2021-12-14 23:04:38,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:38,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327808818] [2021-12-14 23:04:38,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:38,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:38,220 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:38,249 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:38,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:38,249 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 1 times [2021-12-14 23:04:38,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:38,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773418878] [2021-12-14 23:04:38,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:38,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:38,256 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:38,260 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:38,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:38,261 INFO L85 PathProgramCache]: Analyzing trace with hash 769802655, now seen corresponding path program 1 times [2021-12-14 23:04:38,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:38,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174249305] [2021-12-14 23:04:38,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:38,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:38,283 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:38,323 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:41,094 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:04:41,094 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:04:41,094 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:04:41,094 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:04:41,094 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:04:41,094 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:41,094 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:04:41,094 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:04:41,094 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration12_Lasso [2021-12-14 23:04:41,095 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:04:41,095 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:04:41,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:41,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:41,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:41,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:42,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:43,364 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:04:43,364 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:04:43,364 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:43,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:43,365 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:43,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2021-12-14 23:04:43,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:43,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:43,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:43,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:43,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:43,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:43,373 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:43,373 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:43,374 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:43,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2021-12-14 23:04:43,388 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:43,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:43,389 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:43,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2021-12-14 23:04:43,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:43,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:43,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:43,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:43,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:43,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:43,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:43,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:43,397 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:43,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:43,412 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:43,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:43,413 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:43,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2021-12-14 23:04:43,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:43,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:43,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:43,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:43,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:43,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:43,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:43,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:43,421 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:43,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2021-12-14 23:04:43,435 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:43,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:43,436 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:43,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2021-12-14 23:04:43,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:43,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:43,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:43,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:43,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:43,444 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:43,444 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:43,446 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:43,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2021-12-14 23:04:43,460 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:43,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:43,461 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:43,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2021-12-14 23:04:43,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:43,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:43,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:43,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:43,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:43,487 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:43,487 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:43,524 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:04:43,553 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-12-14 23:04:43,553 INFO L444 ModelExtractionUtils]: 63 out of 85 variables were initially zero. Simplification set additionally 19 variables to zero. [2021-12-14 23:04:43,553 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:43,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:43,554 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:43,562 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:04:43,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2021-12-14 23:04:43,588 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-14 23:04:43,588 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:04:43,588 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_memcmp_~d~0#1.offset, v_rep(select #length ULTIMATE.start_memcmp_~d~0#1.base)_1) = -1*ULTIMATE.start_memcmp_~d~0#1.offset + 1*v_rep(select #length ULTIMATE.start_memcmp_~d~0#1.base)_1 Supporting invariants [] [2021-12-14 23:04:43,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:43,786 INFO L297 tatePredicateManager]: 53 out of 53 supporting invariants were superfluous and have been removed [2021-12-14 23:04:43,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:43,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 23:04:43,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:04:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:43,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 23:04:43,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:04:43,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:04:43,909 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 [2021-12-14 23:04:43,910 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 96 transitions. cyclomatic complexity: 26 Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:43,926 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 80 states and 96 transitions. cyclomatic complexity: 26. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 159 states and 194 transitions. Complement of second has 7 states. [2021-12-14 23:04:43,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-14 23:04:43,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:43,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2021-12-14 23:04:43,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 32 letters. Loop has 3 letters. [2021-12-14 23:04:43,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:04:43,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 35 letters. Loop has 3 letters. [2021-12-14 23:04:43,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:04:43,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 32 letters. Loop has 6 letters. [2021-12-14 23:04:43,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:04:43,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 194 transitions. [2021-12-14 23:04:43,928 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2021-12-14 23:04:43,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 125 states and 153 transitions. [2021-12-14 23:04:43,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2021-12-14 23:04:43,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2021-12-14 23:04:43,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 153 transitions. [2021-12-14 23:04:43,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:04:43,930 INFO L681 BuchiCegarLoop]: Abstraction has 125 states and 153 transitions. [2021-12-14 23:04:43,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 153 transitions. [2021-12-14 23:04:43,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 99. [2021-12-14 23:04:43,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 98 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:43,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2021-12-14 23:04:43,933 INFO L704 BuchiCegarLoop]: Abstraction has 99 states and 121 transitions. [2021-12-14 23:04:43,933 INFO L587 BuchiCegarLoop]: Abstraction has 99 states and 121 transitions. [2021-12-14 23:04:43,933 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-14 23:04:43,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 121 transitions. [2021-12-14 23:04:43,934 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2021-12-14 23:04:43,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:04:43,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:04:43,934 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:04:43,935 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-14 23:04:43,935 INFO L791 eck$LassoCheckResult]: Stem: 2833#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2802#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 2803#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 2786#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 2787#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2788#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 2790#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2791#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 2800#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 2801#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 2792#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 2793#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 2794#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 2795#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 2825#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 2806#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2807#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 2876#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 2875#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2874#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 2850#L510-5 strlen_#res#1 := strlen_~i~0#1; 2851#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 2873#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 2872#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2815#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 2819#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 2814#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2816#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 2871#L510-11 strlen_#res#1 := strlen_~i~0#1; 2870#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 2867#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 2866#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 2864#L532-3 [2021-12-14 23:04:43,935 INFO L793 eck$LassoCheckResult]: Loop: 2864#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 2862#L533 assume !strstr_#t~short17#1; 2863#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 2865#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 2864#L532-3 [2021-12-14 23:04:43,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:43,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2104844943, now seen corresponding path program 2 times [2021-12-14 23:04:43,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:43,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377935471] [2021-12-14 23:04:43,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:43,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:43,960 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:43,977 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:43,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:43,977 INFO L85 PathProgramCache]: Analyzing trace with hash 4089565, now seen corresponding path program 5 times [2021-12-14 23:04:43,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:43,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839399683] [2021-12-14 23:04:43,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:43,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:43,980 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:43,984 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:43,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:43,984 INFO L85 PathProgramCache]: Analyzing trace with hash 671339115, now seen corresponding path program 2 times [2021-12-14 23:04:43,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:43,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940568665] [2021-12-14 23:04:43,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:43,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:44,031 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:44,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:44,062 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:46,141 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:04:46,141 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:04:46,142 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:04:46,142 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:04:46,142 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:04:46,142 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:46,142 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:04:46,142 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:04:46,142 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration13_Lasso [2021-12-14 23:04:46,142 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:04:46,142 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:04:46,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:46,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:46,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:46,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:46,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:46,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:46,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:46,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:46,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:46,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:46,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:46,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:46,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:46,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:46,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:46,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:46,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:46,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:46,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:46,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:46,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:46,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:46,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:46,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:46,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:46,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:46,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:46,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:46,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:04:47,619 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:04:47,619 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:04:47,619 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:47,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:47,623 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:47,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2021-12-14 23:04:47,625 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:47,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:47,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:47,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:47,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:47,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:47,630 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:47,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:47,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:47,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:47,650 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:47,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:47,650 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:47,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2021-12-14 23:04:47,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:47,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:47,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:47,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:47,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:47,663 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:47,663 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:47,680 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:47,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2021-12-14 23:04:47,701 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:47,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:47,702 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:47,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2021-12-14 23:04:47,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:47,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:47,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:47,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:47,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:47,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:47,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:47,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:47,712 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:47,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:47,727 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:47,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:47,728 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:47,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2021-12-14 23:04:47,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:47,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:47,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:47,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:47,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:47,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:47,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:47,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:47,736 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:47,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:47,752 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:47,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:47,753 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:47,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2021-12-14 23:04:47,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:47,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:47,760 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:47,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:47,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:47,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:47,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:47,761 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:47,761 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:47,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:47,776 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:47,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:47,777 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:47,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2021-12-14 23:04:47,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:47,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:47,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:47,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:47,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:47,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:47,785 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:47,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:47,785 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:47,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:47,800 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:47,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:47,801 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:47,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2021-12-14 23:04:47,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:47,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:47,808 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:47,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:47,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:47,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:47,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:47,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:47,809 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:47,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:47,824 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:47,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:47,824 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:47,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2021-12-14 23:04:47,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:47,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:47,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:47,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:47,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:47,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:47,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:47,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:47,840 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:47,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2021-12-14 23:04:47,855 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:47,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:47,855 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:47,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2021-12-14 23:04:47,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:47,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:47,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:47,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:47,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:47,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:47,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:47,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:47,865 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:47,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:47,880 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:47,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:47,881 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:47,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2021-12-14 23:04:47,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:47,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:47,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:47,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:47,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:47,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:47,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:47,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:47,891 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:47,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2021-12-14 23:04:47,906 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:47,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:47,906 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:47,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2021-12-14 23:04:47,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:47,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:47,915 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:47,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:47,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:47,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:47,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:47,916 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:47,916 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:47,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2021-12-14 23:04:47,931 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:47,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:47,932 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:47,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2021-12-14 23:04:47,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:47,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:47,940 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:47,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:47,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:47,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:47,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:47,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:47,941 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:47,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2021-12-14 23:04:47,956 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:47,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:47,957 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:47,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2021-12-14 23:04:47,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:47,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:47,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:47,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:47,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:47,965 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:47,965 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:47,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:47,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:47,982 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:47,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:47,983 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:47,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2021-12-14 23:04:47,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:47,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:47,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:47,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:47,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:47,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:47,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:47,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:47,992 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:48,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2021-12-14 23:04:48,007 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:48,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:48,008 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:48,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2021-12-14 23:04:48,010 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:48,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:48,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:48,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:48,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:48,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:48,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:48,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:48,017 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:48,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2021-12-14 23:04:48,033 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:48,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:48,033 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:48,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2021-12-14 23:04:48,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:48,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:48,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:48,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:48,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:48,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:48,042 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:48,042 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:48,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:48,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2021-12-14 23:04:48,058 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:48,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:48,059 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:48,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2021-12-14 23:04:48,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:48,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:48,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:48,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:48,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:48,089 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:48,089 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:48,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:48,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2021-12-14 23:04:48,107 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:48,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:48,107 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:48,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2021-12-14 23:04:48,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:48,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:48,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:48,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:48,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:48,117 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:48,117 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:48,119 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:48,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2021-12-14 23:04:48,134 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:48,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:48,135 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:48,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2021-12-14 23:04:48,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:48,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:48,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:48,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:48,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:48,144 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:48,144 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:48,146 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:48,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2021-12-14 23:04:48,161 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:48,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:48,162 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:48,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2021-12-14 23:04:48,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:48,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:48,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:48,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:48,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:48,173 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:48,173 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:48,201 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:48,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2021-12-14 23:04:48,216 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:48,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:48,217 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:48,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2021-12-14 23:04:48,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:48,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:48,225 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2021-12-14 23:04:48,225 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-14 23:04:48,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:48,240 INFO L401 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2021-12-14 23:04:48,240 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2021-12-14 23:04:48,275 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:48,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:48,299 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:48,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:48,300 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:48,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:48,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:48,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:48,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:48,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:48,314 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:48,314 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:48,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2021-12-14 23:04:48,325 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:48,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:48,349 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:48,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:48,350 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:48,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2021-12-14 23:04:48,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:48,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:48,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:48,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:48,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:48,368 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:48,368 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:48,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:48,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:48,436 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:48,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:48,437 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:48,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:48,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:48,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:48,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:48,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:48,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:48,452 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:48,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2021-12-14 23:04:48,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:48,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:48,486 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:48,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:48,487 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:48,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:48,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:48,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:48,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:48,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:48,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2021-12-14 23:04:48,511 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:48,511 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:48,535 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:04:48,604 INFO L443 ModelExtractionUtils]: Simplification made 31 calls to the SMT solver. [2021-12-14 23:04:48,604 INFO L444 ModelExtractionUtils]: 8 out of 58 variables were initially zero. Simplification set additionally 47 variables to zero. [2021-12-14 23:04:48,604 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:48,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:48,608 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:04:48,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2021-12-14 23:04:48,610 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:04:48,624 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-14 23:04:48,624 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:04:48,624 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strstr_~haystack#1.offset, v_rep(select #length ULTIMATE.start_main_~hay~0#1.base)_5) = -1*ULTIMATE.start_strstr_~haystack#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~hay~0#1.base)_5 Supporting invariants [] [2021-12-14 23:04:48,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2021-12-14 23:04:48,768 INFO L297 tatePredicateManager]: 54 out of 56 supporting invariants were superfluous and have been removed [2021-12-14 23:04:48,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:48,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 23:04:48,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:04:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:48,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 23:04:48,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:04:49,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:04:49,006 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2021-12-14 23:04:49,007 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 121 transitions. cyclomatic complexity: 36 Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:49,051 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 121 transitions. cyclomatic complexity: 36. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 140 states and 180 transitions. Complement of second has 8 states. [2021-12-14 23:04:49,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-14 23:04:49,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:49,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2021-12-14 23:04:49,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 41 transitions. Stem has 32 letters. Loop has 4 letters. [2021-12-14 23:04:49,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:04:49,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 41 transitions. Stem has 36 letters. Loop has 4 letters. [2021-12-14 23:04:49,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:04:49,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 41 transitions. Stem has 32 letters. Loop has 8 letters. [2021-12-14 23:04:49,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:04:49,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 180 transitions. [2021-12-14 23:04:49,059 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-14 23:04:49,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 105 states and 128 transitions. [2021-12-14 23:04:49,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2021-12-14 23:04:49,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2021-12-14 23:04:49,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 128 transitions. [2021-12-14 23:04:49,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:04:49,061 INFO L681 BuchiCegarLoop]: Abstraction has 105 states and 128 transitions. [2021-12-14 23:04:49,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 128 transitions. [2021-12-14 23:04:49,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 54. [2021-12-14 23:04:49,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 53 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:49,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2021-12-14 23:04:49,063 INFO L704 BuchiCegarLoop]: Abstraction has 54 states and 65 transitions. [2021-12-14 23:04:49,063 INFO L587 BuchiCegarLoop]: Abstraction has 54 states and 65 transitions. [2021-12-14 23:04:49,063 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-12-14 23:04:49,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 65 transitions. [2021-12-14 23:04:49,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:04:49,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:04:49,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:04:49,067 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:04:49,067 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:04:49,073 INFO L791 eck$LassoCheckResult]: Stem: 3428#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3403#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 3404#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 3391#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 3392#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3393#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 3394#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 3402#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 3395#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 3396#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 3397#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 3398#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 3399#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 3407#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 3408#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 3420#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 3409#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 3410#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 3433#L510-5 strlen_#res#1 := strlen_~i~0#1; 3400#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 3401#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 3412#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 3413#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 3419#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 3414#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 3415#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 3418#L510-11 strlen_#res#1 := strlen_~i~0#1; 3421#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 3411#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 3405#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 3406#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 3431#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 3425#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 3438#L518-1 assume !(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1; 3416#L518-4 memcmp_#res#1 := 0; 3417#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 3432#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 3441#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 3440#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 3430#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 3423#L518-3 [2021-12-14 23:04:49,073 INFO L793 eck$LassoCheckResult]: Loop: 3423#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 3434#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 3422#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 3423#L518-3 [2021-12-14 23:04:49,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:49,073 INFO L85 PathProgramCache]: Analyzing trace with hash -840479618, now seen corresponding path program 1 times [2021-12-14 23:04:49,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:49,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088650671] [2021-12-14 23:04:49,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:49,074 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:49,110 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 23:04:49,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:04:49,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088650671] [2021-12-14 23:04:49,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088650671] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:04:49,111 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:04:49,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 23:04:49,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402678375] [2021-12-14 23:04:49,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:04:49,112 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:04:49,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:49,112 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 2 times [2021-12-14 23:04:49,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:49,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351855698] [2021-12-14 23:04:49,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:49,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:49,118 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:49,122 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:49,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:49,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:04:49,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 23:04:49,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 23:04:49,253 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. cyclomatic complexity: 19 Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:49,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:04:49,271 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2021-12-14 23:04:49,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 23:04:49,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 66 transitions. [2021-12-14 23:04:49,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:04:49,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 53 states and 62 transitions. [2021-12-14 23:04:49,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2021-12-14 23:04:49,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2021-12-14 23:04:49,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 62 transitions. [2021-12-14 23:04:49,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:04:49,273 INFO L681 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2021-12-14 23:04:49,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 62 transitions. [2021-12-14 23:04:49,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-12-14 23:04:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.169811320754717) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:49,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2021-12-14 23:04:49,275 INFO L704 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2021-12-14 23:04:49,275 INFO L587 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2021-12-14 23:04:49,275 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-12-14 23:04:49,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 62 transitions. [2021-12-14 23:04:49,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:04:49,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:04:49,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:04:49,275 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:04:49,275 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:04:49,276 INFO L791 eck$LassoCheckResult]: Stem: 3545#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3524#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 3525#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 3510#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 3511#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3512#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 3513#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 3521#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 3514#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 3515#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 3516#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 3517#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 3518#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 3526#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 3527#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 3537#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 3528#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 3529#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 3551#L510-5 strlen_#res#1 := strlen_~i~0#1; 3519#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 3520#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 3531#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 3532#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 3536#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 3533#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 3534#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 3535#L510-11 strlen_#res#1 := strlen_~i~0#1; 3538#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 3530#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 3522#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 3523#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 3548#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 3542#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 3555#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 3556#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 3549#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 3550#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 3558#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 3557#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 3547#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 3540#L518-3 [2021-12-14 23:04:49,276 INFO L793 eck$LassoCheckResult]: Loop: 3540#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 3552#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 3539#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 3540#L518-3 [2021-12-14 23:04:49,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:49,276 INFO L85 PathProgramCache]: Analyzing trace with hash 762752838, now seen corresponding path program 1 times [2021-12-14 23:04:49,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:49,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749937938] [2021-12-14 23:04:49,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:49,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:49,439 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 23:04:49,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:04:49,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749937938] [2021-12-14 23:04:49,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749937938] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:04:49,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361129143] [2021-12-14 23:04:49,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:49,440 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:04:49,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:49,444 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:04:49,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2021-12-14 23:04:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:49,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-14 23:04:49,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:04:49,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 23:04:50,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:04:50,196 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 23:04:50,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 21 [2021-12-14 23:04:50,217 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 23:04:50,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:04:50,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 49 [2021-12-14 23:04:50,597 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-14 23:04:50,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 1 [2021-12-14 23:04:50,607 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 23:04:50,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361129143] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:04:50,607 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:04:50,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 33 [2021-12-14 23:04:50,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348611632] [2021-12-14 23:04:50,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:04:50,608 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:04:50,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:50,609 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 3 times [2021-12-14 23:04:50,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:50,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639850515] [2021-12-14 23:04:50,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:50,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:50,613 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:50,617 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:50,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:04:50,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-14 23:04:50,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=939, Unknown=0, NotChecked=0, Total=1056 [2021-12-14 23:04:50,724 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. cyclomatic complexity: 17 Second operand has 33 states, 33 states have (on average 3.212121212121212) internal successors, (106), 33 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:52,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:04:52,790 INFO L93 Difference]: Finished difference Result 260 states and 304 transitions. [2021-12-14 23:04:52,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-12-14 23:04:52,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 260 states and 304 transitions. [2021-12-14 23:04:52,792 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2021-12-14 23:04:52,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 260 states to 238 states and 281 transitions. [2021-12-14 23:04:52,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2021-12-14 23:04:52,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2021-12-14 23:04:52,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 238 states and 281 transitions. [2021-12-14 23:04:52,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:04:52,794 INFO L681 BuchiCegarLoop]: Abstraction has 238 states and 281 transitions. [2021-12-14 23:04:52,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states and 281 transitions. [2021-12-14 23:04:52,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 88. [2021-12-14 23:04:52,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.1477272727272727) internal successors, (101), 87 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:52,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2021-12-14 23:04:52,797 INFO L704 BuchiCegarLoop]: Abstraction has 88 states and 101 transitions. [2021-12-14 23:04:52,797 INFO L587 BuchiCegarLoop]: Abstraction has 88 states and 101 transitions. [2021-12-14 23:04:52,798 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-12-14 23:04:52,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 101 transitions. [2021-12-14 23:04:52,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:04:52,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:04:52,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:04:52,799 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:04:52,799 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:04:52,799 INFO L791 eck$LassoCheckResult]: Stem: 4227#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4199#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 4200#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 4187#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 4188#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4189#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 4190#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 4198#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 4191#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 4192#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 4193#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 4194#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 4195#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 4203#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4204#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 4237#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 4205#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4207#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 4245#L510-5 strlen_#res#1 := strlen_~i~0#1; 4246#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 4218#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 4219#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4248#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 4247#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 4211#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4212#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 4215#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 4234#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4213#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 4214#L510-11 strlen_#res#1 := strlen_~i~0#1; 4220#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 4208#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 4201#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 4202#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 4241#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 4224#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 4243#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 4244#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 4233#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 4232#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 4250#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 4249#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 4230#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 4222#L518-3 [2021-12-14 23:04:52,799 INFO L793 eck$LassoCheckResult]: Loop: 4222#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 4238#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 4221#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 4222#L518-3 [2021-12-14 23:04:52,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:52,800 INFO L85 PathProgramCache]: Analyzing trace with hash 717589665, now seen corresponding path program 2 times [2021-12-14 23:04:52,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:52,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476244855] [2021-12-14 23:04:52,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:52,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:52,940 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 23:04:52,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:04:52,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476244855] [2021-12-14 23:04:52,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476244855] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:04:52,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668016572] [2021-12-14 23:04:52,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 23:04:52,942 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:04:52,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:52,943 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:04:52,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2021-12-14 23:04:53,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 23:04:53,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 23:04:53,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 76 conjunts are in the unsatisfiable core [2021-12-14 23:04:53,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:04:53,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 23:04:53,152 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 23:04:53,153 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-14 23:04:53,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-12-14 23:04:54,007 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 23:04:54,009 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 23:04:54,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 24 [2021-12-14 23:04:54,029 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 23:04:54,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:04:54,455 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 23:04:54,490 INFO L354 Elim1Store]: treesize reduction 17, result has 74.2 percent of original size [2021-12-14 23:04:54,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 60 [2021-12-14 23:04:55,128 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 23:04:55,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668016572] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:04:55,128 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:04:55,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 18] total 44 [2021-12-14 23:04:55,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462638108] [2021-12-14 23:04:55,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:04:55,129 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:04:55,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:55,129 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 4 times [2021-12-14 23:04:55,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:55,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587569760] [2021-12-14 23:04:55,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:55,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:55,133 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:55,136 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:55,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:04:55,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-12-14 23:04:55,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1667, Unknown=0, NotChecked=0, Total=1892 [2021-12-14 23:04:55,251 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. cyclomatic complexity: 22 Second operand has 44 states, 44 states have (on average 2.75) internal successors, (121), 44 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:56,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:04:56,398 INFO L93 Difference]: Finished difference Result 175 states and 198 transitions. [2021-12-14 23:04:56,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-14 23:04:56,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 175 states and 198 transitions. [2021-12-14 23:04:56,400 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-14 23:04:56,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 175 states to 161 states and 184 transitions. [2021-12-14 23:04:56,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2021-12-14 23:04:56,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2021-12-14 23:04:56,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 161 states and 184 transitions. [2021-12-14 23:04:56,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:04:56,401 INFO L681 BuchiCegarLoop]: Abstraction has 161 states and 184 transitions. [2021-12-14 23:04:56,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states and 184 transitions. [2021-12-14 23:04:56,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 112. [2021-12-14 23:04:56,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 112 states have (on average 1.1428571428571428) internal successors, (128), 111 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:56,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2021-12-14 23:04:56,403 INFO L704 BuchiCegarLoop]: Abstraction has 112 states and 128 transitions. [2021-12-14 23:04:56,404 INFO L587 BuchiCegarLoop]: Abstraction has 112 states and 128 transitions. [2021-12-14 23:04:56,404 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-12-14 23:04:56,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 128 transitions. [2021-12-14 23:04:56,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:04:56,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:04:56,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:04:56,405 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:04:56,405 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:04:56,405 INFO L791 eck$LassoCheckResult]: Stem: 4829#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4803#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 4804#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 4788#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 4789#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4872#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 4792#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4790#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 4791#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 4800#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 4793#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 4794#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 4795#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 4796#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 4799#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 4805#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4806#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 4841#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 4807#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4809#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 4848#L510-5 strlen_#res#1 := strlen_~i~0#1; 4849#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 4820#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 4821#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4879#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 4878#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 4813#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4814#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 4837#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 4838#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4892#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 4891#L510-11 strlen_#res#1 := strlen_~i~0#1; 4890#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 4889#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 4888#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 4845#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 4846#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 4826#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 4850#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 4851#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 4880#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 4876#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 4874#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 4873#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 4831#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 4824#L518-3 [2021-12-14 23:04:56,406 INFO L793 eck$LassoCheckResult]: Loop: 4824#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 4842#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 4823#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 4824#L518-3 [2021-12-14 23:04:56,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:56,406 INFO L85 PathProgramCache]: Analyzing trace with hash -900142205, now seen corresponding path program 3 times [2021-12-14 23:04:56,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:56,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804731763] [2021-12-14 23:04:56,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:56,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:56,514 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-14 23:04:56,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:04:56,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804731763] [2021-12-14 23:04:56,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804731763] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:04:56,515 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:04:56,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 23:04:56,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65534862] [2021-12-14 23:04:56,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:04:56,515 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:04:56,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:56,516 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 5 times [2021-12-14 23:04:56,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:56,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358320398] [2021-12-14 23:04:56,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:56,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:56,520 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:56,524 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:56,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:04:56,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 23:04:56,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 23:04:56,625 INFO L87 Difference]: Start difference. First operand 112 states and 128 transitions. cyclomatic complexity: 27 Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:56,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:04:56,661 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2021-12-14 23:04:56,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 23:04:56,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 145 transitions. [2021-12-14 23:04:56,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:04:56,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 125 states and 141 transitions. [2021-12-14 23:04:56,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2021-12-14 23:04:56,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2021-12-14 23:04:56,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 141 transitions. [2021-12-14 23:04:56,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:04:56,664 INFO L681 BuchiCegarLoop]: Abstraction has 125 states and 141 transitions. [2021-12-14 23:04:56,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 141 transitions. [2021-12-14 23:04:56,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2021-12-14 23:04:56,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 117 states have (on average 1.1367521367521367) internal successors, (133), 116 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:56,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2021-12-14 23:04:56,666 INFO L704 BuchiCegarLoop]: Abstraction has 117 states and 133 transitions. [2021-12-14 23:04:56,666 INFO L587 BuchiCegarLoop]: Abstraction has 117 states and 133 transitions. [2021-12-14 23:04:56,666 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-12-14 23:04:56,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 133 transitions. [2021-12-14 23:04:56,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:04:56,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:04:56,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:04:56,668 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:04:56,668 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:04:56,668 INFO L791 eck$LassoCheckResult]: Stem: 5083#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5055#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 5056#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 5041#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 5042#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 5121#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 5045#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 5043#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 5044#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 5099#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 5100#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 5120#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 5119#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 5118#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 5075#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 5059#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5060#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 5073#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 5074#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5130#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 5129#L510-5 strlen_#res#1 := strlen_~i~0#1; 5128#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 5127#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 5126#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5071#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 5072#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 5067#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5068#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 5148#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 5147#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5146#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 5145#L510-11 strlen_#res#1 := strlen_~i~0#1; 5144#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 5143#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 5142#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 5096#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 5097#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 5094#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 5095#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 5098#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 5151#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 5152#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 5122#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 5123#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 5109#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 5106#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 5104#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 5085#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 5078#L518-3 [2021-12-14 23:04:56,668 INFO L793 eck$LassoCheckResult]: Loop: 5078#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 5093#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 5077#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 5078#L518-3 [2021-12-14 23:04:56,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:56,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1802803372, now seen corresponding path program 1 times [2021-12-14 23:04:56,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:56,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145991535] [2021-12-14 23:04:56,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:56,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:56,792 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-14 23:04:56,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:04:56,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145991535] [2021-12-14 23:04:56,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145991535] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:04:56,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057885441] [2021-12-14 23:04:56,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:56,793 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:04:56,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:56,795 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:04:56,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2021-12-14 23:04:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:56,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-14 23:04:56,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:04:57,062 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-14 23:04:57,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:04:57,229 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-14 23:04:57,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057885441] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:04:57,229 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:04:57,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2021-12-14 23:04:57,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56335313] [2021-12-14 23:04:57,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:04:57,229 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:04:57,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:57,230 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 6 times [2021-12-14 23:04:57,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:57,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418463138] [2021-12-14 23:04:57,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:57,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:57,234 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:57,237 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:57,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:04:57,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-14 23:04:57,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2021-12-14 23:04:57,339 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. cyclomatic complexity: 27 Second operand has 17 states, 17 states have (on average 4.0) internal successors, (68), 17 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:57,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:04:57,512 INFO L93 Difference]: Finished difference Result 166 states and 188 transitions. [2021-12-14 23:04:57,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 23:04:57,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 166 states and 188 transitions. [2021-12-14 23:04:57,514 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-14 23:04:57,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 166 states to 138 states and 158 transitions. [2021-12-14 23:04:57,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2021-12-14 23:04:57,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2021-12-14 23:04:57,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 158 transitions. [2021-12-14 23:04:57,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:04:57,515 INFO L681 BuchiCegarLoop]: Abstraction has 138 states and 158 transitions. [2021-12-14 23:04:57,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 158 transitions. [2021-12-14 23:04:57,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 109. [2021-12-14 23:04:57,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 109 states have (on average 1.1376146788990826) internal successors, (124), 108 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:57,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2021-12-14 23:04:57,517 INFO L704 BuchiCegarLoop]: Abstraction has 109 states and 124 transitions. [2021-12-14 23:04:57,517 INFO L587 BuchiCegarLoop]: Abstraction has 109 states and 124 transitions. [2021-12-14 23:04:57,517 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-12-14 23:04:57,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 124 transitions. [2021-12-14 23:04:57,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:04:57,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:04:57,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:04:57,518 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:04:57,518 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:04:57,518 INFO L791 eck$LassoCheckResult]: Stem: 5681#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5653#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 5654#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 5638#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 5639#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 5640#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 5641#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 5717#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 5644#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 5645#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 5646#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 5647#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 5648#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 5657#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5658#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 5671#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 5659#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5660#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 5719#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 5718#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5691#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 5692#L510-5 strlen_#res#1 := strlen_~i~0#1; 5649#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 5650#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 5702#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5701#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 5687#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 5688#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5668#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 5669#L510-11 strlen_#res#1 := strlen_~i~0#1; 5698#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 5699#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 5655#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 5656#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 5732#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 5731#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 5729#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 5730#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 5728#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 5727#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 5726#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 5685#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 5686#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 5736#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 5737#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 5724#L533 assume !strstr_#t~short17#1; 5723#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 5721#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 5720#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 5683#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 5676#L518-3 [2021-12-14 23:04:57,518 INFO L793 eck$LassoCheckResult]: Loop: 5676#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 5693#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 5675#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 5676#L518-3 [2021-12-14 23:04:57,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:57,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1191678414, now seen corresponding path program 1 times [2021-12-14 23:04:57,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:57,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773957940] [2021-12-14 23:04:57,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:57,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:57,608 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-14 23:04:57,608 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:04:57,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773957940] [2021-12-14 23:04:57,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773957940] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:04:57,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483021948] [2021-12-14 23:04:57,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:57,609 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:04:57,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:57,611 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:04:57,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2021-12-14 23:04:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:57,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-14 23:04:57,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:04:57,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 23:04:57,865 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-14 23:04:57,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:04:57,982 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-14 23:04:57,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483021948] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:04:57,982 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:04:57,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2021-12-14 23:04:57,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887321957] [2021-12-14 23:04:57,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:04:57,983 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:04:57,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:57,984 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 7 times [2021-12-14 23:04:57,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:57,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787684484] [2021-12-14 23:04:57,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:57,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:57,988 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:57,991 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:58,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:04:58,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-14 23:04:58,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2021-12-14 23:04:58,079 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. cyclomatic complexity: 26 Second operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:58,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:04:58,199 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2021-12-14 23:04:58,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 23:04:58,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 148 transitions. [2021-12-14 23:04:58,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:04:58,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 115 states and 130 transitions. [2021-12-14 23:04:58,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2021-12-14 23:04:58,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2021-12-14 23:04:58,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 130 transitions. [2021-12-14 23:04:58,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:04:58,202 INFO L681 BuchiCegarLoop]: Abstraction has 115 states and 130 transitions. [2021-12-14 23:04:58,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 130 transitions. [2021-12-14 23:04:58,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2021-12-14 23:04:58,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 113 states have (on average 1.1327433628318584) internal successors, (128), 112 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:58,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 128 transitions. [2021-12-14 23:04:58,204 INFO L704 BuchiCegarLoop]: Abstraction has 113 states and 128 transitions. [2021-12-14 23:04:58,204 INFO L587 BuchiCegarLoop]: Abstraction has 113 states and 128 transitions. [2021-12-14 23:04:58,204 INFO L425 BuchiCegarLoop]: ======== Iteration 20============ [2021-12-14 23:04:58,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 128 transitions. [2021-12-14 23:04:58,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:04:58,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:04:58,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:04:58,205 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:04:58,206 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:04:58,206 INFO L791 eck$LassoCheckResult]: Stem: 6243#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6219#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 6220#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 6203#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 6204#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 6290#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 6289#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 6288#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 6287#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 6284#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 6282#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 6281#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 6280#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 6279#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 6278#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 6277#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6276#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 6275#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 6274#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6269#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 6272#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 6268#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6266#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 6263#L510-5 strlen_#res#1 := strlen_~i~0#1; 6261#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 6260#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 6259#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6258#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 6250#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 6251#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6230#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 6303#L510-11 strlen_#res#1 := strlen_~i~0#1; 6302#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 6301#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 6300#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 6299#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 6298#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 6297#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 6295#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 6296#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 6294#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 6293#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 6292#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 6248#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 6249#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 6285#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 6286#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 6270#L533 assume !strstr_#t~short17#1; 6267#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 6264#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 6262#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 6245#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 6238#L518-3 [2021-12-14 23:04:58,206 INFO L793 eck$LassoCheckResult]: Loop: 6238#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 6254#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 6237#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 6238#L518-3 [2021-12-14 23:04:58,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:58,206 INFO L85 PathProgramCache]: Analyzing trace with hash 283927796, now seen corresponding path program 2 times [2021-12-14 23:04:58,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:58,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463311666] [2021-12-14 23:04:58,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:58,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:58,369 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-14 23:04:58,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:04:58,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463311666] [2021-12-14 23:04:58,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463311666] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:04:58,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445197282] [2021-12-14 23:04:58,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 23:04:58,369 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:04:58,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:58,375 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:04:58,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2021-12-14 23:04:58,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 23:04:58,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 23:04:58,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-14 23:04:58,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:04:58,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 23:04:58,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:04:58,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-14 23:04:58,590 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 23:04:58,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 23:04:58,788 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-14 23:04:58,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:04:58,992 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-14 23:04:58,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-14 23:04:59,092 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-14 23:04:59,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445197282] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:04:59,092 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:04:59,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2021-12-14 23:04:59,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558925393] [2021-12-14 23:04:59,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:04:59,093 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:04:59,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:59,093 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 8 times [2021-12-14 23:04:59,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:59,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359638444] [2021-12-14 23:04:59,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:59,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:59,098 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:59,101 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:59,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:04:59,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-14 23:04:59,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2021-12-14 23:04:59,203 INFO L87 Difference]: Start difference. First operand 113 states and 128 transitions. cyclomatic complexity: 26 Second operand has 28 states, 28 states have (on average 4.142857142857143) internal successors, (116), 28 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:05:00,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:05:00,239 INFO L93 Difference]: Finished difference Result 310 states and 349 transitions. [2021-12-14 23:05:00,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-12-14 23:05:00,239 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 310 states and 349 transitions. [2021-12-14 23:05:00,241 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2021-12-14 23:05:00,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 310 states to 235 states and 271 transitions. [2021-12-14 23:05:00,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2021-12-14 23:05:00,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2021-12-14 23:05:00,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 235 states and 271 transitions. [2021-12-14 23:05:00,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:05:00,242 INFO L681 BuchiCegarLoop]: Abstraction has 235 states and 271 transitions. [2021-12-14 23:05:00,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states and 271 transitions. [2021-12-14 23:05:00,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 100. [2021-12-14 23:05:00,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 100 states have (on average 1.13) internal successors, (113), 99 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:05:00,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2021-12-14 23:05:00,246 INFO L704 BuchiCegarLoop]: Abstraction has 100 states and 113 transitions. [2021-12-14 23:05:00,246 INFO L587 BuchiCegarLoop]: Abstraction has 100 states and 113 transitions. [2021-12-14 23:05:00,246 INFO L425 BuchiCegarLoop]: ======== Iteration 21============ [2021-12-14 23:05:00,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 113 transitions. [2021-12-14 23:05:00,247 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:05:00,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:05:00,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:05:00,248 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:05:00,248 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:05:00,248 INFO L791 eck$LassoCheckResult]: Stem: 7058#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7034#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 7035#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 7018#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 7019#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 7020#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 7021#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 7074#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 7030#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 7031#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 7022#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 7023#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 7024#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 7025#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 7062#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 7026#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 7027#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 7036#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7037#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 7048#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 7038#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7039#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 7080#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 7075#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7077#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 7072#L510-5 strlen_#res#1 := strlen_~i~0#1; 7073#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 7049#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 7050#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7082#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 7081#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 7043#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7044#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 7047#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 7065#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7045#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 7046#L510-11 strlen_#res#1 := strlen_~i~0#1; 7051#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 7040#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 7032#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 7033#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 7071#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 7069#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 7070#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 7054#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 7055#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 7109#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 7105#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 7088#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 7086#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 7084#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 7083#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 7060#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 7053#L518-3 [2021-12-14 23:05:00,248 INFO L793 eck$LassoCheckResult]: Loop: 7053#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 7068#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 7052#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 7053#L518-3 [2021-12-14 23:05:00,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:00,249 INFO L85 PathProgramCache]: Analyzing trace with hash -131927407, now seen corresponding path program 2 times [2021-12-14 23:05:00,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:00,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027820102] [2021-12-14 23:05:00,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:00,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:05:00,470 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-14 23:05:00,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:05:00,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027820102] [2021-12-14 23:05:00,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027820102] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:05:00,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138729857] [2021-12-14 23:05:00,471 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 23:05:00,471 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:05:00,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:00,473 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:05:00,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2021-12-14 23:05:00,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 23:05:00,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 23:05:00,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-14 23:05:00,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:05:00,841 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-14 23:05:00,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:05:01,151 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-14 23:05:01,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138729857] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:05:01,151 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:05:01,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 30 [2021-12-14 23:05:01,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334750885] [2021-12-14 23:05:01,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:05:01,152 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:05:01,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:01,153 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 9 times [2021-12-14 23:05:01,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:01,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564421275] [2021-12-14 23:05:01,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:01,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:01,156 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:05:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:05:01,159 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:05:01,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:05:01,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-14 23:05:01,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2021-12-14 23:05:01,264 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. cyclomatic complexity: 22 Second operand has 30 states, 30 states have (on average 3.1) internal successors, (93), 30 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:05:01,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:05:01,571 INFO L93 Difference]: Finished difference Result 223 states and 254 transitions. [2021-12-14 23:05:01,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 23:05:01,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 223 states and 254 transitions. [2021-12-14 23:05:01,574 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2021-12-14 23:05:01,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 223 states to 202 states and 232 transitions. [2021-12-14 23:05:01,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2021-12-14 23:05:01,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2021-12-14 23:05:01,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 202 states and 232 transitions. [2021-12-14 23:05:01,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:05:01,576 INFO L681 BuchiCegarLoop]: Abstraction has 202 states and 232 transitions. [2021-12-14 23:05:01,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states and 232 transitions. [2021-12-14 23:05:01,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 103. [2021-12-14 23:05:01,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 1.1262135922330097) internal successors, (116), 102 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:05:01,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2021-12-14 23:05:01,579 INFO L704 BuchiCegarLoop]: Abstraction has 103 states and 116 transitions. [2021-12-14 23:05:01,579 INFO L587 BuchiCegarLoop]: Abstraction has 103 states and 116 transitions. [2021-12-14 23:05:01,579 INFO L425 BuchiCegarLoop]: ======== Iteration 22============ [2021-12-14 23:05:01,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 116 transitions. [2021-12-14 23:05:01,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-14 23:05:01,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:05:01,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:05:01,580 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:05:01,580 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:05:01,581 INFO L791 eck$LassoCheckResult]: Stem: 7737#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7711#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 7712#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 7696#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 7697#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 7698#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 7699#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 7700#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 7709#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 7710#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 7701#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 7702#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 7703#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 7704#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 7754#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 7705#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 7706#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 7715#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7716#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 7727#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 7717#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7718#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 7765#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 7764#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7746#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 7747#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 7755#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7744#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 7745#L510-5 strlen_#res#1 := strlen_~i~0#1; 7707#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 7708#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 7720#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7721#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 7787#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 7786#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7723#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 7726#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 7743#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7724#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 7725#L510-11 strlen_#res#1 := strlen_~i~0#1; 7730#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 7719#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 7713#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 7714#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 7751#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 7749#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 7750#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 7733#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 7734#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 7790#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 7768#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 7769#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 7770#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 7767#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 7766#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 7739#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 7732#L518-3 [2021-12-14 23:05:01,581 INFO L793 eck$LassoCheckResult]: Loop: 7732#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 7748#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 7731#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 7732#L518-3 [2021-12-14 23:05:01,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:05:01,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1792797110, now seen corresponding path program 3 times [2021-12-14 23:05:01,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:05:01,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008841256] [2021-12-14 23:05:01,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:05:01,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:05:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:05:01,687 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-14 23:05:01,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:05:01,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008841256] [2021-12-14 23:05:01,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008841256] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:05:01,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63866169] [2021-12-14 23:05:01,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 23:05:01,688 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:05:01,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:05:01,699 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:05:01,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2021-12-14 23:05:01,854 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-14 23:05:01,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 23:05:01,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-14 23:05:01,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:05:02,238 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-14 23:05:02,238 INFO L328 TraceCheckSpWp]: Computing backward predicates...