./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 f4b24e32 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-?-f4b24e3 [2022-07-14 14:57:58,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 14:57:58,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 14:57:58,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 14:57:58,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 14:57:58,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 14:57:58,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 14:57:58,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 14:57:58,179 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 14:57:58,183 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 14:57:58,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 14:57:58,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 14:57:58,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 14:57:58,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 14:57:58,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 14:57:58,190 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 14:57:58,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 14:57:58,192 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 14:57:58,195 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 14:57:58,199 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 14:57:58,201 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 14:57:58,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 14:57:58,203 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 14:57:58,203 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 14:57:58,205 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 14:57:58,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 14:57:58,210 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 14:57:58,211 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 14:57:58,212 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 14:57:58,212 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 14:57:58,213 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 14:57:58,213 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 14:57:58,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 14:57:58,217 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 14:57:58,217 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 14:57:58,218 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 14:57:58,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 14:57:58,218 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 14:57:58,218 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 14:57:58,218 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 14:57:58,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 14:57:58,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 14:57:58,222 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-14 14:57:58,256 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 14:57:58,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 14:57:58,257 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 14:57:58,257 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 14:57:58,258 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 14:57:58,259 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 14:57:58,259 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 14:57:58,259 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 14:57:58,260 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 14:57:58,260 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 14:57:58,260 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 14:57:58,261 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 14:57:58,261 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 14:57:58,261 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 14:57:58,261 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 14:57:58,261 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 14:57:58,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 14:57:58,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 14:57:58,262 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 14:57:58,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 14:57:58,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 14:57:58,263 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 14:57:58,263 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 14:57:58,263 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 14:57:58,264 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 14:57:58,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 14:57:58,264 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 14:57:58,264 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 14:57:58,265 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 14:57:58,265 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 [2022-07-14 14:57:58,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 14:57:58,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 14:57:58,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 14:57:58,489 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 14:57:58,490 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 14:57:58,491 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strstr.i [2022-07-14 14:57:58,542 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a576a5a4/c8012a96b14b4a24926d29d373ff90e5/FLAG9a504a43b [2022-07-14 14:57:58,992 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 14:57:58,996 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strstr.i [2022-07-14 14:57:59,010 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a576a5a4/c8012a96b14b4a24926d29d373ff90e5/FLAG9a504a43b [2022-07-14 14:57:59,510 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a576a5a4/c8012a96b14b4a24926d29d373ff90e5 [2022-07-14 14:57:59,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 14:57:59,512 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 14:57:59,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 14:57:59,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 14:57:59,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 14:57:59,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 02:57:59" (1/1) ... [2022-07-14 14:57:59,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e328103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:57:59, skipping insertion in model container [2022-07-14 14:57:59,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 02:57:59" (1/1) ... [2022-07-14 14:57:59,520 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 14:57:59,553 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 14:57:59,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 14:57:59,760 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 14:57:59,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 14:57:59,838 INFO L208 MainTranslator]: Completed translation [2022-07-14 14:57:59,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:57:59 WrapperNode [2022-07-14 14:57:59,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 14:57:59,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 14:57:59,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 14:57:59,840 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 14:57:59,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:57:59" (1/1) ... [2022-07-14 14:57:59,867 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:57:59" (1/1) ... [2022-07-14 14:57:59,891 INFO L137 Inliner]: procedures = 116, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 177 [2022-07-14 14:57:59,891 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 14:57:59,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 14:57:59,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 14:57:59,893 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 14:57:59,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:57:59" (1/1) ... [2022-07-14 14:57:59,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:57:59" (1/1) ... [2022-07-14 14:57:59,910 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:57:59" (1/1) ... [2022-07-14 14:57:59,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:57:59" (1/1) ... [2022-07-14 14:57:59,921 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:57:59" (1/1) ... [2022-07-14 14:57:59,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:57:59" (1/1) ... [2022-07-14 14:57:59,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:57:59" (1/1) ... [2022-07-14 14:57:59,929 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 14:57:59,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 14:57:59,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 14:57:59,936 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 14:57:59,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:57:59" (1/1) ... [2022-07-14 14:57:59,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:57:59,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:57:59,960 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) [2022-07-14 14:57:59,969 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 [2022-07-14 14:57:59,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 14:57:59,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 14:57:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 14:57:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 14:57:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 14:57:59,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 14:58:00,061 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 14:58:00,062 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 14:58:00,269 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 14:58:00,273 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 14:58:00,273 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-14 14:58:00,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:58:00 BoogieIcfgContainer [2022-07-14 14:58:00,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 14:58:00,275 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 14:58:00,276 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 14:58:00,278 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 14:58:00,278 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 14:58:00,278 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 02:57:59" (1/3) ... [2022-07-14 14:58:00,279 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b12206b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 02:58:00, skipping insertion in model container [2022-07-14 14:58:00,279 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 14:58:00,279 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:57:59" (2/3) ... [2022-07-14 14:58:00,280 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b12206b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 02:58:00, skipping insertion in model container [2022-07-14 14:58:00,280 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 14:58:00,280 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:58:00" (3/3) ... [2022-07-14 14:58:00,281 INFO L354 chiAutomizerObserver]: Analyzing ICFG strstr.i [2022-07-14 14:58:00,330 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 14:58:00,330 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 14:58:00,330 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 14:58:00,330 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 14:58:00,330 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 14:58:00,330 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 14:58:00,331 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 14:58:00,331 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 14:58:00,339 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) [2022-07-14 14:58:00,354 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 19 [2022-07-14 14:58:00,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:58:00,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:58:00,358 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-14 14:58:00,358 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 14:58:00,358 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 14:58:00,359 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) [2022-07-14 14:58:00,363 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 19 [2022-07-14 14:58:00,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:58:00,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:58:00,363 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-14 14:58:00,363 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 14:58:00,368 INFO L752 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#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; 11#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; 3#L544-3true [2022-07-14 14:58:00,368 INFO L754 eck$LassoCheckResult]: Loop: 3#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; 4#L544-2true main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3#L544-3true [2022-07-14 14:58:00,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:00,379 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2022-07-14 14:58:00,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:00,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674098205] [2022-07-14 14:58:00,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:00,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:00,464 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:00,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:00,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:00,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2022-07-14 14:58:00,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:00,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145458540] [2022-07-14 14:58:00,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:00,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:00,502 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:00,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:00,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:00,519 INFO L85 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2022-07-14 14:58:00,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:00,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248286503] [2022-07-14 14:58:00,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:00,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:00,538 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:00,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:00,734 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:58:00,734 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:58:00,735 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:58:00,735 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:58:00,735 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:58:00,735 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:00,735 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:58:00,735 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:58:00,735 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration1_Lasso [2022-07-14 14:58:00,735 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:58:00,736 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:58:00,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:00,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:00,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:00,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:00,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:00,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:00,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:00,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:00,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:00,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:00,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:00,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:00,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:00,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:00,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:00,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:00,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:01,025 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:58:01,028 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:58:01,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:01,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:01,030 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) [2022-07-14 14:58:01,032 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 [2022-07-14 14:58:01,033 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 [2022-07-14 14:58:01,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:01,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:01,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:01,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:01,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:01,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:01,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:01,055 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:01,073 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 [2022-07-14 14:58:01,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:01,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:01,075 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) [2022-07-14 14:58:01,076 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 [2022-07-14 14:58:01,083 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 [2022-07-14 14:58:01,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:01,089 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:01,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:01,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:01,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:01,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:01,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:01,103 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:01,119 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 [2022-07-14 14:58:01,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:01,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:01,123 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) [2022-07-14 14:58:01,123 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 [2022-07-14 14:58:01,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 [2022-07-14 14:58:01,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:01,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:01,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:01,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:01,135 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:01,135 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:01,150 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:01,168 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 [2022-07-14 14:58:01,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:01,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:01,169 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) [2022-07-14 14:58:01,170 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 [2022-07-14 14:58:01,176 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 [2022-07-14 14:58:01,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:01,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:01,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:01,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:01,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:01,182 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:01,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:01,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:01,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-07-14 14:58:01,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:01,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:01,199 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) [2022-07-14 14:58:01,200 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 [2022-07-14 14:58:01,201 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 [2022-07-14 14:58:01,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:01,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:01,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:01,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:01,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:01,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:01,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:01,216 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:01,231 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 [2022-07-14 14:58:01,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:01,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:01,232 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) [2022-07-14 14:58:01,233 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 [2022-07-14 14:58:01,233 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 [2022-07-14 14:58:01,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:01,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:01,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:01,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:01,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:01,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:01,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:01,253 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:01,270 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 [2022-07-14 14:58:01,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:01,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:01,271 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) [2022-07-14 14:58:01,272 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 [2022-07-14 14:58:01,274 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 [2022-07-14 14:58:01,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:01,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:01,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:01,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:01,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:01,287 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:01,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:01,296 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:01,311 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 [2022-07-14 14:58:01,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:01,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:01,312 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) [2022-07-14 14:58:01,313 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 [2022-07-14 14:58:01,314 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 [2022-07-14 14:58:01,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:01,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:01,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:01,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:01,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:01,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:01,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:01,321 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:01,336 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 [2022-07-14 14:58:01,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:01,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:01,338 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) [2022-07-14 14:58:01,338 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 [2022-07-14 14:58:01,383 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 [2022-07-14 14:58:01,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:01,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:01,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:01,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:01,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:01,392 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:01,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:01,393 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:01,408 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 [2022-07-14 14:58:01,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:01,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:01,409 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) [2022-07-14 14:58:01,410 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 [2022-07-14 14:58:01,411 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 [2022-07-14 14:58:01,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:01,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:01,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:01,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:01,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:01,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:01,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:01,427 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:01,442 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 [2022-07-14 14:58:01,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:01,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:01,443 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) [2022-07-14 14:58:01,444 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 [2022-07-14 14:58:01,447 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 [2022-07-14 14:58:01,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:01,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:01,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:01,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:01,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:01,453 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:01,453 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:01,462 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:01,492 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 [2022-07-14 14:58:01,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:01,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:01,493 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) [2022-07-14 14:58:01,494 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 [2022-07-14 14:58:01,495 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 [2022-07-14 14:58:01,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:01,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:01,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:01,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:01,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:01,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:01,502 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:01,507 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:01,523 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 [2022-07-14 14:58:01,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:01,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:01,525 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) [2022-07-14 14:58:01,525 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 [2022-07-14 14:58:01,526 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 [2022-07-14 14:58:01,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:01,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:01,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:01,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:01,553 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:01,554 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:01,569 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:01,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-07-14 14:58:01,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:01,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:01,585 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) [2022-07-14 14:58:01,586 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 [2022-07-14 14:58:01,599 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 [2022-07-14 14:58:01,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:01,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:01,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:01,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:01,609 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:01,609 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:01,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:01,642 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 [2022-07-14 14:58:01,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:01,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:01,644 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) [2022-07-14 14:58:01,660 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 [2022-07-14 14:58:01,660 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 [2022-07-14 14:58:01,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:01,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:01,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:01,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:01,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:01,668 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:01,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:01,679 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:01,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-07-14 14:58:01,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:01,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:01,703 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) [2022-07-14 14:58:01,704 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 [2022-07-14 14:58:01,705 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 [2022-07-14 14:58:01,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:01,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:01,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:01,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:01,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:01,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:01,728 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:01,744 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 [2022-07-14 14:58:01,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:01,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:01,745 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) [2022-07-14 14:58:01,746 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 [2022-07-14 14:58:01,747 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 [2022-07-14 14:58:01,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:01,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:01,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:01,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:01,757 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:01,758 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:01,770 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:58:01,788 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-07-14 14:58:01,788 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2022-07-14 14:58:01,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:01,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:01,790 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) [2022-07-14 14:58:01,817 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:58:01,823 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 [2022-07-14 14:58:01,833 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 14:58:01,834 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:58:01,834 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 [] [2022-07-14 14:58:01,861 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 [2022-07-14 14:58:01,868 INFO L293 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-07-14 14:58:01,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:01,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:58:01,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:58:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:01,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 14:58:01,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:58:01,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:58:01,978 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 [2022-07-14 14:58:01,979 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) [2022-07-14 14:58:02,017 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. [2022-07-14 14:58:02,018 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 [2022-07-14 14:58:02,021 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) [2022-07-14 14:58:02,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-07-14 14:58:02,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 112 transitions. Stem has 3 letters. Loop has 2 letters. [2022-07-14 14:58:02,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:58:02,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 112 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-14 14:58:02,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:58:02,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 112 transitions. Stem has 3 letters. Loop has 4 letters. [2022-07-14 14:58:02,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:58:02,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 165 transitions. [2022-07-14 14:58:02,027 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2022-07-14 14:58:02,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 34 states and 44 transitions. [2022-07-14 14:58:02,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2022-07-14 14:58:02,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2022-07-14 14:58:02,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2022-07-14 14:58:02,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:58:02,030 INFO L369 hiAutomatonCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-07-14 14:58:02,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2022-07-14 14:58:02,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-14 14:58:02,045 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) [2022-07-14 14:58:02,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2022-07-14 14:58:02,046 INFO L392 hiAutomatonCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-07-14 14:58:02,046 INFO L374 stractBuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-07-14 14:58:02,046 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 14:58:02,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2022-07-14 14:58:02,046 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2022-07-14 14:58:02,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:58:02,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:58:02,057 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-14 14:58:02,058 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 14:58:02,058 INFO L752 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 [2022-07-14 14:58:02,058 INFO L754 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 [2022-07-14 14:58:02,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:02,058 INFO L85 PathProgramCache]: Analyzing trace with hash 889572430, now seen corresponding path program 1 times [2022-07-14 14:58:02,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:02,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258836643] [2022-07-14 14:58:02,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:02,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:02,083 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:02,087 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 [2022-07-14 14:58:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:02,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:02,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:02,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2051, now seen corresponding path program 1 times [2022-07-14 14:58:02,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:02,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202663557] [2022-07-14 14:58:02,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:02,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:02,142 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:02,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:02,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:02,150 INFO L85 PathProgramCache]: Analyzing trace with hash 180614416, now seen corresponding path program 1 times [2022-07-14 14:58:02,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:02,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268400354] [2022-07-14 14:58:02,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:02,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:02,168 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:02,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:02,424 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:58:02,424 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:58:02,424 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:58:02,424 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:58:02,424 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:58:02,424 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:02,424 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:58:02,424 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:58:02,424 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration2_Lasso [2022-07-14 14:58:02,424 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:58:02,424 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:58:02,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:02,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:02,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:02,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:02,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:02,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:02,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:02,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:02,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:02,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:02,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:02,826 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:58:02,826 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:58:02,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:02,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:02,827 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) [2022-07-14 14:58:02,828 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 [2022-07-14 14:58:02,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 [2022-07-14 14:58:02,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:02,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:02,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:02,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:02,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:02,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:02,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:02,855 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:02,877 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 [2022-07-14 14:58:02,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:02,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:02,879 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) [2022-07-14 14:58:02,880 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 [2022-07-14 14:58:02,881 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 [2022-07-14 14:58:02,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:02,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:02,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:02,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:02,888 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:02,888 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:02,904 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:02,921 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 [2022-07-14 14:58:02,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:02,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:02,922 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) [2022-07-14 14:58:02,923 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 [2022-07-14 14:58:02,924 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 [2022-07-14 14:58:02,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:02,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:02,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:02,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:02,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:02,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:02,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:02,951 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:02,969 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 [2022-07-14 14:58:02,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:02,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:02,971 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) [2022-07-14 14:58:02,972 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 [2022-07-14 14:58:03,004 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 [2022-07-14 14:58:03,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:03,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:03,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:03,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:03,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:03,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:03,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:03,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:03,038 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 [2022-07-14 14:58:03,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:03,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:03,039 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) [2022-07-14 14:58:03,041 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 [2022-07-14 14:58:03,076 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 [2022-07-14 14:58:03,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:03,082 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:03,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:03,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:03,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:03,083 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:03,083 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:03,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:03,098 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 [2022-07-14 14:58:03,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:03,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:03,100 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) [2022-07-14 14:58:03,100 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 [2022-07-14 14:58:03,104 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 [2022-07-14 14:58:03,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:03,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:03,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:03,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:03,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:03,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:03,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:03,127 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:03,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-14 14:58:03,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:03,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:03,144 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) [2022-07-14 14:58:03,144 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 [2022-07-14 14:58:03,146 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 [2022-07-14 14:58:03,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:03,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:03,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:03,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:03,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:03,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:03,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:03,162 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:03,178 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 [2022-07-14 14:58:03,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:03,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:03,179 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) [2022-07-14 14:58:03,180 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 [2022-07-14 14:58:03,180 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 [2022-07-14 14:58:03,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:03,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:03,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:03,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:03,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:03,187 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:03,187 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:03,207 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:03,223 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 [2022-07-14 14:58:03,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:03,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:03,224 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) [2022-07-14 14:58:03,225 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 [2022-07-14 14:58:03,226 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 [2022-07-14 14:58:03,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:03,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:03,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:03,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:03,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:03,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:03,251 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:03,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-14 14:58:03,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:03,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:03,271 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) [2022-07-14 14:58:03,272 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 [2022-07-14 14:58:03,273 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 [2022-07-14 14:58:03,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:03,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:03,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:03,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:03,280 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:03,280 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:03,291 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:03,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-14 14:58:03,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:03,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:03,310 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) [2022-07-14 14:58:03,311 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 [2022-07-14 14:58:03,312 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 [2022-07-14 14:58:03,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:03,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:03,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:03,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:03,326 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:03,326 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:03,342 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:58:03,356 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-07-14 14:58:03,356 INFO L444 ModelExtractionUtils]: 12 out of 40 variables were initially zero. Simplification set additionally 25 variables to zero. [2022-07-14 14:58:03,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:03,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:03,357 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) [2022-07-14 14:58:03,358 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 [2022-07-14 14:58:03,359 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:58:03,389 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 14:58:03,389 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:58:03,389 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 [] [2022-07-14 14:58:03,409 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 [2022-07-14 14:58:03,426 INFO L293 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2022-07-14 14:58:03,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:03,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:58:03,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:58:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:03,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 14:58:03,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:58:03,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:58:03,476 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 [2022-07-14 14:58:03,476 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) [2022-07-14 14:58:03,493 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. [2022-07-14 14:58:03,503 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 [2022-07-14 14:58:03,504 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) [2022-07-14 14:58:03,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-07-14 14:58:03,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 6 letters. Loop has 2 letters. [2022-07-14 14:58:03,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:58:03,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-14 14:58:03,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:58:03,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 6 letters. Loop has 4 letters. [2022-07-14 14:58:03,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:58:03,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 81 transitions. [2022-07-14 14:58:03,506 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2022-07-14 14:58:03,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 35 states and 46 transitions. [2022-07-14 14:58:03,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-07-14 14:58:03,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2022-07-14 14:58:03,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 46 transitions. [2022-07-14 14:58:03,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:58:03,506 INFO L369 hiAutomatonCegarLoop]: Abstraction has 35 states and 46 transitions. [2022-07-14 14:58:03,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 46 transitions. [2022-07-14 14:58:03,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-07-14 14:58:03,508 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) [2022-07-14 14:58:03,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2022-07-14 14:58:03,508 INFO L392 hiAutomatonCegarLoop]: Abstraction has 35 states and 46 transitions. [2022-07-14 14:58:03,508 INFO L374 stractBuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2022-07-14 14:58:03,508 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 14:58:03,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 46 transitions. [2022-07-14 14:58:03,509 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2022-07-14 14:58:03,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:58:03,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:58:03,511 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:58:03,511 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:58:03,511 INFO L752 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 [2022-07-14 14:58:03,511 INFO L754 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 [2022-07-14 14:58:03,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:03,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1304077847, now seen corresponding path program 1 times [2022-07-14 14:58:03,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:03,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829679652] [2022-07-14 14:58:03,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:03,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:03,554 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:03,565 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 [2022-07-14 14:58:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:03,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:03,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:03,577 INFO L85 PathProgramCache]: Analyzing trace with hash 78610, now seen corresponding path program 1 times [2022-07-14 14:58:03,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:03,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302042498] [2022-07-14 14:58:03,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:03,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:03,582 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:03,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:03,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:03,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1803996476, now seen corresponding path program 1 times [2022-07-14 14:58:03,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:03,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519647478] [2022-07-14 14:58:03,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:03,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:03,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:58:03,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:58:03,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519647478] [2022-07-14 14:58:03,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519647478] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:58:03,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:58:03,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 14:58:03,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170465820] [2022-07-14 14:58:03,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:58:03,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:58:03,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 14:58:03,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 14:58:03,722 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) [2022-07-14 14:58:03,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:58:03,849 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-07-14 14:58:03,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 14:58:03,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 76 transitions. [2022-07-14 14:58:03,851 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 27 [2022-07-14 14:58:03,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 76 transitions. [2022-07-14 14:58:03,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2022-07-14 14:58:03,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2022-07-14 14:58:03,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 76 transitions. [2022-07-14 14:58:03,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:58:03,852 INFO L369 hiAutomatonCegarLoop]: Abstraction has 59 states and 76 transitions. [2022-07-14 14:58:03,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 76 transitions. [2022-07-14 14:58:03,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2022-07-14 14:58:03,853 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) [2022-07-14 14:58:03,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-07-14 14:58:03,854 INFO L392 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-07-14 14:58:03,854 INFO L374 stractBuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-07-14 14:58:03,854 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 14:58:03,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2022-07-14 14:58:03,854 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2022-07-14 14:58:03,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:58:03,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:58:03,855 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:58:03,855 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:58:03,855 INFO L752 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 [2022-07-14 14:58:03,855 INFO L754 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 [2022-07-14 14:58:03,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:03,855 INFO L85 PathProgramCache]: Analyzing trace with hash -911639398, now seen corresponding path program 1 times [2022-07-14 14:58:03,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:03,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64921218] [2022-07-14 14:58:03,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:03,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:03,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:58:03,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:58:03,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64921218] [2022-07-14 14:58:03,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64921218] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:58:03,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:58:03,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 14:58:03,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385947553] [2022-07-14 14:58:03,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:58:03,896 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:58:03,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:03,896 INFO L85 PathProgramCache]: Analyzing trace with hash 100456, now seen corresponding path program 1 times [2022-07-14 14:58:03,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:03,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479529744] [2022-07-14 14:58:03,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:03,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:03,899 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:03,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:03,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:58:03,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 14:58:03,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 14:58:03,932 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) [2022-07-14 14:58:03,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:58:03,950 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2022-07-14 14:58:03,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 14:58:03,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2022-07-14 14:58:03,952 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2022-07-14 14:58:03,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 49 transitions. [2022-07-14 14:58:03,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-07-14 14:58:03,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2022-07-14 14:58:03,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2022-07-14 14:58:03,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:58:03,954 INFO L369 hiAutomatonCegarLoop]: Abstraction has 39 states and 49 transitions. [2022-07-14 14:58:03,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2022-07-14 14:58:03,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-07-14 14:58:03,957 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) [2022-07-14 14:58:03,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2022-07-14 14:58:03,958 INFO L392 hiAutomatonCegarLoop]: Abstraction has 39 states and 49 transitions. [2022-07-14 14:58:03,958 INFO L374 stractBuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2022-07-14 14:58:03,959 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 14:58:03,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 49 transitions. [2022-07-14 14:58:03,959 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2022-07-14 14:58:03,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:58:03,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:58:03,959 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:58:03,959 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:58:03,960 INFO L752 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 [2022-07-14 14:58:03,960 INFO L754 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 [2022-07-14 14:58:03,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:03,960 INFO L85 PathProgramCache]: Analyzing trace with hash -909922795, now seen corresponding path program 1 times [2022-07-14 14:58:03,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:03,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463664919] [2022-07-14 14:58:03,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:03,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:03,984 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:03,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:04,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:04,000 INFO L85 PathProgramCache]: Analyzing trace with hash 78610, now seen corresponding path program 2 times [2022-07-14 14:58:04,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:04,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550667697] [2022-07-14 14:58:04,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:04,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:04,003 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:04,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:04,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:04,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1971331970, now seen corresponding path program 1 times [2022-07-14 14:58:04,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:04,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84406608] [2022-07-14 14:58:04,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:04,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:04,015 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:04,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:04,590 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:58:04,590 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:58:04,590 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:58:04,590 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:58:04,591 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:58:04,591 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:04,591 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:58:04,591 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:58:04,591 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration5_Lasso [2022-07-14 14:58:04,591 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:58:04,591 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:58:04,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:04,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:05,381 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:58:05,381 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:58:05,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:05,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:05,382 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) [2022-07-14 14:58:05,386 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 [2022-07-14 14:58:05,387 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 [2022-07-14 14:58:05,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:05,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:05,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:05,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:05,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:05,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:05,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:05,396 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:05,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-14 14:58:05,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:05,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:05,412 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) [2022-07-14 14:58:05,412 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 [2022-07-14 14:58:05,414 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 [2022-07-14 14:58:05,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:05,419 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:05,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:05,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:05,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:05,419 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:05,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:05,420 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:05,435 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 [2022-07-14 14:58:05,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:05,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:05,436 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) [2022-07-14 14:58:05,441 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 [2022-07-14 14:58:05,442 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 [2022-07-14 14:58:05,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:05,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:05,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:05,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:05,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:05,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:05,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:05,448 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:05,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-14 14:58:05,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:05,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:05,465 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) [2022-07-14 14:58:05,466 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 [2022-07-14 14:58:05,467 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 [2022-07-14 14:58:05,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:05,472 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:05,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:05,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:05,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:05,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:05,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:05,488 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:05,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-07-14 14:58:05,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:05,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:05,504 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) [2022-07-14 14:58:05,505 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 [2022-07-14 14:58:05,507 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 [2022-07-14 14:58:05,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:05,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:05,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:05,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:05,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:05,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:05,530 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:05,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-14 14:58:05,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:05,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:05,547 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) [2022-07-14 14:58:05,549 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 [2022-07-14 14:58:05,550 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 [2022-07-14 14:58:05,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:05,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:05,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:05,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:05,562 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:05,563 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:05,579 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:05,596 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 [2022-07-14 14:58:05,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:05,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:05,598 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) [2022-07-14 14:58:05,600 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 [2022-07-14 14:58:05,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:05,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:05,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:05,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:05,608 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:05,608 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:05,612 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 [2022-07-14 14:58:05,619 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:05,637 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 [2022-07-14 14:58:05,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:05,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:05,638 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) [2022-07-14 14:58:05,640 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 [2022-07-14 14:58:05,641 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 [2022-07-14 14:58:05,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:05,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:05,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:05,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:05,647 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:05,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:05,663 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:05,681 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 [2022-07-14 14:58:05,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:05,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:05,682 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) [2022-07-14 14:58:05,686 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 [2022-07-14 14:58:05,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:05,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:05,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:05,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:05,693 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:05,693 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:05,697 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 [2022-07-14 14:58:05,706 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:05,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-07-14 14:58:05,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:05,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:05,729 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) [2022-07-14 14:58:05,730 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 [2022-07-14 14:58:05,731 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 [2022-07-14 14:58:05,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:05,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:05,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:05,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:05,739 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:05,739 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:05,742 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:05,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-07-14 14:58:05,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:05,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:05,759 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) [2022-07-14 14:58:05,760 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 [2022-07-14 14:58:05,762 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 [2022-07-14 14:58:05,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:05,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:05,767 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 14:58:05,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:05,771 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-07-14 14:58:05,771 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-14 14:58:05,785 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:05,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-07-14 14:58:05,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:05,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:05,802 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) [2022-07-14 14:58:05,803 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 [2022-07-14 14:58:05,804 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 [2022-07-14 14:58:05,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:05,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:05,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:05,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:05,817 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:05,817 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:05,839 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:58:05,864 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-14 14:58:05,864 INFO L444 ModelExtractionUtils]: 10 out of 55 variables were initially zero. Simplification set additionally 42 variables to zero. [2022-07-14 14:58:05,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:05,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:05,867 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) [2022-07-14 14:58:05,868 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 [2022-07-14 14:58:05,870 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:58:05,883 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 14:58:05,883 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:58:05,884 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strlen_~s#1.base)_1, ULTIMATE.start_strlen_~s#1.offset) = 1*v_rep(select #length ULTIMATE.start_strlen_~s#1.base)_1 - 1*ULTIMATE.start_strlen_~s#1.offset Supporting invariants [] [2022-07-14 14:58:05,902 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 [2022-07-14 14:58:05,934 INFO L293 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2022-07-14 14:58:05,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:05,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:58:05,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:58:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:05,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 14:58:05,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:58:05,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:58:05,997 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 [2022-07-14 14:58:05,997 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 49 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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) [2022-07-14 14:58:06,014 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 49 transitions. cyclomatic complexity: 15. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 5 states. [2022-07-14 14:58:06,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-14 14:58:06,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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) [2022-07-14 14:58:06,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-07-14 14:58:06,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 11 letters. Loop has 3 letters. [2022-07-14 14:58:06,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:58:06,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 14 letters. Loop has 3 letters. [2022-07-14 14:58:06,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:58:06,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 11 letters. Loop has 6 letters. [2022-07-14 14:58:06,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:58:06,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 57 transitions. [2022-07-14 14:58:06,020 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-07-14 14:58:06,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 41 states and 52 transitions. [2022-07-14 14:58:06,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-07-14 14:58:06,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2022-07-14 14:58:06,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 52 transitions. [2022-07-14 14:58:06,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:58:06,025 INFO L369 hiAutomatonCegarLoop]: Abstraction has 41 states and 52 transitions. [2022-07-14 14:58:06,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 52 transitions. [2022-07-14 14:58:06,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2022-07-14 14:58:06,028 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) [2022-07-14 14:58:06,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2022-07-14 14:58:06,031 INFO L392 hiAutomatonCegarLoop]: Abstraction has 40 states and 51 transitions. [2022-07-14 14:58:06,031 INFO L374 stractBuchiCegarLoop]: Abstraction has 40 states and 51 transitions. [2022-07-14 14:58:06,031 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-14 14:58:06,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 51 transitions. [2022-07-14 14:58:06,031 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-07-14 14:58:06,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:58:06,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:58:06,032 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:58:06,032 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:58:06,032 INFO L752 eck$LassoCheckResult]: Stem: 809#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 788#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; 789#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; 775#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 776#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; 787#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; 779#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 780#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; 784#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 792#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 793#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 811#L510-5 strlen_#res#1 := strlen_~i~0#1; 785#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; 786#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 797#L510-10 [2022-07-14 14:58:06,032 INFO L754 eck$LassoCheckResult]: Loop: 797#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 798#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; 802#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; 797#L510-10 [2022-07-14 14:58:06,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:06,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1526227897, now seen corresponding path program 1 times [2022-07-14 14:58:06,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:06,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388055538] [2022-07-14 14:58:06,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:06,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:06,048 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:06,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:06,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:06,066 INFO L85 PathProgramCache]: Analyzing trace with hash 100456, now seen corresponding path program 2 times [2022-07-14 14:58:06,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:06,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176459161] [2022-07-14 14:58:06,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:06,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:06,069 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:06,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:06,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:06,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1331413406, now seen corresponding path program 1 times [2022-07-14 14:58:06,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:06,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819317046] [2022-07-14 14:58:06,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:06,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:06,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:58:06,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:58:06,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819317046] [2022-07-14 14:58:06,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819317046] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:58:06,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:58:06,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 14:58:06,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056862923] [2022-07-14 14:58:06,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:58:06,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:58:06,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 14:58:06,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-14 14:58:06,225 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) [2022-07-14 14:58:06,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-07-14 14:58:06,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:58:06,387 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2022-07-14 14:58:06,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 14:58:06,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 104 transitions. [2022-07-14 14:58:06,388 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2022-07-14 14:58:06,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 82 states and 104 transitions. [2022-07-14 14:58:06,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2022-07-14 14:58:06,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2022-07-14 14:58:06,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 104 transitions. [2022-07-14 14:58:06,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:58:06,389 INFO L369 hiAutomatonCegarLoop]: Abstraction has 82 states and 104 transitions. [2022-07-14 14:58:06,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 104 transitions. [2022-07-14 14:58:06,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 60. [2022-07-14 14:58:06,390 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) [2022-07-14 14:58:06,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2022-07-14 14:58:06,391 INFO L392 hiAutomatonCegarLoop]: Abstraction has 60 states and 76 transitions. [2022-07-14 14:58:06,391 INFO L374 stractBuchiCegarLoop]: Abstraction has 60 states and 76 transitions. [2022-07-14 14:58:06,391 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-14 14:58:06,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 76 transitions. [2022-07-14 14:58:06,391 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-07-14 14:58:06,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:58:06,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:58:06,392 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:58:06,392 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:58:06,392 INFO L752 eck$LassoCheckResult]: Stem: 958#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 937#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; 938#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; 923#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; 925#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 926#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 927#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; 980#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; 928#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 929#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; 933#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 941#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 942#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 964#L510-5 strlen_#res#1 := strlen_~i~0#1; 934#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; 935#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 946#L510-10 [2022-07-14 14:58:06,392 INFO L754 eck$LassoCheckResult]: Loop: 946#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 947#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; 960#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; 946#L510-10 [2022-07-14 14:58:06,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:06,392 INFO L85 PathProgramCache]: Analyzing trace with hash -432721371, now seen corresponding path program 1 times [2022-07-14 14:58:06,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:06,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662084268] [2022-07-14 14:58:06,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:06,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:06,399 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:06,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:06,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:06,407 INFO L85 PathProgramCache]: Analyzing trace with hash 100456, now seen corresponding path program 3 times [2022-07-14 14:58:06,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:06,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182627373] [2022-07-14 14:58:06,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:06,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:06,409 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:06,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:06,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:06,411 INFO L85 PathProgramCache]: Analyzing trace with hash -2005437500, now seen corresponding path program 1 times [2022-07-14 14:58:06,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:06,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844951829] [2022-07-14 14:58:06,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:06,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:06,432 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:06,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:07,170 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:58:07,171 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:58:07,171 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:58:07,171 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:58:07,171 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:58:07,171 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:07,171 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:58:07,171 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:58:07,171 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration7_Lasso [2022-07-14 14:58:07,171 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:58:07,171 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:58:07,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:07,939 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:58:07,939 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:58:07,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:07,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:07,941 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) [2022-07-14 14:58:07,941 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 [2022-07-14 14:58:07,943 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 [2022-07-14 14:58:07,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:07,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:07,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:07,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:07,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:07,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:07,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:07,960 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:07,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-07-14 14:58:07,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:07,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:07,978 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) [2022-07-14 14:58:07,979 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 [2022-07-14 14:58:07,980 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 [2022-07-14 14:58:07,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:07,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:07,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:07,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:07,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:07,985 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:07,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:07,986 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:08,001 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 [2022-07-14 14:58:08,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,002 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) [2022-07-14 14:58:08,002 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 [2022-07-14 14:58:08,004 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 [2022-07-14 14:58:08,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:08,009 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:08,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:08,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:08,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:08,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:08,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:08,010 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:08,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-07-14 14:58:08,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,026 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) [2022-07-14 14:58:08,027 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 [2022-07-14 14:58:08,028 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 [2022-07-14 14:58:08,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:08,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:08,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:08,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:08,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:08,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:08,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:08,049 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:08,064 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 [2022-07-14 14:58:08,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,065 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) [2022-07-14 14:58:08,065 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 [2022-07-14 14:58:08,067 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 [2022-07-14 14:58:08,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:08,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:08,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:08,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:08,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:08,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:08,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:08,080 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:08,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-07-14 14:58:08,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,096 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) [2022-07-14 14:58:08,097 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 [2022-07-14 14:58:08,099 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 [2022-07-14 14:58:08,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:08,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:08,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:08,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:08,105 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:08,105 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:08,107 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:08,123 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 [2022-07-14 14:58:08,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,125 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) [2022-07-14 14:58:08,125 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 [2022-07-14 14:58:08,126 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 [2022-07-14 14:58:08,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:08,131 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:08,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:08,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:08,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:08,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:08,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:08,132 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:08,147 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 [2022-07-14 14:58:08,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,148 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) [2022-07-14 14:58:08,149 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 [2022-07-14 14:58:08,150 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 [2022-07-14 14:58:08,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:08,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:08,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:08,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:08,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:08,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:08,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:08,156 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:08,170 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 [2022-07-14 14:58:08,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,172 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) [2022-07-14 14:58:08,172 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 [2022-07-14 14:58:08,174 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 [2022-07-14 14:58:08,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:08,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:08,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:08,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:08,180 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:08,180 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:08,181 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:08,196 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 [2022-07-14 14:58:08,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,197 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) [2022-07-14 14:58:08,197 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 [2022-07-14 14:58:08,199 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 [2022-07-14 14:58:08,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:08,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:08,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:08,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:08,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:08,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:08,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:08,220 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:08,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2022-07-14 14:58:08,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,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) [2022-07-14 14:58:08,236 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 [2022-07-14 14:58:08,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 [2022-07-14 14:58:08,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:08,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:08,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:08,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:08,244 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:08,245 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:08,246 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:08,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2022-07-14 14:58:08,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,264 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) [2022-07-14 14:58:08,264 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 [2022-07-14 14:58:08,265 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 [2022-07-14 14:58:08,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:08,271 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:08,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:08,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:08,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:08,271 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:08,272 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:08,272 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:08,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-07-14 14:58:08,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,289 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) [2022-07-14 14:58:08,289 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 [2022-07-14 14:58:08,291 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 [2022-07-14 14:58:08,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:08,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:08,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:08,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:08,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:08,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:08,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:08,297 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:08,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 [2022-07-14 14:58:08,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,316 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) [2022-07-14 14:58:08,316 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 [2022-07-14 14:58:08,317 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 [2022-07-14 14:58:08,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:08,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:08,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:08,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:08,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:08,322 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:08,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:08,323 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:08,337 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 [2022-07-14 14:58:08,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,338 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) [2022-07-14 14:58:08,339 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 [2022-07-14 14:58:08,339 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 [2022-07-14 14:58:08,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:08,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:08,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:08,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:08,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:08,344 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:08,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:08,345 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:08,359 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 [2022-07-14 14:58:08,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,361 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) [2022-07-14 14:58:08,361 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 [2022-07-14 14:58:08,363 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 [2022-07-14 14:58:08,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:08,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:08,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:08,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:08,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:08,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:08,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:08,369 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:08,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-07-14 14:58:08,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,385 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) [2022-07-14 14:58:08,385 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 [2022-07-14 14:58:08,386 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 [2022-07-14 14:58:08,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:08,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:08,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:08,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:08,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:08,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:08,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:08,392 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:08,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-07-14 14:58:08,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,408 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) [2022-07-14 14:58:08,408 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 [2022-07-14 14:58:08,409 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 [2022-07-14 14:58:08,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:08,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:08,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:08,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:08,415 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:08,415 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:08,417 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:08,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-07-14 14:58:08,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,432 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) [2022-07-14 14:58:08,433 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 [2022-07-14 14:58:08,434 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 [2022-07-14 14:58:08,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:08,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:08,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:08,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:08,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:08,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:08,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:08,441 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:08,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2022-07-14 14:58:08,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,457 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) [2022-07-14 14:58:08,458 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 [2022-07-14 14:58:08,459 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 [2022-07-14 14:58:08,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:08,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:08,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:08,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:08,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:08,465 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:08,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:08,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-07-14 14:58:08,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,483 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) [2022-07-14 14:58:08,483 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 [2022-07-14 14:58:08,484 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 [2022-07-14 14:58:08,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:08,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:08,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:08,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:08,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:08,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:08,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:08,491 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:08,506 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 [2022-07-14 14:58:08,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,507 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) [2022-07-14 14:58:08,508 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 [2022-07-14 14:58:08,509 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 [2022-07-14 14:58:08,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:08,514 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:08,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:08,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:08,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:08,514 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:08,514 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:08,523 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:08,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2022-07-14 14:58:08,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,539 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) [2022-07-14 14:58:08,541 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 [2022-07-14 14:58:08,543 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 [2022-07-14 14:58:08,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:08,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:08,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:08,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:08,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:08,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:08,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:08,567 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:08,583 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 [2022-07-14 14:58:08,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,584 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) [2022-07-14 14:58:08,585 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 [2022-07-14 14:58:08,587 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 [2022-07-14 14:58:08,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:08,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:08,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:08,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:08,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:08,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:08,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:08,615 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:08,630 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 [2022-07-14 14:58:08,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,631 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) [2022-07-14 14:58:08,632 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 [2022-07-14 14:58:08,633 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 [2022-07-14 14:58:08,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:08,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:08,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:08,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:08,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:08,647 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:08,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:08,655 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:08,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2022-07-14 14:58:08,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,671 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) [2022-07-14 14:58:08,671 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 [2022-07-14 14:58:08,673 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 [2022-07-14 14:58:08,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:08,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:08,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:08,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:08,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:08,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:08,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:08,699 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:08,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2022-07-14 14:58:08,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,723 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) [2022-07-14 14:58:08,723 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 [2022-07-14 14:58:08,725 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 [2022-07-14 14:58:08,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:08,730 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:08,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:08,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:08,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:08,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:08,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:08,731 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:08,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2022-07-14 14:58:08,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,747 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) [2022-07-14 14:58:08,747 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 [2022-07-14 14:58:08,748 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 [2022-07-14 14:58:08,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:08,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:08,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:08,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:08,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:08,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:08,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:08,755 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:08,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2022-07-14 14:58:08,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,778 INFO L229 MonitoredProcess]: Starting monitored process 73 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) [2022-07-14 14:58:08,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-07-14 14:58:08,780 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 [2022-07-14 14:58:08,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:08,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:08,785 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 14:58:08,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:08,789 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-07-14 14:58:08,789 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-14 14:58:08,795 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:08,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2022-07-14 14:58:08,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,811 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) [2022-07-14 14:58:08,811 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 [2022-07-14 14:58:08,813 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 [2022-07-14 14:58:08,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:08,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:08,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:08,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:08,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:08,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:08,820 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:08,835 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 [2022-07-14 14:58:08,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,836 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) [2022-07-14 14:58:08,836 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 [2022-07-14 14:58:08,838 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 [2022-07-14 14:58:08,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:08,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:08,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:08,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:08,845 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:08,846 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:08,849 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:08,864 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 [2022-07-14 14:58:08,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,865 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) [2022-07-14 14:58:08,865 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 [2022-07-14 14:58:08,867 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 [2022-07-14 14:58:08,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:08,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:08,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:08,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:08,880 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:08,880 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:08,900 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:58:08,943 INFO L443 ModelExtractionUtils]: Simplification made 31 calls to the SMT solver. [2022-07-14 14:58:08,943 INFO L444 ModelExtractionUtils]: 22 out of 55 variables were initially zero. Simplification set additionally 30 variables to zero. [2022-07-14 14:58:08,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:08,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:08,944 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) [2022-07-14 14:58:08,945 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 [2022-07-14 14:58:08,946 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:58:08,951 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 14:58:08,951 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:58:08,952 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlen_~s#1.offset, v_rep(select #length ULTIMATE.start_main_~hay~0#1.base)_3) = -1*ULTIMATE.start_strlen_~s#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~hay~0#1.base)_3 Supporting invariants [] [2022-07-14 14:58:08,966 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 [2022-07-14 14:58:09,006 INFO L293 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2022-07-14 14:58:09,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:09,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 14:58:09,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:58:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:09,109 WARN L261 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 14:58:09,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:58:09,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:58:09,146 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 [2022-07-14 14:58:09,146 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) [2022-07-14 14:58:09,199 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. [2022-07-14 14:58:09,200 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 [2022-07-14 14:58:09,201 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) [2022-07-14 14:58:09,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-07-14 14:58:09,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 56 transitions. Stem has 16 letters. Loop has 3 letters. [2022-07-14 14:58:09,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:58:09,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 56 transitions. Stem has 19 letters. Loop has 3 letters. [2022-07-14 14:58:09,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:58:09,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 56 transitions. Stem has 16 letters. Loop has 6 letters. [2022-07-14 14:58:09,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:58:09,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 114 transitions. [2022-07-14 14:58:09,202 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2022-07-14 14:58:09,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 74 states and 94 transitions. [2022-07-14 14:58:09,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2022-07-14 14:58:09,203 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2022-07-14 14:58:09,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 94 transitions. [2022-07-14 14:58:09,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:58:09,203 INFO L369 hiAutomatonCegarLoop]: Abstraction has 74 states and 94 transitions. [2022-07-14 14:58:09,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 94 transitions. [2022-07-14 14:58:09,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2022-07-14 14:58:09,204 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) [2022-07-14 14:58:09,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2022-07-14 14:58:09,205 INFO L392 hiAutomatonCegarLoop]: Abstraction has 61 states and 78 transitions. [2022-07-14 14:58:09,205 INFO L374 stractBuchiCegarLoop]: Abstraction has 61 states and 78 transitions. [2022-07-14 14:58:09,205 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-14 14:58:09,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 78 transitions. [2022-07-14 14:58:09,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-07-14 14:58:09,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:58:09,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:58:09,206 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:58:09,206 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-14 14:58:09,206 INFO L752 eck$LassoCheckResult]: Stem: 1264#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1243#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; 1244#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; 1227#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 1228#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; 1240#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; 1232#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 1233#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; 1237#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1245#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1246#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 1266#L510-5 strlen_#res#1 := strlen_~i~0#1; 1238#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; 1239#L509-2 assume strlen_~s#1.base == 0 && strlen_~s#1.offset == 0;strlen_#res#1 := 0; 1259#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; 1249#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 1241#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); 1242#L532-3 [2022-07-14 14:58:09,206 INFO L754 eck$LassoCheckResult]: Loop: 1242#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; 1265#L533 assume !strstr_#t~short17#1; 1262#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; 1263#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; 1242#L532-3 [2022-07-14 14:58:09,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:09,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1331460076, now seen corresponding path program 1 times [2022-07-14 14:58:09,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:09,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310223631] [2022-07-14 14:58:09,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:09,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:09,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:58:09,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:58:09,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310223631] [2022-07-14 14:58:09,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310223631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:58:09,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:58:09,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 14:58:09,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217820270] [2022-07-14 14:58:09,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:58:09,225 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:58:09,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:09,225 INFO L85 PathProgramCache]: Analyzing trace with hash 4089565, now seen corresponding path program 1 times [2022-07-14 14:58:09,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:09,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934495727] [2022-07-14 14:58:09,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:09,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:09,230 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:09,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:09,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:58:09,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 14:58:09,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 14:58:09,311 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) [2022-07-14 14:58:09,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:58:09,334 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2022-07-14 14:58:09,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 14:58:09,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 76 transitions. [2022-07-14 14:58:09,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-07-14 14:58:09,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 76 transitions. [2022-07-14 14:58:09,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2022-07-14 14:58:09,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2022-07-14 14:58:09,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 76 transitions. [2022-07-14 14:58:09,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:58:09,337 INFO L369 hiAutomatonCegarLoop]: Abstraction has 61 states and 76 transitions. [2022-07-14 14:58:09,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 76 transitions. [2022-07-14 14:58:09,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-07-14 14:58:09,340 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) [2022-07-14 14:58:09,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2022-07-14 14:58:09,340 INFO L392 hiAutomatonCegarLoop]: Abstraction has 61 states and 76 transitions. [2022-07-14 14:58:09,340 INFO L374 stractBuchiCegarLoop]: Abstraction has 61 states and 76 transitions. [2022-07-14 14:58:09,340 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-14 14:58:09,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 76 transitions. [2022-07-14 14:58:09,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-07-14 14:58:09,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:58:09,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:58:09,341 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:58:09,341 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-14 14:58:09,341 INFO L752 eck$LassoCheckResult]: Stem: 1400#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1376#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; 1377#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; 1361#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 1362#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; 1420#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; 1418#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 1419#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; 1421#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1380#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1381#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 1403#L510-5 strlen_#res#1 := strlen_~i~0#1; 1373#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; 1374#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1385#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1386#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 1389#L510-11 strlen_#res#1 := strlen_~i~0#1; 1395#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; 1384#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 1378#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); 1379#L532-3 [2022-07-14 14:58:09,341 INFO L754 eck$LassoCheckResult]: Loop: 1379#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; 1401#L533 assume !strstr_#t~short17#1; 1398#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; 1399#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; 1379#L532-3 [2022-07-14 14:58:09,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:09,342 INFO L85 PathProgramCache]: Analyzing trace with hash -115443887, now seen corresponding path program 1 times [2022-07-14 14:58:09,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:09,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616941432] [2022-07-14 14:58:09,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:09,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:09,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:58:09,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:58:09,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616941432] [2022-07-14 14:58:09,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616941432] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:58:09,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:58:09,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 14:58:09,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550836665] [2022-07-14 14:58:09,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:58:09,386 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:58:09,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:09,386 INFO L85 PathProgramCache]: Analyzing trace with hash 4089565, now seen corresponding path program 2 times [2022-07-14 14:58:09,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:09,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785790497] [2022-07-14 14:58:09,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:09,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:09,390 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:09,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:09,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:58:09,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 14:58:09,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 14:58:09,473 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) [2022-07-14 14:58:09,520 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 [2022-07-14 14:58:09,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:58:09,534 INFO L93 Difference]: Finished difference Result 100 states and 118 transitions. [2022-07-14 14:58:09,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 14:58:09,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 118 transitions. [2022-07-14 14:58:09,535 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2022-07-14 14:58:09,535 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 72 states and 86 transitions. [2022-07-14 14:58:09,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2022-07-14 14:58:09,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2022-07-14 14:58:09,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 86 transitions. [2022-07-14 14:58:09,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:58:09,536 INFO L369 hiAutomatonCegarLoop]: Abstraction has 72 states and 86 transitions. [2022-07-14 14:58:09,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 86 transitions. [2022-07-14 14:58:09,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2022-07-14 14:58:09,537 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) [2022-07-14 14:58:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-07-14 14:58:09,538 INFO L392 hiAutomatonCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-07-14 14:58:09,538 INFO L374 stractBuchiCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-07-14 14:58:09,538 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-14 14:58:09,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 66 transitions. [2022-07-14 14:58:09,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-07-14 14:58:09,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:58:09,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:58:09,539 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-14 14:58:09,539 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-14 14:58:09,539 INFO L752 eck$LassoCheckResult]: Stem: 1577#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1550#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; 1551#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; 1536#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 1537#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; 1584#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; 1541#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; 1542#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 1589#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 1588#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; 1571#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1554#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1555#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; 1581#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; 1556#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1557#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 1583#L510-5 strlen_#res#1 := strlen_~i~0#1; 1547#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; 1548#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1559#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1560#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 1563#L510-11 strlen_#res#1 := strlen_~i~0#1; 1572#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; 1558#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 1552#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); 1553#L532-3 [2022-07-14 14:58:09,539 INFO L754 eck$LassoCheckResult]: Loop: 1553#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; 1578#L533 assume !strstr_#t~short17#1; 1575#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; 1576#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; 1553#L532-3 [2022-07-14 14:58:09,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:09,539 INFO L85 PathProgramCache]: Analyzing trace with hash 278203018, now seen corresponding path program 1 times [2022-07-14 14:58:09,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:09,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076680746] [2022-07-14 14:58:09,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:09,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:09,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 14:58:09,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:58:09,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076680746] [2022-07-14 14:58:09,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076680746] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:58:09,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240043227] [2022-07-14 14:58:09,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:09,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:58:09,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:09,675 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:58:09,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-07-14 14:58:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:09,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 14:58:09,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:58:09,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 14:58:09,759 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 14:58:09,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240043227] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:58:09,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 14:58:09,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2022-07-14 14:58:09,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452747716] [2022-07-14 14:58:09,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:58:09,759 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:58:09,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:09,760 INFO L85 PathProgramCache]: Analyzing trace with hash 4089565, now seen corresponding path program 3 times [2022-07-14 14:58:09,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:09,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502372249] [2022-07-14 14:58:09,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:09,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:09,763 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:09,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:09,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:58:09,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 14:58:09,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-14 14:58:09,837 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) [2022-07-14 14:58:09,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:58:09,875 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-07-14 14:58:09,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 14:58:09,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 73 transitions. [2022-07-14 14:58:09,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-07-14 14:58:09,876 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 41 states and 48 transitions. [2022-07-14 14:58:09,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-07-14 14:58:09,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-07-14 14:58:09,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 48 transitions. [2022-07-14 14:58:09,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:58:09,877 INFO L369 hiAutomatonCegarLoop]: Abstraction has 41 states and 48 transitions. [2022-07-14 14:58:09,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 48 transitions. [2022-07-14 14:58:09,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2022-07-14 14:58:09,877 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) [2022-07-14 14:58:09,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-07-14 14:58:09,878 INFO L392 hiAutomatonCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-07-14 14:58:09,878 INFO L374 stractBuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-07-14 14:58:09,878 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-14 14:58:09,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2022-07-14 14:58:09,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-07-14 14:58:09,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:58:09,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:58:09,878 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-14 14:58:09,878 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-14 14:58:09,878 INFO L752 eck$LassoCheckResult]: Stem: 1783#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1762#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; 1763#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; 1748#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; 1749#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1750#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 1751#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; 1759#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; 1752#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; 1753#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 1754#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 1755#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; 1756#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1764#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1765#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; 1777#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; 1766#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1767#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 1785#L510-5 strlen_#res#1 := strlen_~i~0#1; 1757#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; 1758#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1769#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1770#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; 1774#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; 1771#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1772#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 1773#L510-11 strlen_#res#1 := strlen_~i~0#1; 1778#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; 1768#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 1760#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); 1761#L532-3 [2022-07-14 14:58:09,879 INFO L754 eck$LassoCheckResult]: Loop: 1761#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; 1784#L533 assume !strstr_#t~short17#1; 1781#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; 1782#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; 1761#L532-3 [2022-07-14 14:58:09,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:09,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1690519729, now seen corresponding path program 1 times [2022-07-14 14:58:09,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:09,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702028523] [2022-07-14 14:58:09,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:09,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:09,889 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:09,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:09,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:09,900 INFO L85 PathProgramCache]: Analyzing trace with hash 4089565, now seen corresponding path program 4 times [2022-07-14 14:58:09,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:09,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570944284] [2022-07-14 14:58:09,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:09,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:09,902 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:09,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:09,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:09,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1271781261, now seen corresponding path program 1 times [2022-07-14 14:58:09,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:09,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505855637] [2022-07-14 14:58:09,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:09,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:09,916 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:09,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:11,395 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:58:11,395 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:58:11,395 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:58:11,395 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:58:11,395 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:58:11,395 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:11,395 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:58:11,395 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:58:11,395 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration11_Lasso [2022-07-14 14:58:11,395 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:58:11,395 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:58:11,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:11,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:11,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:11,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:11,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:11,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:11,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:11,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:11,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:11,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:11,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:11,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:11,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:11,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:11,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:11,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:11,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:11,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:11,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:11,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:11,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:11,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:11,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:12,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:12,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:12,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:12,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:12,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:12,650 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:58:12,651 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:58:12,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:12,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:12,652 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) [2022-07-14 14:58:12,652 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 [2022-07-14 14:58:12,654 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 [2022-07-14 14:58:12,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:12,659 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:12,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:12,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:12,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:12,660 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:12,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:12,661 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:12,675 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 [2022-07-14 14:58:12,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:12,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:12,676 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) [2022-07-14 14:58:12,677 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 [2022-07-14 14:58:12,678 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 [2022-07-14 14:58:12,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:12,684 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:12,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:12,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:12,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:12,684 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:12,684 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:12,685 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:12,700 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 [2022-07-14 14:58:12,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:12,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:12,701 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) [2022-07-14 14:58:12,709 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 [2022-07-14 14:58:12,709 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 [2022-07-14 14:58:12,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:12,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:12,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:12,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:12,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:12,715 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:12,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:12,720 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:12,735 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 [2022-07-14 14:58:12,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:12,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:12,737 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) [2022-07-14 14:58:12,737 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 [2022-07-14 14:58:12,738 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 [2022-07-14 14:58:12,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:12,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:12,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:12,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:12,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:12,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:12,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:12,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:12,760 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 [2022-07-14 14:58:12,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:12,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:12,761 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) [2022-07-14 14:58:12,761 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 [2022-07-14 14:58:12,762 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 [2022-07-14 14:58:12,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:12,768 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:12,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:12,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:12,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:12,768 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:12,768 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:12,769 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:12,784 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 [2022-07-14 14:58:12,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:12,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:12,785 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) [2022-07-14 14:58:12,786 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 [2022-07-14 14:58:12,787 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 [2022-07-14 14:58:12,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:12,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:12,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:12,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:12,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:12,793 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:12,793 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:12,794 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:12,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2022-07-14 14:58:12,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:12,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:12,810 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) [2022-07-14 14:58:12,810 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 [2022-07-14 14:58:12,812 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 [2022-07-14 14:58:12,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:12,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:12,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:12,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:12,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:12,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:12,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:12,821 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:12,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2022-07-14 14:58:12,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:12,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:12,837 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) [2022-07-14 14:58:12,837 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 [2022-07-14 14:58:12,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 [2022-07-14 14:58:12,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:12,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:12,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:12,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:12,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:12,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:12,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:12,846 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:12,861 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 [2022-07-14 14:58:12,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:12,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:12,862 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) [2022-07-14 14:58:12,863 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 [2022-07-14 14:58:12,864 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 [2022-07-14 14:58:12,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:12,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:12,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:12,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:12,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:12,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:12,871 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:12,871 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:12,886 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 [2022-07-14 14:58:12,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:12,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:12,887 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) [2022-07-14 14:58:12,888 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 [2022-07-14 14:58:12,889 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 [2022-07-14 14:58:12,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:12,895 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:12,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:12,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:12,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:12,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:12,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:12,896 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:12,912 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 [2022-07-14 14:58:12,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:12,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:12,913 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) [2022-07-14 14:58:12,914 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 [2022-07-14 14:58:12,915 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 [2022-07-14 14:58:12,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:12,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:12,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:12,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:12,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:12,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:12,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:12,933 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:12,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2022-07-14 14:58:12,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:12,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:12,950 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) [2022-07-14 14:58:12,950 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 [2022-07-14 14:58:12,951 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 [2022-07-14 14:58:12,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:12,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:12,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:12,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:12,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:12,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:12,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:12,958 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:12,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2022-07-14 14:58:12,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:12,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:12,975 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) [2022-07-14 14:58:12,975 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 [2022-07-14 14:58:12,976 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 [2022-07-14 14:58:12,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:12,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:12,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:12,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:12,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:12,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:12,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:12,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:13,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2022-07-14 14:58:13,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:13,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:13,001 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) [2022-07-14 14:58:13,001 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 [2022-07-14 14:58:13,003 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 [2022-07-14 14:58:13,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:13,009 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:13,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:13,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:13,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:13,009 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:13,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:13,010 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:13,026 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 [2022-07-14 14:58:13,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:13,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:13,027 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) [2022-07-14 14:58:13,027 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 [2022-07-14 14:58:13,028 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 [2022-07-14 14:58:13,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:13,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:13,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:13,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:13,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:13,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:13,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:13,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:13,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2022-07-14 14:58:13,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:13,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:13,052 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) [2022-07-14 14:58:13,052 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 [2022-07-14 14:58:13,054 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 [2022-07-14 14:58:13,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:13,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:13,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:13,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:13,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:13,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:13,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:13,061 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:13,076 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 [2022-07-14 14:58:13,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:13,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:13,077 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) [2022-07-14 14:58:13,078 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 [2022-07-14 14:58:13,079 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 [2022-07-14 14:58:13,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:13,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:13,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:13,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:13,089 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:13,089 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:13,101 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:13,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2022-07-14 14:58:13,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:13,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:13,120 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) [2022-07-14 14:58:13,121 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 [2022-07-14 14:58:13,122 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 [2022-07-14 14:58:13,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:13,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:13,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:13,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:13,130 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:13,130 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:13,144 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:13,160 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 [2022-07-14 14:58:13,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:13,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:13,161 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) [2022-07-14 14:58:13,161 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 [2022-07-14 14:58:13,163 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 [2022-07-14 14:58:13,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:13,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:13,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:13,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:13,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:13,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:13,169 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:13,170 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:13,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2022-07-14 14:58:13,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:13,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:13,186 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) [2022-07-14 14:58:13,187 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 [2022-07-14 14:58:13,189 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 [2022-07-14 14:58:13,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:13,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:13,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:13,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:13,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:13,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:13,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:13,196 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:13,212 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 [2022-07-14 14:58:13,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:13,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:13,213 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) [2022-07-14 14:58:13,213 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 [2022-07-14 14:58:13,215 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 [2022-07-14 14:58:13,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:13,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:13,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:13,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:13,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:13,221 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:13,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:13,221 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:13,237 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 [2022-07-14 14:58:13,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:13,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:13,238 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) [2022-07-14 14:58:13,238 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 [2022-07-14 14:58:13,239 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 [2022-07-14 14:58:13,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:13,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:13,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:13,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:13,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:13,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:13,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:13,246 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:13,262 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 [2022-07-14 14:58:13,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:13,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:13,263 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) [2022-07-14 14:58:13,263 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 [2022-07-14 14:58:13,265 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 [2022-07-14 14:58:13,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:13,270 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-07-14 14:58:13,271 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 14:58:13,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:13,283 INFO L401 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2022-07-14 14:58:13,283 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-14 14:58:13,303 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:13,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2022-07-14 14:58:13,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:13,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:13,321 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) [2022-07-14 14:58:13,322 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 [2022-07-14 14:58:13,367 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 [2022-07-14 14:58:13,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:13,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:13,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:13,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:13,382 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:13,382 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:13,398 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:58:13,448 INFO L443 ModelExtractionUtils]: Simplification made 29 calls to the SMT solver. [2022-07-14 14:58:13,448 INFO L444 ModelExtractionUtils]: 19 out of 55 variables were initially zero. Simplification set additionally 33 variables to zero. [2022-07-14 14:58:13,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:13,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:13,456 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) [2022-07-14 14:58:13,457 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 [2022-07-14 14:58:13,457 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:58:13,463 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 14:58:13,464 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:58:13,464 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strlen_~s#1.base)_3, ULTIMATE.start_strstr_~haystack#1.offset) = 1*v_rep(select #length ULTIMATE.start_strlen_~s#1.base)_3 - 1*ULTIMATE.start_strstr_~haystack#1.offset Supporting invariants [] [2022-07-14 14:58:13,480 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 [2022-07-14 14:58:13,588 INFO L293 tatePredicateManager]: 35 out of 36 supporting invariants were superfluous and have been removed [2022-07-14 14:58:13,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:13,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:13,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 14:58:13,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:58:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:13,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 14:58:13,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:58:13,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2022-07-14 14:58:13,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:58:13,732 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-07-14 14:58:13,732 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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) [2022-07-14 14:58:13,759 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 12. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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 49 states and 61 transitions. Complement of second has 7 states. [2022-07-14 14:58:13,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 14:58:13,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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) [2022-07-14 14:58:13,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-07-14 14:58:13,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 30 letters. Loop has 4 letters. [2022-07-14 14:58:13,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:58:13,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 34 letters. Loop has 4 letters. [2022-07-14 14:58:13,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:58:13,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 30 letters. Loop has 8 letters. [2022-07-14 14:58:13,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:58:13,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 61 transitions. [2022-07-14 14:58:13,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:58:13,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 46 states and 55 transitions. [2022-07-14 14:58:13,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-07-14 14:58:13,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2022-07-14 14:58:13,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 55 transitions. [2022-07-14 14:58:13,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:58:13,762 INFO L369 hiAutomatonCegarLoop]: Abstraction has 46 states and 55 transitions. [2022-07-14 14:58:13,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 55 transitions. [2022-07-14 14:58:13,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-07-14 14:58:13,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.2) internal successors, (54), 44 states have internal predecessors, (54), 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) [2022-07-14 14:58:13,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2022-07-14 14:58:13,763 INFO L392 hiAutomatonCegarLoop]: Abstraction has 45 states and 54 transitions. [2022-07-14 14:58:13,763 INFO L374 stractBuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2022-07-14 14:58:13,763 INFO L287 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-14 14:58:13,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2022-07-14 14:58:13,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:58:13,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:58:13,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:58:13,764 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-14 14:58:13,764 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:58:13,764 INFO L752 eck$LassoCheckResult]: Stem: 2150#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2125#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; 2126#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; 2113#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; 2114#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2115#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 2116#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; 2124#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; 2117#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; 2118#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 2119#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 2120#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; 2121#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 2129#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2130#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; 2142#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; 2131#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2132#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 2155#L510-5 strlen_#res#1 := strlen_~i~0#1; 2122#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; 2123#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 2134#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2135#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; 2139#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; 2136#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2137#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 2138#L510-11 strlen_#res#1 := strlen_~i~0#1; 2143#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; 2133#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 2127#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); 2128#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; 2153#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; 2145#L518-3 [2022-07-14 14:58:13,764 INFO L754 eck$LassoCheckResult]: Loop: 2145#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 2156#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; 2144#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; 2145#L518-3 [2022-07-14 14:58:13,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:13,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1091824948, now seen corresponding path program 1 times [2022-07-14 14:58:13,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:13,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310298574] [2022-07-14 14:58:13,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:13,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:13,786 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:13,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:13,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:13,802 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 1 times [2022-07-14 14:58:13,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:13,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184416301] [2022-07-14 14:58:13,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:13,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:13,806 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:13,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:13,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:13,810 INFO L85 PathProgramCache]: Analyzing trace with hash 769802655, now seen corresponding path program 1 times [2022-07-14 14:58:13,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:13,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029262624] [2022-07-14 14:58:13,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:13,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:13,823 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:13,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:16,436 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:58:16,436 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:58:16,436 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:58:16,436 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:58:16,436 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:58:16,437 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:16,437 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:58:16,437 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:58:16,437 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration12_Lasso [2022-07-14 14:58:16,437 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:58:16,437 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:58:16,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:16,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:17,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:17,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:17,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:18,821 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:58:18,822 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:58:18,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:18,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:18,823 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) [2022-07-14 14:58:18,824 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 [2022-07-14 14:58:18,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 [2022-07-14 14:58:18,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:18,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:18,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:18,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:18,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:18,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:18,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:18,833 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:18,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2022-07-14 14:58:18,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:18,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:18,850 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) [2022-07-14 14:58:18,850 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 [2022-07-14 14:58:18,851 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 [2022-07-14 14:58:18,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:18,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:18,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:18,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:18,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:18,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:18,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:18,858 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:18,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2022-07-14 14:58:18,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:18,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:18,874 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) [2022-07-14 14:58:18,874 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 [2022-07-14 14:58:18,875 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 [2022-07-14 14:58:18,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:18,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:18,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:18,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:18,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:18,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:18,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:18,882 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:18,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2022-07-14 14:58:18,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:18,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:18,898 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) [2022-07-14 14:58:18,899 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 [2022-07-14 14:58:18,900 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 [2022-07-14 14:58:18,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:18,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:18,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:18,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:18,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:18,905 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:18,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:18,906 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:18,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2022-07-14 14:58:18,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:18,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:18,922 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) [2022-07-14 14:58:18,924 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 [2022-07-14 14:58:18,924 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 [2022-07-14 14:58:18,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:18,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:18,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:18,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:18,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:18,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:18,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:18,930 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:18,945 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 [2022-07-14 14:58:18,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:18,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:18,946 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) [2022-07-14 14:58:18,947 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 [2022-07-14 14:58:18,948 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 [2022-07-14 14:58:18,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:18,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:18,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:18,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:18,957 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:18,957 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:18,964 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:18,980 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 [2022-07-14 14:58:18,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:18,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:18,981 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) [2022-07-14 14:58:18,982 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 [2022-07-14 14:58:18,983 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 [2022-07-14 14:58:18,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:18,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:18,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:18,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:18,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:18,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:18,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:18,991 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2022-07-14 14:58:19,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,007 INFO L229 MonitoredProcess]: Starting monitored process 111 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) [2022-07-14 14:58:19,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2022-07-14 14:58:19,009 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 [2022-07-14 14:58:19,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:19,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,015 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:19,015 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:19,016 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2022-07-14 14:58:19,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,032 INFO L229 MonitoredProcess]: Starting monitored process 112 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) [2022-07-14 14:58:19,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2022-07-14 14:58:19,034 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 [2022-07-14 14:58:19,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:19,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,040 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:19,040 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:19,041 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2022-07-14 14:58:19,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,057 INFO L229 MonitoredProcess]: Starting monitored process 113 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) [2022-07-14 14:58:19,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2022-07-14 14:58:19,059 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 [2022-07-14 14:58:19,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:19,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:19,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:19,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2022-07-14 14:58:19,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,084 INFO L229 MonitoredProcess]: Starting monitored process 114 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) [2022-07-14 14:58:19,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2022-07-14 14:58:19,085 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 [2022-07-14 14:58:19,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,091 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:19,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,091 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:19,091 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:19,092 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2022-07-14 14:58:19,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,109 INFO L229 MonitoredProcess]: Starting monitored process 115 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) [2022-07-14 14:58:19,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2022-07-14 14:58:19,110 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 [2022-07-14 14:58:19,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:19,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:19,116 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:19,117 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2022-07-14 14:58:19,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,133 INFO L229 MonitoredProcess]: Starting monitored process 116 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) [2022-07-14 14:58:19,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2022-07-14 14:58:19,135 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 [2022-07-14 14:58:19,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:19,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,141 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:19,141 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:19,142 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2022-07-14 14:58:19,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,158 INFO L229 MonitoredProcess]: Starting monitored process 117 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) [2022-07-14 14:58:19,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2022-07-14 14:58:19,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 [2022-07-14 14:58:19,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,165 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:19,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,166 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:19,166 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:19,166 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Forceful destruction successful, exit code 0 [2022-07-14 14:58:19,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,182 INFO L229 MonitoredProcess]: Starting monitored process 118 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) [2022-07-14 14:58:19,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2022-07-14 14:58:19,184 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 [2022-07-14 14:58:19,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,190 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:19,190 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:19,192 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Forceful destruction successful, exit code 0 [2022-07-14 14:58:19,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,208 INFO L229 MonitoredProcess]: Starting monitored process 119 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) [2022-07-14 14:58:19,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2022-07-14 14:58:19,210 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 [2022-07-14 14:58:19,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,216 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:19,216 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:19,218 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2022-07-14 14:58:19,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,234 INFO L229 MonitoredProcess]: Starting monitored process 120 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) [2022-07-14 14:58:19,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2022-07-14 14:58:19,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 [2022-07-14 14:58:19,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:19,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:19,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:19,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2022-07-14 14:58:19,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,259 INFO L229 MonitoredProcess]: Starting monitored process 121 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) [2022-07-14 14:58:19,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2022-07-14 14:58:19,264 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 [2022-07-14 14:58:19,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,270 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:19,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:19,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:19,271 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2022-07-14 14:58:19,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,287 INFO L229 MonitoredProcess]: Starting monitored process 122 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) [2022-07-14 14:58:19,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2022-07-14 14:58:19,288 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 [2022-07-14 14:58:19,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:19,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:19,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:19,295 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2022-07-14 14:58:19,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,312 INFO L229 MonitoredProcess]: Starting monitored process 123 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) [2022-07-14 14:58:19,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2022-07-14 14:58:19,314 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 [2022-07-14 14:58:19,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:19,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:19,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:19,320 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0 [2022-07-14 14:58:19,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,337 INFO L229 MonitoredProcess]: Starting monitored process 124 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) [2022-07-14 14:58:19,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2022-07-14 14:58:19,338 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 [2022-07-14 14:58:19,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:19,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,344 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:19,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:19,345 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2022-07-14 14:58:19,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,361 INFO L229 MonitoredProcess]: Starting monitored process 125 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) [2022-07-14 14:58:19,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2022-07-14 14:58:19,362 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 [2022-07-14 14:58:19,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:19,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:19,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:19,369 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2022-07-14 14:58:19,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,384 INFO L229 MonitoredProcess]: Starting monitored process 126 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) [2022-07-14 14:58:19,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2022-07-14 14:58:19,386 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 [2022-07-14 14:58:19,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,392 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:19,392 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:19,394 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2022-07-14 14:58:19,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,409 INFO L229 MonitoredProcess]: Starting monitored process 127 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) [2022-07-14 14:58:19,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2022-07-14 14:58:19,411 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 [2022-07-14 14:58:19,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:19,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:19,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:19,418 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2022-07-14 14:58:19,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,433 INFO L229 MonitoredProcess]: Starting monitored process 128 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) [2022-07-14 14:58:19,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2022-07-14 14:58:19,436 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 [2022-07-14 14:58:19,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:19,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:19,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:19,442 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2022-07-14 14:58:19,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,458 INFO L229 MonitoredProcess]: Starting monitored process 129 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) [2022-07-14 14:58:19,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2022-07-14 14:58:19,460 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 [2022-07-14 14:58:19,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:19,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:19,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:19,474 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2022-07-14 14:58:19,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,492 INFO L229 MonitoredProcess]: Starting monitored process 130 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) [2022-07-14 14:58:19,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2022-07-14 14:58:19,493 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 [2022-07-14 14:58:19,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:19,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,500 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:19,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:19,520 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2022-07-14 14:58:19,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,537 INFO L229 MonitoredProcess]: Starting monitored process 131 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) [2022-07-14 14:58:19,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2022-07-14 14:58:19,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 [2022-07-14 14:58:19,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:19,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:19,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:19,545 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2022-07-14 14:58:19,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,561 INFO L229 MonitoredProcess]: Starting monitored process 132 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) [2022-07-14 14:58:19,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2022-07-14 14:58:19,562 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 [2022-07-14 14:58:19,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:19,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,568 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:19,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:19,569 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2022-07-14 14:58:19,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,585 INFO L229 MonitoredProcess]: Starting monitored process 133 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) [2022-07-14 14:58:19,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2022-07-14 14:58:19,586 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 [2022-07-14 14:58:19,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:19,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:19,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:19,593 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2022-07-14 14:58:19,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,609 INFO L229 MonitoredProcess]: Starting monitored process 134 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) [2022-07-14 14:58:19,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2022-07-14 14:58:19,610 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 [2022-07-14 14:58:19,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:58:19,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:58:19,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:58:19,630 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2022-07-14 14:58:19,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,646 INFO L229 MonitoredProcess]: Starting monitored process 135 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) [2022-07-14 14:58:19,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2022-07-14 14:58:19,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 [2022-07-14 14:58:19,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,655 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:19,655 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:19,657 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2022-07-14 14:58:19,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,672 INFO L229 MonitoredProcess]: Starting monitored process 136 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) [2022-07-14 14:58:19,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2022-07-14 14:58:19,674 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 [2022-07-14 14:58:19,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,682 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:19,682 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:19,685 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2022-07-14 14:58:19,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,700 INFO L229 MonitoredProcess]: Starting monitored process 137 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) [2022-07-14 14:58:19,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2022-07-14 14:58:19,702 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 [2022-07-14 14:58:19,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,716 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:19,716 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:19,726 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2022-07-14 14:58:19,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,742 INFO L229 MonitoredProcess]: Starting monitored process 138 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) [2022-07-14 14:58:19,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2022-07-14 14:58:19,744 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 [2022-07-14 14:58:19,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,750 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:19,750 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:19,752 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2022-07-14 14:58:19,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,768 INFO L229 MonitoredProcess]: Starting monitored process 139 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) [2022-07-14 14:58:19,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2022-07-14 14:58:19,769 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 [2022-07-14 14:58:19,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,776 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:19,777 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:19,799 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Forceful destruction successful, exit code 0 [2022-07-14 14:58:19,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,816 INFO L229 MonitoredProcess]: Starting monitored process 140 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) [2022-07-14 14:58:19,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2022-07-14 14:58:19,818 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 [2022-07-14 14:58:19,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,825 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:19,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:19,840 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:58:19,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Forceful destruction successful, exit code 0 [2022-07-14 14:58:19,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,858 INFO L229 MonitoredProcess]: Starting monitored process 141 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) [2022-07-14 14:58:19,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2022-07-14 14:58:19,860 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 [2022-07-14 14:58:19,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:58:19,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:58:19,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:58:19,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:58:19,881 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:58:19,881 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:58:19,903 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:58:19,952 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2022-07-14 14:58:19,952 INFO L444 ModelExtractionUtils]: 13 out of 85 variables were initially zero. Simplification set additionally 69 variables to zero. [2022-07-14 14:58:19,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:19,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:19,953 INFO L229 MonitoredProcess]: Starting monitored process 142 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) [2022-07-14 14:58:19,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2022-07-14 14:58:19,955 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:58:19,970 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 14:58:19,970 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:58:19,970 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_memcmp_~s~0#1.offset, v_rep(select #length ULTIMATE.start_strstr_~needle#1.base)_2) = -1*ULTIMATE.start_memcmp_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_strstr_~needle#1.base)_2 Supporting invariants [] [2022-07-14 14:58:19,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2022-07-14 14:58:20,167 INFO L293 tatePredicateManager]: 59 out of 60 supporting invariants were superfluous and have been removed [2022-07-14 14:58:20,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:20,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Forceful destruction successful, exit code 0 [2022-07-14 14:58:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:20,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 14:58:20,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:58:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:20,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 14:58:20,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:58:20,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:58:20,284 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 [2022-07-14 14:58:20,284 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 15 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) [2022-07-14 14:58:20,317 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 15. 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 92 states and 112 transitions. Complement of second has 7 states. [2022-07-14 14:58:20,318 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 [2022-07-14 14:58:20,318 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) [2022-07-14 14:58:20,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-07-14 14:58:20,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 32 letters. Loop has 3 letters. [2022-07-14 14:58:20,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:58:20,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 35 letters. Loop has 3 letters. [2022-07-14 14:58:20,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:58:20,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 32 letters. Loop has 6 letters. [2022-07-14 14:58:20,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:58:20,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 112 transitions. [2022-07-14 14:58:20,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:58:20,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 69 states and 84 transitions. [2022-07-14 14:58:20,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-07-14 14:58:20,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-07-14 14:58:20,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 84 transitions. [2022-07-14 14:58:20,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:58:20,324 INFO L369 hiAutomatonCegarLoop]: Abstraction has 69 states and 84 transitions. [2022-07-14 14:58:20,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 84 transitions. [2022-07-14 14:58:20,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2022-07-14 14:58:20,330 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) [2022-07-14 14:58:20,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-07-14 14:58:20,330 INFO L392 hiAutomatonCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-07-14 14:58:20,330 INFO L374 stractBuchiCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-07-14 14:58:20,330 INFO L287 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-14 14:58:20,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 65 transitions. [2022-07-14 14:58:20,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:58:20,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:58:20,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:58:20,334 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-14 14:58:20,334 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:58:20,336 INFO L752 eck$LassoCheckResult]: Stem: 2660#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2636#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; 2637#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; 2624#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; 2625#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2626#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 2627#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; 2635#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; 2628#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; 2629#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 2630#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 2631#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; 2632#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 2640#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2641#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; 2653#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; 2642#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2643#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 2667#L510-5 strlen_#res#1 := strlen_~i~0#1; 2633#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; 2634#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 2645#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2646#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; 2652#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; 2647#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2648#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 2651#L510-11 strlen_#res#1 := strlen_~i~0#1; 2654#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; 2644#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 2638#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); 2639#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; 2664#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; 2666#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 2675#L518-1 assume !(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1; 2649#L518-4 memcmp_#res#1 := 0; 2650#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 2658#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; 2659#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; 2662#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; 2663#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; 2656#L518-3 [2022-07-14 14:58:20,336 INFO L754 eck$LassoCheckResult]: Loop: 2656#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 2668#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; 2655#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; 2656#L518-3 [2022-07-14 14:58:20,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:20,339 INFO L85 PathProgramCache]: Analyzing trace with hash -840479618, now seen corresponding path program 1 times [2022-07-14 14:58:20,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:20,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283191647] [2022-07-14 14:58:20,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:20,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:20,366 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-14 14:58:20,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:58:20,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283191647] [2022-07-14 14:58:20,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283191647] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:58:20,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:58:20,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 14:58:20,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437068689] [2022-07-14 14:58:20,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:58:20,367 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:58:20,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:20,367 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 2 times [2022-07-14 14:58:20,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:20,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475051402] [2022-07-14 14:58:20,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:20,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:20,371 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:20,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:20,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:58:20,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 14:58:20,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 14:58:20,461 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) [2022-07-14 14:58:20,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:58:20,474 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2022-07-14 14:58:20,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 14:58:20,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 66 transitions. [2022-07-14 14:58:20,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:58:20,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 53 states and 62 transitions. [2022-07-14 14:58:20,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2022-07-14 14:58:20,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2022-07-14 14:58:20,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 62 transitions. [2022-07-14 14:58:20,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:58:20,475 INFO L369 hiAutomatonCegarLoop]: Abstraction has 53 states and 62 transitions. [2022-07-14 14:58:20,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 62 transitions. [2022-07-14 14:58:20,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-07-14 14:58:20,476 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) [2022-07-14 14:58:20,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2022-07-14 14:58:20,476 INFO L392 hiAutomatonCegarLoop]: Abstraction has 53 states and 62 transitions. [2022-07-14 14:58:20,477 INFO L374 stractBuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2022-07-14 14:58:20,477 INFO L287 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-14 14:58:20,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 62 transitions. [2022-07-14 14:58:20,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:58:20,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:58:20,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:58:20,478 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-14 14:58:20,478 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:58:20,478 INFO L752 eck$LassoCheckResult]: Stem: 2778#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2757#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; 2758#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; 2743#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; 2744#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2745#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 2746#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; 2754#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; 2747#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; 2748#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 2749#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 2750#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; 2751#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 2759#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2760#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; 2770#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; 2761#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2762#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 2784#L510-5 strlen_#res#1 := strlen_~i~0#1; 2752#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; 2753#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 2764#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2765#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; 2769#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; 2766#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2767#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 2768#L510-11 strlen_#res#1 := strlen_~i~0#1; 2771#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; 2763#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 2755#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); 2756#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; 2781#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; 2775#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 2788#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; 2789#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 2782#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 2783#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; 2791#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; 2790#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; 2780#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; 2773#L518-3 [2022-07-14 14:58:20,478 INFO L754 eck$LassoCheckResult]: Loop: 2773#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 2785#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; 2772#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; 2773#L518-3 [2022-07-14 14:58:20,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:20,478 INFO L85 PathProgramCache]: Analyzing trace with hash 762752838, now seen corresponding path program 1 times [2022-07-14 14:58:20,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:20,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931019468] [2022-07-14 14:58:20,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:20,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:20,602 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 14:58:20,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:58:20,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931019468] [2022-07-14 14:58:20,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931019468] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:58:20,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503298777] [2022-07-14 14:58:20,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:20,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:58:20,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:20,604 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:58:20,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Waiting until timeout for monitored process [2022-07-14 14:58:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:20,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-14 14:58:20,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:58:20,748 INFO L390 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 [2022-07-14 14:58:21,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:58:21,115 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 14:58:21,115 INFO L390 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 [2022-07-14 14:58:21,140 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 14:58:21,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:58:21,425 INFO L390 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 [2022-07-14 14:58:21,430 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-14 14:58:21,431 INFO L390 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 [2022-07-14 14:58:21,432 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 14:58:21,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503298777] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:58:21,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:58:21,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 33 [2022-07-14 14:58:21,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694465466] [2022-07-14 14:58:21,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:58:21,432 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:58:21,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:21,433 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 3 times [2022-07-14 14:58:21,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:21,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216235337] [2022-07-14 14:58:21,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:21,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:21,442 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:21,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:21,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:58:21,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-14 14:58:21,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=939, Unknown=0, NotChecked=0, Total=1056 [2022-07-14 14:58:21,530 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) [2022-07-14 14:58:23,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:58:23,272 INFO L93 Difference]: Finished difference Result 260 states and 304 transitions. [2022-07-14 14:58:23,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-14 14:58:23,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 260 states and 304 transitions. [2022-07-14 14:58:23,274 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2022-07-14 14:58:23,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 260 states to 238 states and 281 transitions. [2022-07-14 14:58:23,275 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2022-07-14 14:58:23,275 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2022-07-14 14:58:23,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 238 states and 281 transitions. [2022-07-14 14:58:23,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:58:23,275 INFO L369 hiAutomatonCegarLoop]: Abstraction has 238 states and 281 transitions. [2022-07-14 14:58:23,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states and 281 transitions. [2022-07-14 14:58:23,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 88. [2022-07-14 14:58:23,277 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) [2022-07-14 14:58:23,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2022-07-14 14:58:23,277 INFO L392 hiAutomatonCegarLoop]: Abstraction has 88 states and 101 transitions. [2022-07-14 14:58:23,277 INFO L374 stractBuchiCegarLoop]: Abstraction has 88 states and 101 transitions. [2022-07-14 14:58:23,277 INFO L287 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-07-14 14:58:23,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 101 transitions. [2022-07-14 14:58:23,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:58:23,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:58:23,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:58:23,278 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-14 14:58:23,279 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:58:23,279 INFO L752 eck$LassoCheckResult]: Stem: 3459#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3434#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; 3435#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; 3420#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; 3421#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3422#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 3423#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; 3431#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; 3424#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; 3425#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 3426#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 3427#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; 3428#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 3436#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 3437#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; 3450#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; 3438#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 3440#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 3466#L510-5 strlen_#res#1 := strlen_~i~0#1; 3429#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; 3430#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 3451#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 3448#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; 3449#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; 3444#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 3445#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; 3474#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; 3473#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 3446#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 3447#L510-11 strlen_#res#1 := strlen_~i~0#1; 3452#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; 3441#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 3432#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); 3433#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; 3470#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; 3456#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 3485#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; 3484#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 3465#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 3464#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; 3482#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; 3481#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; 3462#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; 3454#L518-3 [2022-07-14 14:58:23,279 INFO L754 eck$LassoCheckResult]: Loop: 3454#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 3467#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; 3453#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; 3454#L518-3 [2022-07-14 14:58:23,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:23,279 INFO L85 PathProgramCache]: Analyzing trace with hash 717589665, now seen corresponding path program 2 times [2022-07-14 14:58:23,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:23,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146534605] [2022-07-14 14:58:23,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:23,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:23,444 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 14:58:23,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:58:23,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146534605] [2022-07-14 14:58:23,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146534605] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:58:23,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073604348] [2022-07-14 14:58:23,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 14:58:23,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:58:23,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:23,446 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:58:23,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (144)] Waiting until timeout for monitored process [2022-07-14 14:58:23,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 14:58:23,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 14:58:23,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-14 14:58:23,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:58:23,542 INFO L390 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 [2022-07-14 14:58:23,616 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 14:58:23,616 INFO L390 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 [2022-07-14 14:58:24,067 INFO L390 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 [2022-07-14 14:58:24,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 14:58:24,251 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 14:58:24,252 INFO L390 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 [2022-07-14 14:58:24,273 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 14:58:24,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:58:24,622 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 14:58:24,656 INFO L356 Elim1Store]: treesize reduction 17, result has 74.2 percent of original size [2022-07-14 14:58:24,656 INFO L390 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 [2022-07-14 14:58:25,151 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 14:58:25,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073604348] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:58:25,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:58:25,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 18] total 45 [2022-07-14 14:58:25,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011415101] [2022-07-14 14:58:25,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:58:25,152 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:58:25,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:25,152 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 4 times [2022-07-14 14:58:25,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:25,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297962680] [2022-07-14 14:58:25,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:25,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:25,156 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:25,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:25,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:58:25,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-14 14:58:25,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1748, Unknown=0, NotChecked=0, Total=1980 [2022-07-14 14:58:25,255 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. cyclomatic complexity: 22 Second operand has 45 states, 45 states have (on average 2.688888888888889) internal successors, (121), 45 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) [2022-07-14 14:58:26,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:58:26,227 INFO L93 Difference]: Finished difference Result 175 states and 198 transitions. [2022-07-14 14:58:26,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-14 14:58:26,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 175 states and 198 transitions. [2022-07-14 14:58:26,228 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-14 14:58:26,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 175 states to 161 states and 184 transitions. [2022-07-14 14:58:26,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2022-07-14 14:58:26,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2022-07-14 14:58:26,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 161 states and 184 transitions. [2022-07-14 14:58:26,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:58:26,230 INFO L369 hiAutomatonCegarLoop]: Abstraction has 161 states and 184 transitions. [2022-07-14 14:58:26,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states and 184 transitions. [2022-07-14 14:58:26,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 112. [2022-07-14 14:58:26,231 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) [2022-07-14 14:58:26,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2022-07-14 14:58:26,232 INFO L392 hiAutomatonCegarLoop]: Abstraction has 112 states and 128 transitions. [2022-07-14 14:58:26,232 INFO L374 stractBuchiCegarLoop]: Abstraction has 112 states and 128 transitions. [2022-07-14 14:58:26,232 INFO L287 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-07-14 14:58:26,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 128 transitions. [2022-07-14 14:58:26,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:58:26,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:58:26,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:58:26,233 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-14 14:58:26,233 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:58:26,233 INFO L752 eck$LassoCheckResult]: Stem: 4066#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4040#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; 4041#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; 4025#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; 4026#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4109#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; 4029#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4027#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 4028#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; 4037#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; 4030#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; 4031#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 4032#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 4033#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; 4036#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 4042#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4043#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; 4078#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; 4044#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4045#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 4085#L510-5 strlen_#res#1 := strlen_~i~0#1; 4086#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; 4057#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 4058#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4116#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; 4115#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; 4050#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4051#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; 4074#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; 4075#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4129#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 4128#L510-11 strlen_#res#1 := strlen_~i~0#1; 4127#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; 4126#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 4125#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); 4082#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; 4083#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; 4063#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 4087#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; 4088#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 4117#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 4113#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; 4111#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; 4110#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; 4068#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; 4061#L518-3 [2022-07-14 14:58:26,234 INFO L754 eck$LassoCheckResult]: Loop: 4061#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 4079#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; 4060#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; 4061#L518-3 [2022-07-14 14:58:26,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:26,234 INFO L85 PathProgramCache]: Analyzing trace with hash -900142205, now seen corresponding path program 3 times [2022-07-14 14:58:26,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:26,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091113719] [2022-07-14 14:58:26,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:26,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:26,311 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-14 14:58:26,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:58:26,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091113719] [2022-07-14 14:58:26,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091113719] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:58:26,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:58:26,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 14:58:26,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383474869] [2022-07-14 14:58:26,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:58:26,312 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:58:26,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:26,312 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 5 times [2022-07-14 14:58:26,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:26,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376289215] [2022-07-14 14:58:26,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:26,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:26,317 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:26,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:26,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:58:26,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 14:58:26,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 14:58:26,404 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) [2022-07-14 14:58:26,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:58:26,439 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2022-07-14 14:58:26,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 14:58:26,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 145 transitions. [2022-07-14 14:58:26,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:58:26,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 125 states and 141 transitions. [2022-07-14 14:58:26,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2022-07-14 14:58:26,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2022-07-14 14:58:26,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 141 transitions. [2022-07-14 14:58:26,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:58:26,441 INFO L369 hiAutomatonCegarLoop]: Abstraction has 125 states and 141 transitions. [2022-07-14 14:58:26,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 141 transitions. [2022-07-14 14:58:26,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2022-07-14 14:58:26,443 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) [2022-07-14 14:58:26,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2022-07-14 14:58:26,443 INFO L392 hiAutomatonCegarLoop]: Abstraction has 117 states and 133 transitions. [2022-07-14 14:58:26,443 INFO L374 stractBuchiCegarLoop]: Abstraction has 117 states and 133 transitions. [2022-07-14 14:58:26,443 INFO L287 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-07-14 14:58:26,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 133 transitions. [2022-07-14 14:58:26,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:58:26,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:58:26,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:58:26,444 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-14 14:58:26,444 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:58:26,444 INFO L752 eck$LassoCheckResult]: Stem: 4321#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4292#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; 4293#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; 4278#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; 4279#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4361#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; 4282#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4280#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 4281#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; 4339#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; 4340#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; 4360#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 4359#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 4358#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; 4313#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 4296#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4297#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; 4310#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; 4298#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4299#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 4330#L510-5 strlen_#res#1 := strlen_~i~0#1; 4366#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; 4311#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 4312#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4308#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; 4309#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; 4304#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4305#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; 4394#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; 4393#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4392#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 4391#L510-11 strlen_#res#1 := strlen_~i~0#1; 4390#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; 4389#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 4388#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); 4335#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; 4336#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; 4384#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 4338#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; 4317#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; 4318#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 4375#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; 4362#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 4363#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 4349#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; 4346#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; 4344#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; 4324#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; 4316#L518-3 [2022-07-14 14:58:26,444 INFO L754 eck$LassoCheckResult]: Loop: 4316#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 4332#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; 4315#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; 4316#L518-3 [2022-07-14 14:58:26,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:26,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1802803372, now seen corresponding path program 1 times [2022-07-14 14:58:26,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:26,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048361043] [2022-07-14 14:58:26,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:26,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:26,549 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 14:58:26,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:58:26,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048361043] [2022-07-14 14:58:26,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048361043] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:58:26,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486424487] [2022-07-14 14:58:26,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:26,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:58:26,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:26,552 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:58:26,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (145)] Waiting until timeout for monitored process [2022-07-14 14:58:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:26,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 14:58:26,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:58:26,753 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 14:58:26,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:58:26,857 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 14:58:26,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486424487] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:58:26,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:58:26,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-07-14 14:58:26,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649762168] [2022-07-14 14:58:26,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:58:26,859 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:58:26,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:26,859 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 6 times [2022-07-14 14:58:26,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:26,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160804056] [2022-07-14 14:58:26,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:26,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:26,863 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:26,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:26,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:58:26,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-14 14:58:26,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-07-14 14:58:26,944 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) [2022-07-14 14:58:27,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:58:27,073 INFO L93 Difference]: Finished difference Result 166 states and 188 transitions. [2022-07-14 14:58:27,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 14:58:27,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 166 states and 188 transitions. [2022-07-14 14:58:27,074 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-14 14:58:27,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 166 states to 138 states and 158 transitions. [2022-07-14 14:58:27,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2022-07-14 14:58:27,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2022-07-14 14:58:27,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 158 transitions. [2022-07-14 14:58:27,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:58:27,075 INFO L369 hiAutomatonCegarLoop]: Abstraction has 138 states and 158 transitions. [2022-07-14 14:58:27,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 158 transitions. [2022-07-14 14:58:27,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 109. [2022-07-14 14:58:27,077 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) [2022-07-14 14:58:27,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2022-07-14 14:58:27,077 INFO L392 hiAutomatonCegarLoop]: Abstraction has 109 states and 124 transitions. [2022-07-14 14:58:27,077 INFO L374 stractBuchiCegarLoop]: Abstraction has 109 states and 124 transitions. [2022-07-14 14:58:27,077 INFO L287 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-07-14 14:58:27,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 124 transitions. [2022-07-14 14:58:27,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:58:27,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:58:27,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:58:27,078 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-14 14:58:27,078 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:58:27,078 INFO L752 eck$LassoCheckResult]: Stem: 4918#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4890#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; 4891#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; 4875#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; 4876#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4877#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 4878#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; 4954#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; 4881#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; 4882#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 4883#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 4884#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; 4885#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 4894#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4895#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; 4908#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; 4896#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4897#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; 4956#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; 4955#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4928#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 4929#L510-5 strlen_#res#1 := strlen_~i~0#1; 4886#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; 4887#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 4939#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4938#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; 4924#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; 4925#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4905#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 4906#L510-11 strlen_#res#1 := strlen_~i~0#1; 4935#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; 4936#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 4892#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); 4893#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; 4969#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; 4968#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 4966#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; 4967#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; 4965#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 4964#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; 4963#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 4922#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 4923#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; 4973#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; 4974#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; 4961#L533 assume !strstr_#t~short17#1; 4960#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; 4958#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; 4957#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; 4920#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; 4913#L518-3 [2022-07-14 14:58:27,078 INFO L754 eck$LassoCheckResult]: Loop: 4913#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 4930#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; 4912#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; 4913#L518-3 [2022-07-14 14:58:27,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:27,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1191678414, now seen corresponding path program 1 times [2022-07-14 14:58:27,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:27,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693338548] [2022-07-14 14:58:27,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:27,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:27,157 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-14 14:58:27,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:58:27,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693338548] [2022-07-14 14:58:27,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693338548] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:58:27,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726774098] [2022-07-14 14:58:27,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:27,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:58:27,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:27,160 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:58:27,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Waiting until timeout for monitored process [2022-07-14 14:58:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:27,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-14 14:58:27,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:58:27,258 INFO L390 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 [2022-07-14 14:58:27,343 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-14 14:58:27,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:58:27,402 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-14 14:58:27,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726774098] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:58:27,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:58:27,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2022-07-14 14:58:27,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165132066] [2022-07-14 14:58:27,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:58:27,411 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:58:27,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:27,411 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 7 times [2022-07-14 14:58:27,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:27,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342453054] [2022-07-14 14:58:27,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:27,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:27,415 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:27,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:27,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:58:27,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-14 14:58:27,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-07-14 14:58:27,503 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) [2022-07-14 14:58:27,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:58:27,608 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2022-07-14 14:58:27,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 14:58:27,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 148 transitions. [2022-07-14 14:58:27,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:58:27,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 115 states and 130 transitions. [2022-07-14 14:58:27,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2022-07-14 14:58:27,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2022-07-14 14:58:27,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 130 transitions. [2022-07-14 14:58:27,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:58:27,609 INFO L369 hiAutomatonCegarLoop]: Abstraction has 115 states and 130 transitions. [2022-07-14 14:58:27,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 130 transitions. [2022-07-14 14:58:27,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2022-07-14 14:58:27,611 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) [2022-07-14 14:58:27,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 128 transitions. [2022-07-14 14:58:27,611 INFO L392 hiAutomatonCegarLoop]: Abstraction has 113 states and 128 transitions. [2022-07-14 14:58:27,611 INFO L374 stractBuchiCegarLoop]: Abstraction has 113 states and 128 transitions. [2022-07-14 14:58:27,611 INFO L287 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2022-07-14 14:58:27,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 128 transitions. [2022-07-14 14:58:27,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:58:27,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:58:27,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:58:27,612 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-14 14:58:27,612 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:58:27,612 INFO L752 eck$LassoCheckResult]: Stem: 5480#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5456#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; 5457#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; 5440#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; 5441#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 5525#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 5524#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; 5523#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; 5522#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; 5520#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 5518#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; 5517#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 5516#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 5515#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; 5514#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 5513#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5512#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; 5511#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; 5510#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5505#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; 5508#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; 5504#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5502#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 5499#L510-5 strlen_#res#1 := strlen_~i~0#1; 5497#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; 5496#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 5495#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5494#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; 5486#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; 5487#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5467#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 5539#L510-11 strlen_#res#1 := strlen_~i~0#1; 5538#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; 5537#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 5536#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); 5535#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; 5533#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; 5532#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 5530#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; 5531#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; 5529#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 5528#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; 5527#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 5484#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 5485#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; 5521#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; 5519#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; 5506#L533 assume !strstr_#t~short17#1; 5503#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; 5500#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; 5498#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; 5482#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; 5475#L518-3 [2022-07-14 14:58:27,612 INFO L754 eck$LassoCheckResult]: Loop: 5475#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 5490#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; 5474#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; 5475#L518-3 [2022-07-14 14:58:27,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:27,613 INFO L85 PathProgramCache]: Analyzing trace with hash 283927796, now seen corresponding path program 2 times [2022-07-14 14:58:27,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:27,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585330353] [2022-07-14 14:58:27,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:27,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:27,760 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-14 14:58:27,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:58:27,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585330353] [2022-07-14 14:58:27,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585330353] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:58:27,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568467427] [2022-07-14 14:58:27,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 14:58:27,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:58:27,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:27,763 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:58:27,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Waiting until timeout for monitored process [2022-07-14 14:58:27,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 14:58:27,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 14:58:27,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-14 14:58:27,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:58:27,866 INFO L390 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 [2022-07-14 14:58:27,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:58:27,931 INFO L390 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 [2022-07-14 14:58:27,937 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 14:58:27,937 INFO L390 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 [2022-07-14 14:58:28,084 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-14 14:58:28,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:58:28,245 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 14:58:28,245 INFO L390 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 [2022-07-14 14:58:28,316 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-14 14:58:28,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568467427] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:58:28,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:58:28,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2022-07-14 14:58:28,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632862410] [2022-07-14 14:58:28,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:58:28,317 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:58:28,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:28,317 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 8 times [2022-07-14 14:58:28,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:28,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116360108] [2022-07-14 14:58:28,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:28,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:28,321 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:28,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:28,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:58:28,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-14 14:58:28,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2022-07-14 14:58:28,403 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) [2022-07-14 14:58:29,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:58:29,274 INFO L93 Difference]: Finished difference Result 310 states and 349 transitions. [2022-07-14 14:58:29,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-14 14:58:29,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 310 states and 349 transitions. [2022-07-14 14:58:29,277 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2022-07-14 14:58:29,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 310 states to 235 states and 271 transitions. [2022-07-14 14:58:29,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2022-07-14 14:58:29,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2022-07-14 14:58:29,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 235 states and 271 transitions. [2022-07-14 14:58:29,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:58:29,278 INFO L369 hiAutomatonCegarLoop]: Abstraction has 235 states and 271 transitions. [2022-07-14 14:58:29,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states and 271 transitions. [2022-07-14 14:58:29,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 100. [2022-07-14 14:58:29,280 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) [2022-07-14 14:58:29,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2022-07-14 14:58:29,280 INFO L392 hiAutomatonCegarLoop]: Abstraction has 100 states and 113 transitions. [2022-07-14 14:58:29,280 INFO L374 stractBuchiCegarLoop]: Abstraction has 100 states and 113 transitions. [2022-07-14 14:58:29,280 INFO L287 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2022-07-14 14:58:29,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 113 transitions. [2022-07-14 14:58:29,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:58:29,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:58:29,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:58:29,281 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-14 14:58:29,281 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:58:29,282 INFO L752 eck$LassoCheckResult]: Stem: 6296#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6270#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; 6271#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; 6255#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; 6256#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 6257#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; 6258#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 6259#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 6268#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; 6269#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; 6260#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; 6261#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 6262#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; 6263#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 6314#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 6264#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; 6265#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 6274#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6275#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; 6286#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; 6276#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6277#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; 6305#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; 6315#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6316#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 6312#L510-5 strlen_#res#1 := strlen_~i~0#1; 6313#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; 6287#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 6288#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6324#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; 6302#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; 6281#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6282#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; 6285#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; 6321#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6283#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 6284#L510-11 strlen_#res#1 := strlen_~i~0#1; 6289#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; 6278#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 6272#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); 6273#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; 6309#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; 6307#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 6308#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_#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; 6293#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 6346#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; 6343#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 6326#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 6323#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; 6322#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; 6320#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; 6291#L518-3 [2022-07-14 14:58:29,282 INFO L754 eck$LassoCheckResult]: Loop: 6291#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 6306#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; 6290#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; 6291#L518-3 [2022-07-14 14:58:29,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:29,282 INFO L85 PathProgramCache]: Analyzing trace with hash -131927407, now seen corresponding path program 2 times [2022-07-14 14:58:29,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:29,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263817047] [2022-07-14 14:58:29,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:29,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:29,412 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-14 14:58:29,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:58:29,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263817047] [2022-07-14 14:58:29,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263817047] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:58:29,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069591721] [2022-07-14 14:58:29,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 14:58:29,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:58:29,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:29,414 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:58:29,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Waiting until timeout for monitored process [2022-07-14 14:58:29,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 14:58:29,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 14:58:29,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:58:29,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:58:29,671 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-14 14:58:29,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:58:29,909 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-14 14:58:29,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069591721] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:58:29,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:58:29,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 31 [2022-07-14 14:58:29,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194596472] [2022-07-14 14:58:29,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:58:29,909 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:58:29,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:29,909 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 9 times [2022-07-14 14:58:29,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:29,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877327353] [2022-07-14 14:58:29,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:29,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:29,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:29,913 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:29,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:30,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:58:30,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-14 14:58:30,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2022-07-14 14:58:30,001 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. cyclomatic complexity: 22 Second operand has 31 states, 31 states have (on average 3.032258064516129) internal successors, (94), 31 states have internal predecessors, (94), 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) [2022-07-14 14:58:30,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:58:30,261 INFO L93 Difference]: Finished difference Result 223 states and 254 transitions. [2022-07-14 14:58:30,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 14:58:30,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 223 states and 254 transitions. [2022-07-14 14:58:30,263 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2022-07-14 14:58:30,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 223 states to 202 states and 232 transitions. [2022-07-14 14:58:30,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2022-07-14 14:58:30,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2022-07-14 14:58:30,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 202 states and 232 transitions. [2022-07-14 14:58:30,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:58:30,264 INFO L369 hiAutomatonCegarLoop]: Abstraction has 202 states and 232 transitions. [2022-07-14 14:58:30,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states and 232 transitions. [2022-07-14 14:58:30,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 103. [2022-07-14 14:58:30,265 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) [2022-07-14 14:58:30,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2022-07-14 14:58:30,266 INFO L392 hiAutomatonCegarLoop]: Abstraction has 103 states and 116 transitions. [2022-07-14 14:58:30,266 INFO L374 stractBuchiCegarLoop]: Abstraction has 103 states and 116 transitions. [2022-07-14 14:58:30,266 INFO L287 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2022-07-14 14:58:30,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 116 transitions. [2022-07-14 14:58:30,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:58:30,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:58:30,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:58:30,266 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-14 14:58:30,266 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:58:30,267 INFO L752 eck$LassoCheckResult]: Stem: 6975#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6949#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; 6950#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; 6934#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; 6935#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 6936#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; 6937#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 6938#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 6947#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; 6948#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; 6939#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; 6940#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 6941#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; 6942#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 6989#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 6943#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; 6944#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 6953#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6954#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; 6966#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; 6955#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6956#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; 6984#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; 6990#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6982#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 6983#L510-5 strlen_#res#1 := strlen_~i~0#1; 6945#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; 6946#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 6967#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6964#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; 6965#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; 6981#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6998#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; 7005#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; 6960#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6961#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; 6993#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; 6992#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6962#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 6963#L510-11 strlen_#res#1 := strlen_~i~0#1; 6968#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; 6957#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 6951#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); 6952#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; 6988#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; 6986#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 6987#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; 6971#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; 6972#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 7028#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; 7024#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 7007#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 6997#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; 6995#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; 6994#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; 6977#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; 6970#L518-3 [2022-07-14 14:58:30,267 INFO L754 eck$LassoCheckResult]: Loop: 6970#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 6985#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; 6969#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; 6970#L518-3 [2022-07-14 14:58:30,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:30,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1303219306, now seen corresponding path program 3 times [2022-07-14 14:58:30,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:30,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940462078] [2022-07-14 14:58:30,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:30,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:30,432 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-14 14:58:30,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:58:30,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940462078] [2022-07-14 14:58:30,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940462078] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:58:30,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041225573] [2022-07-14 14:58:30,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 14:58:30,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:58:30,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:30,435 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:58:30,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (149)] Waiting until timeout for monitored process [2022-07-14 14:58:30,558 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-14 14:58:30,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 14:58:30,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-14 14:58:30,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:58:30,567 INFO L390 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 [2022-07-14 14:58:30,635 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 14:58:30,635 INFO L390 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 [2022-07-14 14:58:31,014 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 14:58:31,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:58:31,348 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 14:58:31,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041225573] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:58:31,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:58:31,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 17] total 40 [2022-07-14 14:58:31,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079147068] [2022-07-14 14:58:31,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:58:31,349 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:58:31,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:31,349 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 10 times [2022-07-14 14:58:31,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:31,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547832082] [2022-07-14 14:58:31,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:31,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:31,352 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:31,355 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:31,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:58:31,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-14 14:58:31,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1348, Unknown=0, NotChecked=0, Total=1560 [2022-07-14 14:58:31,433 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. cyclomatic complexity: 22 Second operand has 40 states, 40 states have (on average 2.55) internal successors, (102), 40 states have internal predecessors, (102), 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) [2022-07-14 14:58:31,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:58:31,861 INFO L93 Difference]: Finished difference Result 214 states and 236 transitions. [2022-07-14 14:58:31,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-14 14:58:31,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 236 transitions. [2022-07-14 14:58:31,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:58:31,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 186 states and 206 transitions. [2022-07-14 14:58:31,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2022-07-14 14:58:31,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2022-07-14 14:58:31,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 206 transitions. [2022-07-14 14:58:31,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:58:31,865 INFO L369 hiAutomatonCegarLoop]: Abstraction has 186 states and 206 transitions. [2022-07-14 14:58:31,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 206 transitions. [2022-07-14 14:58:31,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 135. [2022-07-14 14:58:31,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 135 states have (on average 1.125925925925926) internal successors, (152), 134 states have internal predecessors, (152), 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) [2022-07-14 14:58:31,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 152 transitions. [2022-07-14 14:58:31,868 INFO L392 hiAutomatonCegarLoop]: Abstraction has 135 states and 152 transitions. [2022-07-14 14:58:31,869 INFO L374 stractBuchiCegarLoop]: Abstraction has 135 states and 152 transitions. [2022-07-14 14:58:31,869 INFO L287 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2022-07-14 14:58:31,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 135 states and 152 transitions. [2022-07-14 14:58:31,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:58:31,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:58:31,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:58:31,870 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-14 14:58:31,870 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:58:31,870 INFO L752 eck$LassoCheckResult]: Stem: 7688#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7666#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; 7667#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; 7648#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; 7649#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 7650#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; 7651#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 7769#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 7662#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; 7663#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; 7652#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; 7653#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 7654#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; 7655#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 7733#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 7658#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; 7659#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 7668#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7669#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; 7680#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; 7670#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7671#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; 7778#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; 7777#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7775#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; 7776#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; 7774#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7773#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 7772#L510-5 strlen_#res#1 := strlen_~i~0#1; 7771#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; 7770#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 7767#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7765#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; 7763#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; 7737#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7738#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; 7694#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; 7695#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7677#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 7678#L510-11 strlen_#res#1 := strlen_~i~0#1; 7681#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; 7704#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 7732#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); 7701#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; 7702#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; 7730#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 7720#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; 7729#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; 7718#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 7719#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; 7711#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 7710#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 7708#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; 7706#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; 7705#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; 7690#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; 7683#L518-3 [2022-07-14 14:58:31,870 INFO L754 eck$LassoCheckResult]: Loop: 7683#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 7698#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; 7682#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; 7683#L518-3 [2022-07-14 14:58:31,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:31,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1792797110, now seen corresponding path program 4 times [2022-07-14 14:58:31,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:31,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042058208] [2022-07-14 14:58:31,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:31,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:31,949 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-14 14:58:31,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:58:31,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042058208] [2022-07-14 14:58:31,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042058208] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:58:31,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890366555] [2022-07-14 14:58:31,950 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 14:58:31,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:58:31,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:31,952 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:58:31,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (150)] Waiting until timeout for monitored process [2022-07-14 14:58:32,039 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 14:58:32,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 14:58:32,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-14 14:58:32,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:58:32,046 INFO L390 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 [2022-07-14 14:58:32,156 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-14 14:58:32,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:58:32,235 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-14 14:58:32,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890366555] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:58:32,236 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:58:32,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 23 [2022-07-14 14:58:32,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865815830] [2022-07-14 14:58:32,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:58:32,236 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:58:32,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:32,236 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 11 times [2022-07-14 14:58:32,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:32,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242717620] [2022-07-14 14:58:32,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:32,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:32,239 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:32,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:32,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:58:32,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-14 14:58:32,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2022-07-14 14:58:32,321 INFO L87 Difference]: Start difference. First operand 135 states and 152 transitions. cyclomatic complexity: 28 Second operand has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 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) [2022-07-14 14:58:32,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:58:32,480 INFO L93 Difference]: Finished difference Result 211 states and 235 transitions. [2022-07-14 14:58:32,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 14:58:32,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 211 states and 235 transitions. [2022-07-14 14:58:32,494 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-14 14:58:32,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 211 states to 196 states and 220 transitions. [2022-07-14 14:58:32,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2022-07-14 14:58:32,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2022-07-14 14:58:32,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 220 transitions. [2022-07-14 14:58:32,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:58:32,496 INFO L369 hiAutomatonCegarLoop]: Abstraction has 196 states and 220 transitions. [2022-07-14 14:58:32,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 220 transitions. [2022-07-14 14:58:32,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 148. [2022-07-14 14:58:32,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 148 states have (on average 1.1216216216216217) internal successors, (166), 147 states have internal predecessors, (166), 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) [2022-07-14 14:58:32,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 166 transitions. [2022-07-14 14:58:32,498 INFO L392 hiAutomatonCegarLoop]: Abstraction has 148 states and 166 transitions. [2022-07-14 14:58:32,498 INFO L374 stractBuchiCegarLoop]: Abstraction has 148 states and 166 transitions. [2022-07-14 14:58:32,499 INFO L287 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2022-07-14 14:58:32,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 148 states and 166 transitions. [2022-07-14 14:58:32,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:58:32,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:58:32,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:58:32,500 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 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] [2022-07-14 14:58:32,500 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:58:32,500 INFO L752 eck$LassoCheckResult]: Stem: 8403#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8378#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; 8379#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; 8360#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; 8361#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 8362#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; 8363#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 8424#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 8425#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; 8443#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; 8366#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; 8367#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 8368#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; 8369#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 8466#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; 8463#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 8462#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 8372#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; 8373#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 8458#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 8457#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; 8456#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; 8455#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 8454#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; 8453#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; 8452#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 8450#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; 8451#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; 8449#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 8448#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 8447#L510-5 strlen_#res#1 := strlen_~i~0#1; 8446#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; 8444#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 8445#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 8426#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; 8427#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; 8440#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 8442#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; 8410#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; 8411#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 8389#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 8390#L510-11 strlen_#res#1 := strlen_~i~0#1; 8396#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; 8384#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 8376#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); 8377#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; 8419#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; 8501#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 8500#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; 8399#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; 8400#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 8421#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; 8422#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 8469#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 8467#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; 8464#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; 8461#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; 8406#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; 8398#L518-3 [2022-07-14 14:58:32,500 INFO L754 eck$LassoCheckResult]: Loop: 8398#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 8416#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; 8397#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; 8398#L518-3 [2022-07-14 14:58:32,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:32,500 INFO L85 PathProgramCache]: Analyzing trace with hash -2019938312, now seen corresponding path program 5 times [2022-07-14 14:58:32,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:32,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18573379] [2022-07-14 14:58:32,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:32,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:58:32,653 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-14 14:58:32,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:58:32,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18573379] [2022-07-14 14:58:32,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18573379] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:58:32,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177240148] [2022-07-14 14:58:32,654 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 14:58:32,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:58:32,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:58:32,656 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:58:32,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (151)] Waiting until timeout for monitored process [2022-07-14 14:58:32,774 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-14 14:58:32,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 14:58:32,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:58:32,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:58:32,910 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-14 14:58:32,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:58:33,139 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-14 14:58:33,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177240148] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:58:33,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:58:33,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 31 [2022-07-14 14:58:33,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742007016] [2022-07-14 14:58:33,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:58:33,140 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:58:33,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:33,140 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 12 times [2022-07-14 14:58:33,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:33,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776850244] [2022-07-14 14:58:33,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:33,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:33,143 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:33,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:33,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:58:33,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-14 14:58:33,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2022-07-14 14:58:33,252 INFO L87 Difference]: Start difference. First operand 148 states and 166 transitions. cyclomatic complexity: 29 Second operand has 31 states, 31 states have (on average 2.870967741935484) internal successors, (89), 31 states have internal predecessors, (89), 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) [2022-07-14 14:58:33,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:58:33,600 INFO L93 Difference]: Finished difference Result 399 states and 457 transitions. [2022-07-14 14:58:33,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 14:58:33,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 399 states and 457 transitions. [2022-07-14 14:58:33,602 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2022-07-14 14:58:33,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 399 states to 391 states and 448 transitions. [2022-07-14 14:58:33,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2022-07-14 14:58:33,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2022-07-14 14:58:33,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 391 states and 448 transitions. [2022-07-14 14:58:33,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:58:33,605 INFO L369 hiAutomatonCegarLoop]: Abstraction has 391 states and 448 transitions. [2022-07-14 14:58:33,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states and 448 transitions. [2022-07-14 14:58:33,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 170. [2022-07-14 14:58:33,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 170 states have (on average 1.1235294117647059) internal successors, (191), 169 states have internal predecessors, (191), 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) [2022-07-14 14:58:33,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 191 transitions. [2022-07-14 14:58:33,608 INFO L392 hiAutomatonCegarLoop]: Abstraction has 170 states and 191 transitions. [2022-07-14 14:58:33,609 INFO L374 stractBuchiCegarLoop]: Abstraction has 170 states and 191 transitions. [2022-07-14 14:58:33,609 INFO L287 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2022-07-14 14:58:33,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 170 states and 191 transitions. [2022-07-14 14:58:33,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:58:33,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:58:33,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:58:33,610 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 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] [2022-07-14 14:58:33,610 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:58:33,610 INFO L752 eck$LassoCheckResult]: Stem: 9337#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9308#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; 9309#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; 9293#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; 9294#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 9295#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; 9296#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 9297#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; 9361#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 9359#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 9360#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; 9357#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; 9358#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; 9373#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 9372#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; 9371#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 9369#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 9368#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; 9366#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 9367#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 9362#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; 9363#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; 9364#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 9365#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; 9324#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; 9325#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 9406#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 9442#L510-5 strlen_#res#1 := strlen_~i~0#1; 9441#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; 9440#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 9317#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 9318#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; 9449#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; 9448#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 9447#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; 9346#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; 9319#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 9320#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; 9323#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; 9446#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 9321#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 9322#L510-11 strlen_#res#1 := strlen_~i~0#1; 9330#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; 9316#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 9310#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); 9311#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; 9354#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; 9352#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 9353#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; 9333#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; 9334#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 9457#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; 9450#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 9416#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 9414#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; 9412#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; 9411#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; 9339#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; 9332#L518-3 [2022-07-14 14:58:33,610 INFO L754 eck$LassoCheckResult]: Loop: 9332#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 9351#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; 9331#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; 9332#L518-3 [2022-07-14 14:58:33,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:33,611 INFO L85 PathProgramCache]: Analyzing trace with hash 259249140, now seen corresponding path program 6 times [2022-07-14 14:58:33,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:33,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367264698] [2022-07-14 14:58:33,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:33,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:33,643 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:33,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:33,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:33,674 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 13 times [2022-07-14 14:58:33,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:33,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547968888] [2022-07-14 14:58:33,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:33,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:33,677 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:33,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:33,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:58:33,681 INFO L85 PathProgramCache]: Analyzing trace with hash 940040927, now seen corresponding path program 7 times [2022-07-14 14:58:33,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:58:33,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893853691] [2022-07-14 14:58:33,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:58:33,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:58:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:33,718 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:58:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:58:33,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:58:41,550 WARN L233 SmtUtils]: Spent 7.67s on a formula simplification. DAG size of input: 553 DAG size of output: 389 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-14 14:58:42,406 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:58:42,406 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:58:42,406 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:58:42,406 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:58:42,406 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:58:42,406 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:58:42,406 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:58:42,406 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:58:42,406 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration24_Lasso [2022-07-14 14:58:42,406 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:58:42,406 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:58:42,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:42,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:42,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:42,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:42,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:42,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:42,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:42,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:42,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:42,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:42,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:58:43,982 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:914) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:823) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:310) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-14 14:58:43,993 INFO L158 Benchmark]: Toolchain (without parser) took 44480.37ms. Allocated memory was 88.1MB in the beginning and 211.8MB in the end (delta: 123.7MB). Free memory was 52.8MB in the beginning and 106.1MB in the end (delta: -53.3MB). Peak memory consumption was 134.3MB. Max. memory is 16.1GB. [2022-07-14 14:58:43,993 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 88.1MB. Free memory was 58.3MB in the beginning and 58.3MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 14:58:43,994 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.58ms. Allocated memory was 88.1MB in the beginning and 121.6MB in the end (delta: 33.6MB). Free memory was 52.6MB in the beginning and 91.5MB in the end (delta: -38.9MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2022-07-14 14:58:43,994 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.22ms. Allocated memory is still 121.6MB. Free memory was 91.5MB in the beginning and 89.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 14:58:43,994 INFO L158 Benchmark]: Boogie Preprocessor took 40.47ms. Allocated memory is still 121.6MB. Free memory was 89.0MB in the beginning and 87.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 14:58:43,994 INFO L158 Benchmark]: RCFGBuilder took 339.53ms. Allocated memory is still 121.6MB. Free memory was 87.2MB in the beginning and 73.0MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-14 14:58:43,995 INFO L158 Benchmark]: BuchiAutomizer took 43716.86ms. Allocated memory was 121.6MB in the beginning and 211.8MB in the end (delta: 90.2MB). Free memory was 73.0MB in the beginning and 106.1MB in the end (delta: -33.2MB). Peak memory consumption was 121.9MB. Max. memory is 16.1GB. [2022-07-14 14:58:43,999 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 88.1MB. Free memory was 58.3MB in the beginning and 58.3MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.58ms. Allocated memory was 88.1MB in the beginning and 121.6MB in the end (delta: 33.6MB). Free memory was 52.6MB in the beginning and 91.5MB in the end (delta: -38.9MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.22ms. Allocated memory is still 121.6MB. Free memory was 91.5MB in the beginning and 89.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.47ms. Allocated memory is still 121.6MB. Free memory was 89.0MB in the beginning and 87.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 339.53ms. Allocated memory is still 121.6MB. Free memory was 87.2MB in the beginning and 73.0MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 43716.86ms. Allocated memory was 121.6MB in the beginning and 211.8MB in the end (delta: 90.2MB). Free memory was 73.0MB in the beginning and 106.1MB in the end (delta: -33.2MB). Peak memory consumption was 121.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-14 14:58:44,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (151)] Forceful destruction successful, exit code 0 [2022-07-14 14:58:44,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (150)] Ended with exit code 0 [2022-07-14 14:58:44,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (149)] Ended with exit code 0 [2022-07-14 14:58:44,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Ended with exit code 0 [2022-07-14 14:58:44,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Ended with exit code 0 [2022-07-14 14:58:45,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Ended with exit code 0 [2022-07-14 14:58:45,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (145)] Forceful destruction successful, exit code 0 [2022-07-14 14:58:45,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (144)] Ended with exit code 0 [2022-07-14 14:58:45,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Ended with exit code 0 [2022-07-14 14:58:45,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Ended with exit code 0 [2022-07-14 14:58:46,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: null