./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrpbrk_mixed_alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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-15/cstrpbrk_mixed_alloca.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 76cdad16cb8577e2fa2738f5c22f29ef30a5ca1ee31bc621195c1ea9243fa2ae --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:35:20,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:35:20,859 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:35:20,895 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:35:20,896 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:35:20,897 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:35:20,898 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:35:20,900 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:35:20,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:35:20,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:35:20,903 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:35:20,904 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:35:20,904 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:35:20,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:35:20,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:35:20,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:35:20,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:35:20,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:35:20,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:35:20,911 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:35:20,912 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:35:20,914 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:35:20,914 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:35:20,915 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:35:20,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:35:20,918 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:35:20,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:35:20,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:35:20,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:35:20,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:35:20,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:35:20,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:35:20,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:35:20,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:35:20,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:35:20,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:35:20,926 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:35:20,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:35:20,927 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:35:20,927 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:35:20,928 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:35:20,929 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:35:20,950 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:35:20,951 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:35:20,951 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:35:20,951 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:35:20,952 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:35:20,952 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:35:20,952 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:35:20,953 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:35:20,953 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:35:20,953 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:35:20,953 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:35:20,954 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:35:20,954 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:35:20,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:35:20,954 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:35:20,954 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:35:20,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:35:20,954 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:35:20,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:35:20,955 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:35:20,955 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:35:20,955 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:35:20,955 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:35:20,955 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:35:20,956 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:35:20,956 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:35:20,957 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:35:20,957 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:35:20,958 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:35:20,958 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 -> 76cdad16cb8577e2fa2738f5c22f29ef30a5ca1ee31bc621195c1ea9243fa2ae [2022-02-21 03:35:21,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:35:21,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:35:21,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:35:21,175 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:35:21,184 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:35:21,186 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrpbrk_mixed_alloca.i [2022-02-21 03:35:21,233 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/974ab6362/545359035ee041b58d6020a0ca4db18a/FLAG825816b10 [2022-02-21 03:35:21,624 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:35:21,625 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrpbrk_mixed_alloca.i [2022-02-21 03:35:21,639 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/974ab6362/545359035ee041b58d6020a0ca4db18a/FLAG825816b10 [2022-02-21 03:35:21,999 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/974ab6362/545359035ee041b58d6020a0ca4db18a [2022-02-21 03:35:22,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:35:22,002 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:35:22,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:22,003 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:35:22,005 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:35:22,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:22" (1/1) ... [2022-02-21 03:35:22,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37b81532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:22, skipping insertion in model container [2022-02-21 03:35:22,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:22" (1/1) ... [2022-02-21 03:35:22,014 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:35:22,030 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:35:22,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:22,356 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:35:22,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:22,445 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:35:22,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:22 WrapperNode [2022-02-21 03:35:22,446 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:22,447 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:22,447 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:35:22,447 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:35:22,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:22" (1/1) ... [2022-02-21 03:35:22,469 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:22" (1/1) ... [2022-02-21 03:35:22,489 INFO L137 Inliner]: procedures = 152, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2022-02-21 03:35:22,489 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:22,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:35:22,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:35:22,491 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:35:22,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:22" (1/1) ... [2022-02-21 03:35:22,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:22" (1/1) ... [2022-02-21 03:35:22,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:22" (1/1) ... [2022-02-21 03:35:22,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:22" (1/1) ... [2022-02-21 03:35:22,503 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:22" (1/1) ... [2022-02-21 03:35:22,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:22" (1/1) ... [2022-02-21 03:35:22,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:22" (1/1) ... [2022-02-21 03:35:22,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:35:22,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:35:22,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:35:22,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:35:22,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:22" (1/1) ... [2022-02-21 03:35:22,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:22,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:22,558 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-02-21 03:35:22,562 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-02-21 03:35:22,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:35:22,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:35:22,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:35:22,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:35:22,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:35:22,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:35:22,650 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:35:22,652 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:35:22,972 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:35:22,976 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:35:22,976 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:35:22,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:22 BoogieIcfgContainer [2022-02-21 03:35:22,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:35:22,982 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:35:22,982 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:35:22,985 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:35:22,985 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:22,985 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:35:22" (1/3) ... [2022-02-21 03:35:22,988 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1dafa3e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:22, skipping insertion in model container [2022-02-21 03:35:22,988 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:22,989 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:22" (2/3) ... [2022-02-21 03:35:22,989 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1dafa3e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:22, skipping insertion in model container [2022-02-21 03:35:22,989 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:22,989 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:22" (3/3) ... [2022-02-21 03:35:22,992 INFO L388 chiAutomizerObserver]: Analyzing ICFG cstrpbrk_mixed_alloca.i [2022-02-21 03:35:23,035 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:35:23,035 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:35:23,035 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:35:23,035 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:35:23,035 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:35:23,036 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:35:23,036 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:35:23,036 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:35:23,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 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-02-21 03:35:23,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:35:23,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:23,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:23,065 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:23,065 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:35:23,065 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:35:23,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 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-02-21 03:35:23,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:35:23,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:23,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:23,069 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:23,070 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:35:23,074 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 17#L382true assume !(main_~length1~0#1 < 1); 15#L382-2true assume !(main_~length2~0#1 < 1); 5#L385-1true call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 9#L369-4true [2022-02-21 03:35:23,075 INFO L793 eck$LassoCheckResult]: Loop: 9#L369-4true call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 16#L369-1true assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; 7#L372-5true assume !true; 6#L372-6true call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); 18#L374true assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1; 10#L369-3true cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset; 9#L369-4true [2022-02-21 03:35:23,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:23,078 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-02-21 03:35:23,085 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:23,086 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274286972] [2022-02-21 03:35:23,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:23,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:23,197 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:23,240 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:23,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:23,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2022-02-21 03:35:23,245 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:23,245 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666221889] [2022-02-21 03:35:23,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:23,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:23,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#true} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {24#true} is VALID [2022-02-21 03:35:23,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {24#true} is VALID [2022-02-21 03:35:23,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-02-21 03:35:23,310 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#false} call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); {25#false} is VALID [2022-02-21 03:35:23,310 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#false} assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1; {25#false} is VALID [2022-02-21 03:35:23,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#false} cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset; {25#false} is VALID [2022-02-21 03:35:23,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:23,312 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:23,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666221889] [2022-02-21 03:35:23,313 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666221889] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:35:23,314 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:35:23,314 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:35:23,315 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278947355] [2022-02-21 03:35:23,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:35:23,318 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:35:23,318 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:23,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:35:23,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:35:23,355 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 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 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02-21 03:35:23,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:23,383 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-02-21 03:35:23,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:35:23,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02-21 03:35:23,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:23,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2022-02-21 03:35:23,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:35:23,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2022-02-21 03:35:23,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-02-21 03:35:23,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-02-21 03:35:23,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2022-02-21 03:35:23,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:23,437 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:35:23,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2022-02-21 03:35:23,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-21 03:35:23,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:23,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 17 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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-02-21 03:35:23,455 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 17 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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-02-21 03:35:23,456 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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-02-21 03:35:23,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:23,458 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2022-02-21 03:35:23,458 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:35:23,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:23,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:23,459 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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) Second operand 13 states and 17 transitions. [2022-02-21 03:35:23,460 INFO L87 Difference]: Start difference. First operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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) Second operand 13 states and 17 transitions. [2022-02-21 03:35:23,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:23,461 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2022-02-21 03:35:23,461 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:35:23,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:23,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:23,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:23,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:23,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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-02-21 03:35:23,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2022-02-21 03:35:23,465 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:35:23,466 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:35:23,466 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:35:23,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:35:23,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:35:23,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:23,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:23,467 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:23,468 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:23,468 INFO L791 eck$LassoCheckResult]: Stem: 44#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 45#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 52#L382 assume !(main_~length1~0#1 < 1); 56#L382-2 assume !(main_~length2~0#1 < 1); 46#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 47#L369-4 [2022-02-21 03:35:23,469 INFO L793 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 53#L369-1 assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; 50#L372-5 call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1; 51#L372-1 assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); 55#L372-3 assume !cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1; 48#L372-6 call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); 49#L374 assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1; 54#L369-3 cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset; 47#L369-4 [2022-02-21 03:35:23,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:23,470 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2022-02-21 03:35:23,473 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:23,473 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190889090] [2022-02-21 03:35:23,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:23,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:23,510 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:23,535 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:23,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:23,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2022-02-21 03:35:23,536 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:23,536 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311034956] [2022-02-21 03:35:23,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:23,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:23,565 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:23,574 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:23,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:23,575 INFO L85 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2022-02-21 03:35:23,575 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:23,576 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353929693] [2022-02-21 03:35:23,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:23,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:23,626 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:23,655 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:24,387 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:24,388 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:24,388 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:24,388 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:24,388 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:24,389 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:24,389 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:24,389 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:24,389 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_mixed_alloca.i_Iteration2_Lasso [2022-02-21 03:35:24,389 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:24,389 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:24,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-02-21 03:35:24,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:24,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:25,531 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:25,534 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:25,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,539 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-02-21 03:35:25,546 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-02-21 03:35:25,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,552 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:25,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:25,554 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:25,559 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-02-21 03:35:25,572 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,594 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-02-21 03:35:25,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,598 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-02-21 03:35:25,604 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-02-21 03:35:25,604 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-02-21 03:35:25,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,616 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:25,616 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:25,632 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-02-21 03:35:25,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,650 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-02-21 03:35:25,651 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-02-21 03:35:25,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:25,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,675 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:25,691 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:25,712 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,752 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-02-21 03:35:25,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,754 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-02-21 03:35:25,755 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-02-21 03:35:25,757 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-02-21 03:35:25,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,765 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:25,765 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:25,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:25,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,811 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-02-21 03:35:25,819 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-02-21 03:35:25,820 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-02-21 03:35:25,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,830 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:25,830 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:25,832 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,864 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-02-21 03:35:25,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,867 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-02-21 03:35:25,867 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-02-21 03:35:25,868 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-02-21 03:35:25,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,880 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:25,880 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:25,895 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-02-21 03:35:25,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,931 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-02-21 03:35:25,932 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-02-21 03:35:25,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:25,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,941 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:25,941 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:25,943 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,967 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-02-21 03:35:25,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,968 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-02-21 03:35:25,970 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-02-21 03:35:25,971 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-02-21 03:35:25,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,979 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:25,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:25,981 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:26,035 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-02-21 03:35:26,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,037 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-02-21 03:35:26,041 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-02-21 03:35:26,042 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-02-21 03:35:26,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:26,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:26,048 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:35:26,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,051 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 03:35:26,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:26,061 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:26,077 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-02-21 03:35:26,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,079 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-02-21 03:35:26,082 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-02-21 03:35:26,089 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-02-21 03:35:26,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:26,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:26,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:26,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,097 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:26,097 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:26,098 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:26,115 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-02-21 03:35:26,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,117 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-02-21 03:35:26,118 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-02-21 03:35:26,120 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-02-21 03:35:26,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:26,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:26,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,156 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:26,158 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:26,177 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:26,240 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-02-21 03:35:26,241 INFO L444 ModelExtractionUtils]: 19 out of 49 variables were initially zero. Simplification set additionally 27 variables to zero. [2022-02-21 03:35:26,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,252 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-02-21 03:35:26,253 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-02-21 03:35:26,255 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:26,276 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:26,276 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:26,277 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~sc1~0#1.offset, v_rep(select #length ULTIMATE.start_cstrpbrk_~sc1~0#1.base)_1) = -1*ULTIMATE.start_cstrpbrk_~sc1~0#1.offset + 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~sc1~0#1.base)_1 Supporting invariants [] [2022-02-21 03:35:26,314 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-02-21 03:35:26,398 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2022-02-21 03:35:26,402 INFO L390 LassoCheck]: Loop: "call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);" "assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1;" "call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1;" "assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256);" "assume !cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1;" "call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);" "assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1;" "cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset;" [2022-02-21 03:35:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:26,437 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-02-21 03:35:26,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:26,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:35:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:26,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:26,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {92#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {92#unseeded} is VALID [2022-02-21 03:35:26,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {92#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; {92#unseeded} is VALID [2022-02-21 03:35:26,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {92#unseeded} assume !(main_~length1~0#1 < 1); {92#unseeded} is VALID [2022-02-21 03:35:26,502 INFO L290 TraceCheckUtils]: 3: Hoare triple {92#unseeded} assume !(main_~length2~0#1 < 1); {92#unseeded} is VALID [2022-02-21 03:35:26,503 INFO L290 TraceCheckUtils]: 4: Hoare triple {92#unseeded} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; {92#unseeded} is VALID [2022-02-21 03:35:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:26,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:35:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:26,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:26,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {95#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)))} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {167#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|))))} is VALID [2022-02-21 03:35:26,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {167#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|))))} assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {167#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|))))} is VALID [2022-02-21 03:35:26,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {167#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|))))} call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1; {167#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|))))} is VALID [2022-02-21 03:35:26,612 INFO L290 TraceCheckUtils]: 3: Hoare triple {167#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|))))} assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); {167#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|))))} is VALID [2022-02-21 03:35:26,613 INFO L290 TraceCheckUtils]: 4: Hoare triple {167#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|))))} assume !cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1; {167#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|))))} is VALID [2022-02-21 03:35:26,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {167#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|))))} call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); {167#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|))))} is VALID [2022-02-21 03:35:26,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {167#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|))))} assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1; {167#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|))))} is VALID [2022-02-21 03:35:26,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {167#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|))))} cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset; {150#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)))) unseeded)} is VALID [2022-02-21 03:35:26,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:26,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-02-21 03:35:26,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:26,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:26,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,627 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-02-21 03:35:26,628 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-02-21 03:35:26,702 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 21 states and 28 transitions. Complement of second has 4 states. [2022-02-21 03:35:26,702 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-02-21 03:35:26,702 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:26,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. cyclomatic complexity: 5 [2022-02-21 03:35:26,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:26,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:26,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-02-21 03:35:26,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:26,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:26,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:26,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2022-02-21 03:35:26,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:26,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:26,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:26,710 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 17 transitions. cyclomatic complexity: 5 [2022-02-21 03:35:26,729 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:35:26,730 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-02-21 03:35:26,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:26,733 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:26,733 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2022-02-21 03:35:26,733 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:26,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:26,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:26,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:26,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:26,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:26,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:26,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:26,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:26,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:26,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:35:26,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:35:26,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:35:26,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:35:26,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:35:26,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:35:26,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:35:26,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:35:26,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:35:26,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 8 letters. [2022-02-21 03:35:26,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Stem has 10 letters. Loop has 8 letters. [2022-02-21 03:35:26,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 8 letters. [2022-02-21 03:35:26,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:35:26,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:35:26,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:35:26,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:26,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:26,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:26,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:26,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:26,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:26,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 8 letters. [2022-02-21 03:35:26,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Stem has 6 letters. Loop has 8 letters. [2022-02-21 03:35:26,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 8 letters. [2022-02-21 03:35:26,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:35:26,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:35:26,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:35:26,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:26,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:26,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:26,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:26,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:26,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:26,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:26,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:26,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:26,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:26,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:26,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:26,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:26,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:26,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:26,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:26,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:26,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:26,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,749 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:26,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-02-21 03:35:26,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-02-21 03:35:26,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:26,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:35:26,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2022-02-21 03:35:26,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2022-02-21 03:35:26,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:26,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2022-02-21 03:35:26,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:35:26,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 03:35:26,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2022-02-21 03:35:26,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:35:26,771 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 03:35:26,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2022-02-21 03:35:26,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-21 03:35:26,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:26,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 25 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 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-02-21 03:35:26,772 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 25 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 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-02-21 03:35:26,773 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 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-02-21 03:35:26,774 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:26,776 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-02-21 03:35:26,776 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2022-02-21 03:35:26,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:26,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:26,777 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 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 18 states and 25 transitions. [2022-02-21 03:35:26,777 INFO L87 Difference]: Start difference. First operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 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 18 states and 25 transitions. [2022-02-21 03:35:26,777 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:26,778 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-02-21 03:35:26,779 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2022-02-21 03:35:26,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:26,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:26,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:26,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:26,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 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-02-21 03:35:26,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2022-02-21 03:35:26,784 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 03:35:26,784 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 03:35:26,784 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:35:26,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2022-02-21 03:35:26,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:26,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:26,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:26,786 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:26,786 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:35:26,786 INFO L791 eck$LassoCheckResult]: Stem: 218#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 219#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 226#L382 assume !(main_~length1~0#1 < 1); 233#L382-2 assume !(main_~length2~0#1 < 1); 216#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 217#L369-4 call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 228#L369-1 assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; 222#L372-5 [2022-02-21 03:35:26,786 INFO L793 eck$LassoCheckResult]: Loop: 222#L372-5 call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1; 223#L372-1 assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); 231#L372-3 assume !!cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1;cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset - 1;havoc cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset; 222#L372-5 [2022-02-21 03:35:26,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:26,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2022-02-21 03:35:26,786 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:26,786 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090661191] [2022-02-21 03:35:26,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:26,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:26,868 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:26,888 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:26,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:26,888 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2022-02-21 03:35:26,888 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:26,888 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020879743] [2022-02-21 03:35:26,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:26,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:26,913 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:26,941 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:26,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:26,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2022-02-21 03:35:26,942 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:26,942 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608466407] [2022-02-21 03:35:26,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:26,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:26,993 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:27,031 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:27,842 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:27,843 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:27,843 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:27,843 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:27,843 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:27,843 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,843 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:27,843 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:27,843 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_mixed_alloca.i_Iteration3_Lasso [2022-02-21 03:35:27,843 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:27,843 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:27,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:27,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:27,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:27,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:27,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:27,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:27,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:27,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:27,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:27,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:27,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:27,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:27,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:27,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-02-21 03:35:28,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:28,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:28,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:28,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:28,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:28,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:28,952 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:28,953 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:28,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:28,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:28,972 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-02-21 03:35:28,974 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-02-21 03:35:28,977 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-02-21 03:35:28,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:28,984 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:28,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:28,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:28,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:28,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:28,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:28,998 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:29,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:29,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:29,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:29,021 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-02-21 03:35:29,021 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-02-21 03:35:29,023 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-02-21 03:35:29,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:29,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:29,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:29,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:29,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:29,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:29,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:29,039 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:29,058 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-02-21 03:35:29,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:29,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:29,060 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-02-21 03:35:29,060 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-02-21 03:35:29,062 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-02-21 03:35:29,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:29,068 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:29,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:29,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:29,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:29,069 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:29,069 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:29,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:29,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:29,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:29,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:29,102 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-02-21 03:35:29,104 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-02-21 03:35:29,105 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-02-21 03:35:29,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:29,112 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:29,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:29,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:29,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:29,113 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:29,113 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:29,114 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:29,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:29,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:29,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:29,132 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-02-21 03:35:29,133 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-02-21 03:35:29,134 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-02-21 03:35:29,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:29,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:29,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:29,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:29,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:29,141 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:29,141 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:29,156 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:29,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-02-21 03:35:29,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:29,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:29,177 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-02-21 03:35:29,179 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-02-21 03:35:29,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-02-21 03:35:29,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:29,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:29,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:29,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:29,188 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:29,188 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:29,203 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:29,229 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-02-21 03:35:29,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:29,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:29,231 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-02-21 03:35:29,240 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-02-21 03:35:29,240 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-02-21 03:35:29,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:29,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:29,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:29,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:29,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:29,247 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:29,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:29,250 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:29,266 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-02-21 03:35:29,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:29,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:29,268 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-02-21 03:35:29,269 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-02-21 03:35:29,270 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-02-21 03:35:29,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:29,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:29,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:29,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:29,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:29,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:29,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:29,292 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:29,308 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-02-21 03:35:29,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:29,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:29,309 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-02-21 03:35:29,310 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-02-21 03:35:29,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-02-21 03:35:29,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:29,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:29,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:29,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:29,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:29,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:29,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:29,333 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:29,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 03:35:29,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:29,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:29,352 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-02-21 03:35:29,353 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-02-21 03:35:29,375 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-02-21 03:35:29,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:29,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:29,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:29,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:29,384 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:29,384 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:29,398 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:29,414 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-02-21 03:35:29,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:29,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:29,420 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-02-21 03:35:29,427 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-02-21 03:35:29,428 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-02-21 03:35:29,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:29,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:29,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:29,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:29,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:29,436 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:29,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:29,449 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:29,465 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-02-21 03:35:29,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:29,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:29,467 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-02-21 03:35:29,468 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-02-21 03:35:29,469 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-02-21 03:35:29,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:29,476 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:29,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:29,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:29,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:29,476 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:29,476 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:29,491 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:29,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:29,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:29,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:29,522 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-02-21 03:35:29,523 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-02-21 03:35:29,524 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-02-21 03:35:29,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:29,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:29,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:29,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:29,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:29,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:29,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:29,546 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:29,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:29,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:29,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:29,565 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-02-21 03:35:29,566 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-02-21 03:35:29,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:29,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:29,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:29,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:29,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:29,589 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:29,589 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:29,592 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:29,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:29,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:29,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:29,609 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-02-21 03:35:29,611 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-02-21 03:35:29,613 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-02-21 03:35:29,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:29,620 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-02-21 03:35:29,620 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2022-02-21 03:35:29,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:29,682 INFO L401 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2022-02-21 03:35:29,682 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2022-02-21 03:35:29,761 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:29,800 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-02-21 03:35:29,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:29,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:29,816 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-02-21 03:35:29,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-02-21 03:35:29,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:29,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:29,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:29,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:29,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:29,826 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:29,828 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-02-21 03:35:29,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:29,861 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-02-21 03:35:29,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:29,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:29,863 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-02-21 03:35:29,864 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-02-21 03:35:29,866 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-02-21 03:35:29,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:29,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:29,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:29,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:29,873 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:29,874 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:29,885 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:29,903 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-02-21 03:35:29,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:29,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:29,905 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-02-21 03:35:29,905 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-02-21 03:35:29,907 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-02-21 03:35:29,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:29,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:29,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:29,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:29,915 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:29,915 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:29,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:29,965 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-02-21 03:35:29,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:29,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:29,978 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-02-21 03:35:29,979 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-02-21 03:35:29,981 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-02-21 03:35:29,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:29,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:29,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:29,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:29,992 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:29,992 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:30,008 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:30,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:30,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:30,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:30,026 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-02-21 03:35:30,027 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-02-21 03:35:30,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-02-21 03:35:30,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:30,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:30,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:30,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:30,037 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:30,037 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:30,039 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:30,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:30,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:30,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:30,058 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-02-21 03:35:30,059 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-02-21 03:35:30,061 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-02-21 03:35:30,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:30,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:30,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:30,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:30,068 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:30,068 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:30,071 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:30,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:30,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:30,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:30,090 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-02-21 03:35:30,091 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-02-21 03:35:30,092 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-02-21 03:35:30,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:30,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:30,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:30,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:30,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:30,108 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:30,120 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:30,138 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:35:30,138 INFO L444 ModelExtractionUtils]: 41 out of 46 variables were initially zero. Simplification set additionally 2 variables to zero. [2022-02-21 03:35:30,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:30,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:30,140 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-02-21 03:35:30,141 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-02-21 03:35:30,142 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:30,150 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:30,150 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:30,150 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0#1.offset) = 2*ULTIMATE.start_cstrpbrk_~s~0#1.offset + 1 Supporting invariants [] [2022-02-21 03:35:30,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:30,249 INFO L297 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2022-02-21 03:35:30,252 INFO L390 LassoCheck]: Loop: "call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1;" "assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256);" "assume !!cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1;cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset - 1;havoc cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset;" [2022-02-21 03:35:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:30,288 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-02-21 03:35:30,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:30,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:35:30,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:30,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:30,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {323#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {323#unseeded} is VALID [2022-02-21 03:35:30,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {323#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; {323#unseeded} is VALID [2022-02-21 03:35:30,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {323#unseeded} assume !(main_~length1~0#1 < 1); {323#unseeded} is VALID [2022-02-21 03:35:30,336 INFO L290 TraceCheckUtils]: 3: Hoare triple {323#unseeded} assume !(main_~length2~0#1 < 1); {323#unseeded} is VALID [2022-02-21 03:35:30,336 INFO L290 TraceCheckUtils]: 4: Hoare triple {323#unseeded} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; {323#unseeded} is VALID [2022-02-21 03:35:30,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {323#unseeded} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {323#unseeded} is VALID [2022-02-21 03:35:30,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {323#unseeded} assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {323#unseeded} is VALID [2022-02-21 03:35:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:30,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:35:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:30,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:30,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {326#(>= oldRank0 (+ (* 2 |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) 1))} call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1; {444#(and (<= 0 |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (>= oldRank0 (+ (* |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 2) 1)))} is VALID [2022-02-21 03:35:30,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {444#(and (<= 0 |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (>= oldRank0 (+ (* |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 2) 1)))} assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); {444#(and (<= 0 |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (>= oldRank0 (+ (* |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 2) 1)))} is VALID [2022-02-21 03:35:30,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {444#(and (<= 0 |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (>= oldRank0 (+ (* |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 2) 1)))} assume !!cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1;cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset - 1;havoc cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset; {421#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) 1))))} is VALID [2022-02-21 03:35:30,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:30,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-02-21 03:35:30,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:30,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:30,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,378 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-02-21 03:35:30,378 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-02-21 03:35:30,415 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 43 states and 57 transitions. Complement of second has 5 states. [2022-02-21 03:35:30,415 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-02-21 03:35:30,415 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:30,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. cyclomatic complexity: 9 [2022-02-21 03:35:30,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:30,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:30,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-02-21 03:35:30,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:30,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:30,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:30,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 57 transitions. [2022-02-21 03:35:30,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:30,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:30,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:30,417 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 25 transitions. cyclomatic complexity: 9 [2022-02-21 03:35:30,417 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:30,417 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-02-21 03:35:30,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:30,418 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:30,418 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 43 states and 57 transitions. cyclomatic complexity: 18 [2022-02-21 03:35:30,418 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:30,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:30,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:30,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:30,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:30,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:30,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:30,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:30,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:30,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:30,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 43 letters. Loop has 43 letters. [2022-02-21 03:35:30,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Stem has 43 letters. Loop has 43 letters. [2022-02-21 03:35:30,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 43 letters. Loop has 43 letters. [2022-02-21 03:35:30,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:35:30,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:35:30,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:35:30,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:35:30,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:35:30,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:35:30,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:30,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:30,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:30,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:30,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:30,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:30,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:30,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:30,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:30,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:30,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:30,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:30,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:30,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:30,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:30,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:30,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:30,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:30,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:30,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:30,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:30,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,431 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:30,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-02-21 03:35:30,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-02-21 03:35:30,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:30,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:35:30,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:35:30,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:30,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. cyclomatic complexity: 18 [2022-02-21 03:35:30,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:30,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2022-02-21 03:35:30,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:35:30,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:35:30,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2022-02-21 03:35:30,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:35:30,440 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2022-02-21 03:35:30,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2022-02-21 03:35:30,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2022-02-21 03:35:30,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:30,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states and 40 transitions. Second operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 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-02-21 03:35:30,443 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states and 40 transitions. Second operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 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-02-21 03:35:30,443 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 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-02-21 03:35:30,444 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:30,445 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-02-21 03:35:30,445 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-21 03:35:30,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:30,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:30,446 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 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) Second operand 30 states and 40 transitions. [2022-02-21 03:35:30,446 INFO L87 Difference]: Start difference. First operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 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) Second operand 30 states and 40 transitions. [2022-02-21 03:35:30,446 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:30,448 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-02-21 03:35:30,448 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-21 03:35:30,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:30,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:30,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:30,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:30,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 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-02-21 03:35:30,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2022-02-21 03:35:30,450 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2022-02-21 03:35:30,450 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2022-02-21 03:35:30,451 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:35:30,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2022-02-21 03:35:30,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:30,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:30,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:30,452 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:30,452 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:35:30,453 INFO L791 eck$LassoCheckResult]: Stem: 501#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 502#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 511#L382 assume !(main_~length1~0#1 < 1); 520#L382-2 assume !(main_~length2~0#1 < 1); 503#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 504#L369-4 call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 512#L369-1 assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; 521#L372-5 call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1; 524#L372-1 assume !cstrpbrk_#t~short210#1; 522#L372-3 assume !cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1; 505#L372-6 call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); 506#L374 assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1; 516#L369-3 cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset; 513#L369-4 call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 515#L369-1 assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; 507#L372-5 [2022-02-21 03:35:30,453 INFO L793 eck$LassoCheckResult]: Loop: 507#L372-5 call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1; 508#L372-1 assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); 517#L372-3 assume !!cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1;cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset - 1;havoc cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset; 507#L372-5 [2022-02-21 03:35:30,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:30,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2022-02-21 03:35:30,453 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:30,453 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897557707] [2022-02-21 03:35:30,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:30,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:30,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {649#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {649#true} is VALID [2022-02-21 03:35:30,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {649#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; {649#true} is VALID [2022-02-21 03:35:30,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {649#true} assume !(main_~length1~0#1 < 1); {649#true} is VALID [2022-02-21 03:35:30,548 INFO L290 TraceCheckUtils]: 3: Hoare triple {649#true} assume !(main_~length2~0#1 < 1); {649#true} is VALID [2022-02-21 03:35:30,549 INFO L290 TraceCheckUtils]: 4: Hoare triple {649#true} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; {649#true} is VALID [2022-02-21 03:35:30,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {649#true} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {651#(= |ULTIMATE.start_cstrpbrk_#t~mem206#1| (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))} is VALID [2022-02-21 03:35:30,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {651#(= |ULTIMATE.start_cstrpbrk_#t~mem206#1| (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))} assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {652#(not (= 0 |ULTIMATE.start_cstrpbrk_~c~0#1|))} is VALID [2022-02-21 03:35:30,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {652#(not (= 0 |ULTIMATE.start_cstrpbrk_~c~0#1|))} call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1; {653#(or (not (= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~s~0#1.base|) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) |ULTIMATE.start_cstrpbrk_~c~0#1|)) |ULTIMATE.start_cstrpbrk_#t~short210#1|)} is VALID [2022-02-21 03:35:30,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {653#(or (not (= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~s~0#1.base|) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) |ULTIMATE.start_cstrpbrk_~c~0#1|)) |ULTIMATE.start_cstrpbrk_#t~short210#1|)} assume !cstrpbrk_#t~short210#1; {654#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~s~0#1.base|) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) |ULTIMATE.start_cstrpbrk_~c~0#1|))} is VALID [2022-02-21 03:35:30,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {654#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~s~0#1.base|) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) |ULTIMATE.start_cstrpbrk_~c~0#1|))} assume !cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1; {654#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~s~0#1.base|) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) |ULTIMATE.start_cstrpbrk_~c~0#1|))} is VALID [2022-02-21 03:35:30,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {654#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~s~0#1.base|) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) |ULTIMATE.start_cstrpbrk_~c~0#1|))} call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); {655#(not (= |ULTIMATE.start_cstrpbrk_#t~mem212#1| |ULTIMATE.start_cstrpbrk_~c~0#1|))} is VALID [2022-02-21 03:35:30,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {655#(not (= |ULTIMATE.start_cstrpbrk_#t~mem212#1| |ULTIMATE.start_cstrpbrk_~c~0#1|))} assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1; {650#false} is VALID [2022-02-21 03:35:30,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {650#false} cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset; {650#false} is VALID [2022-02-21 03:35:30,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {650#false} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {650#false} is VALID [2022-02-21 03:35:30,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {650#false} assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {650#false} is VALID [2022-02-21 03:35:30,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:30,553 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:30,553 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897557707] [2022-02-21 03:35:30,553 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897557707] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:35:30,553 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:35:30,553 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-21 03:35:30,553 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090266738] [2022-02-21 03:35:30,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:35:30,553 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:35:30,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:30,554 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2022-02-21 03:35:30,554 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:30,554 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309929779] [2022-02-21 03:35:30,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:30,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:30,568 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:30,572 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:30,693 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:30,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:35:30,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:35:30,694 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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-02-21 03:35:30,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:30,866 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-21 03:35:30,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:35:30,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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-02-21 03:35:30,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:30,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2022-02-21 03:35:30,879 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:35:30,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2022-02-21 03:35:30,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:35:30,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:35:30,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2022-02-21 03:35:30,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:35:30,880 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-02-21 03:35:30,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2022-02-21 03:35:30,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-02-21 03:35:30,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:30,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states and 35 transitions. Second operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 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-02-21 03:35:30,883 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states and 35 transitions. Second operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 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-02-21 03:35:30,883 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 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-02-21 03:35:30,884 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:30,885 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-02-21 03:35:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-02-21 03:35:30,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:30,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:30,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 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) Second operand 27 states and 35 transitions. [2022-02-21 03:35:30,886 INFO L87 Difference]: Start difference. First operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 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) Second operand 27 states and 35 transitions. [2022-02-21 03:35:30,886 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:30,888 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-02-21 03:35:30,888 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-02-21 03:35:30,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:30,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:30,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:30,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:30,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 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-02-21 03:35:30,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-02-21 03:35:30,891 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-02-21 03:35:30,891 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-02-21 03:35:30,891 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:35:30,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2022-02-21 03:35:30,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:30,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:30,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:30,892 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:30,892 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:35:30,892 INFO L791 eck$LassoCheckResult]: Stem: 696#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 697#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 706#L382 assume !(main_~length1~0#1 < 1); 715#L382-2 assume !(main_~length2~0#1 < 1); 698#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 699#L369-4 call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 707#L369-1 assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; 720#L372-5 call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1; 719#L372-1 assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); 717#L372-3 assume !cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1; 700#L372-6 call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); 701#L374 assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1; 711#L369-3 cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset; 708#L369-4 call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 710#L369-1 assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; 702#L372-5 [2022-02-21 03:35:30,892 INFO L793 eck$LassoCheckResult]: Loop: 702#L372-5 call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1; 703#L372-1 assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); 712#L372-3 assume !!cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1;cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset - 1;havoc cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset; 702#L372-5 [2022-02-21 03:35:30,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:30,893 INFO L85 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2022-02-21 03:35:30,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:30,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721069746] [2022-02-21 03:35:30,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:30,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:30,937 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:30,955 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:30,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:30,956 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2022-02-21 03:35:30,956 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:30,956 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625629880] [2022-02-21 03:35:30,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:30,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:30,961 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:30,964 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:30,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:30,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2022-02-21 03:35:30,965 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:30,965 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604499405] [2022-02-21 03:35:30,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:30,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:30,985 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:30,999 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:32,191 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:32,191 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:32,191 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:32,191 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:32,191 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:32,191 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:32,191 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:32,191 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:32,191 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_mixed_alloca.i_Iteration5_Lasso [2022-02-21 03:35:32,191 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:32,191 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:32,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-02-21 03:35:32,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-02-21 03:35:32,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-02-21 03:35:32,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-02-21 03:35:32,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-02-21 03:35:32,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,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-02-21 03:35:32,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,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-02-21 03:35:32,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-02-21 03:35:32,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,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-02-21 03:35:32,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:33,792 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:33,793 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:33,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:33,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:33,799 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-02-21 03:35:33,800 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-02-21 03:35:33,801 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-02-21 03:35:33,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:33,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:33,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:33,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:33,810 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:33,810 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:33,812 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:33,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-02-21 03:35:33,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:33,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:33,840 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-02-21 03:35:33,842 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-02-21 03:35:33,843 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-02-21 03:35:33,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:33,851 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:33,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:33,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:33,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:33,859 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:33,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:33,861 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:33,880 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-02-21 03:35:33,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:33,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:33,881 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-02-21 03:35:33,882 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-02-21 03:35:33,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:33,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:33,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:33,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:33,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:33,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:33,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:33,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:33,905 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:33,925 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-02-21 03:35:33,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:33,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:33,927 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-02-21 03:35:33,939 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-02-21 03:35:33,940 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-02-21 03:35:33,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:33,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:33,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:33,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:33,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:33,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:33,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:33,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:33,977 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-02-21 03:35:33,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:33,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:33,980 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-02-21 03:35:33,981 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-02-21 03:35:33,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-02-21 03:35:33,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:33,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:33,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:33,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:33,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:33,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:33,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:33,991 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:34,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:34,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:34,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:34,011 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-02-21 03:35:34,012 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-02-21 03:35:34,013 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-02-21 03:35:34,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:34,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:34,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:34,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:34,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:34,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:34,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:34,031 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:34,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:34,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:34,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:34,050 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-02-21 03:35:34,054 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-02-21 03:35:34,056 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-02-21 03:35:34,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:34,062 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:34,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:34,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:34,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:34,062 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:34,063 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:34,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:34,093 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-02-21 03:35:34,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:34,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:34,095 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-02-21 03:35:34,096 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-02-21 03:35:34,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:34,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:34,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:34,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:34,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:34,106 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:34,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:34,120 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:34,140 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-02-21 03:35:34,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:34,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:34,142 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-02-21 03:35:34,148 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-02-21 03:35:34,149 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-02-21 03:35:34,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:34,156 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:34,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:34,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:34,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:34,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:34,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:34,170 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:34,188 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-02-21 03:35:34,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:34,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:34,190 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-02-21 03:35:34,191 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-02-21 03:35:34,193 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-02-21 03:35:34,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:34,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:34,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:34,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:34,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:34,199 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:34,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:34,214 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:34,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:34,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:34,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:34,231 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-02-21 03:35:34,232 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-02-21 03:35:34,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-02-21 03:35:34,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:34,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:34,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:34,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:34,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:34,240 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:34,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:34,251 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:34,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:34,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:34,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:34,272 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-02-21 03:35:34,273 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-02-21 03:35:34,275 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-02-21 03:35:34,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:34,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:34,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:34,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:34,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:34,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:34,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:34,296 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:34,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:34,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:34,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:34,312 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-02-21 03:35:34,313 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-02-21 03:35:34,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-02-21 03:35:34,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:34,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:34,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:34,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:34,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:34,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:34,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:34,335 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:34,352 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-02-21 03:35:34,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:34,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:34,353 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-02-21 03:35:34,354 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-02-21 03:35:34,356 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-02-21 03:35:34,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:34,361 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:34,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:34,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:34,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:34,362 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:34,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:34,363 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:34,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:34,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:34,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:34,380 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-02-21 03:35:34,381 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-02-21 03:35:34,382 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-02-21 03:35:34,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:34,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:34,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:34,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:34,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:34,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:34,418 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:34,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:34,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:34,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:34,437 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-02-21 03:35:34,438 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-02-21 03:35:34,439 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-02-21 03:35:34,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:34,446 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-02-21 03:35:34,446 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2022-02-21 03:35:34,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:34,548 INFO L401 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2022-02-21 03:35:34,548 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2022-02-21 03:35:34,759 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:34,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:34,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:34,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:34,814 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-02-21 03:35:34,815 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-02-21 03:35:34,817 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-02-21 03:35:34,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:34,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:34,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:34,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:34,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:34,826 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:34,839 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:34,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:34,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:34,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:34,857 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-02-21 03:35:34,857 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-02-21 03:35:34,859 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-02-21 03:35:34,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:34,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:34,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:34,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:34,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:34,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:34,885 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:34,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:34,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:34,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:34,903 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-02-21 03:35:34,962 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-02-21 03:35:34,962 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-02-21 03:35:34,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:34,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:34,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:34,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:34,970 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:34,970 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:34,972 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:35,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:35,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:35,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:35,002 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-02-21 03:35:35,014 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-02-21 03:35:35,014 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-02-21 03:35:35,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:35,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:35,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:35,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:35,024 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:35,024 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:35,039 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:35,055 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-02-21 03:35:35,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:35,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:35,056 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-02-21 03:35:35,057 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-02-21 03:35:35,058 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-02-21 03:35:35,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:35,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:35,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:35,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:35,065 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:35,065 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:35,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:35,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:35,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:35,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:35,113 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-02-21 03:35:35,113 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-02-21 03:35:35,115 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-02-21 03:35:35,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:35,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:35,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:35,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:35,129 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:35,129 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:35,151 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:35,185 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2022-02-21 03:35:35,185 INFO L444 ModelExtractionUtils]: 9 out of 52 variables were initially zero. Simplification set additionally 40 variables to zero. [2022-02-21 03:35:35,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:35,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:35,187 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-02-21 03:35:35,213 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:35,222 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-02-21 03:35:35,229 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:35,229 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:35,229 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc216#1.base)_3) = 2*ULTIMATE.start_cstrpbrk_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216#1.base)_3 Supporting invariants [] [2022-02-21 03:35:35,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:35,344 INFO L297 tatePredicateManager]: 25 out of 26 supporting invariants were superfluous and have been removed [2022-02-21 03:35:35,348 INFO L390 LassoCheck]: Loop: "call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1;" "assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256);" "assume !!cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1;cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset - 1;havoc cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset;" [2022-02-21 03:35:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:35,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:35,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:35:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:35,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:35,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {844#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {844#unseeded} is VALID [2022-02-21 03:35:35,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {844#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; {844#unseeded} is VALID [2022-02-21 03:35:35,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {844#unseeded} assume !(main_~length1~0#1 < 1); {844#unseeded} is VALID [2022-02-21 03:35:35,465 INFO L290 TraceCheckUtils]: 3: Hoare triple {844#unseeded} assume !(main_~length2~0#1 < 1); {844#unseeded} is VALID [2022-02-21 03:35:35,466 INFO L290 TraceCheckUtils]: 4: Hoare triple {844#unseeded} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; {1009#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:35,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {1009#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {1009#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:35,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {1009#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {1009#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:35,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {1009#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1; {1009#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:35,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {1009#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); {1009#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:35,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {1009#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} assume !cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1; {1009#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:35,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {1009#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); {1009#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:35,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {1009#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1; {1009#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:35,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {1009#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset; {1009#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:35,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {1009#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {1009#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:35,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {1009#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {988#(and (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) unseeded)} is VALID [2022-02-21 03:35:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:35,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 03:35:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:35,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:35,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:35,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {989#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc216#1.base|) (* 2 |ULTIMATE.start_cstrpbrk_~s~0#1.offset|))) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1; {1040#(and (<= 0 |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) (>= oldRank0 (+ (* |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 2) (select |#length| |ULTIMATE.start_main_#t~malloc216#1.base|))) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} is VALID [2022-02-21 03:35:35,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {1040#(and (<= 0 |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) (>= oldRank0 (+ (* |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 2) (select |#length| |ULTIMATE.start_main_#t~malloc216#1.base|))) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); {1040#(and (<= 0 |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) (>= oldRank0 (+ (* |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 2) (select |#length| |ULTIMATE.start_main_#t~malloc216#1.base|))) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} is VALID [2022-02-21 03:35:35,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {1040#(and (<= 0 |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) (>= oldRank0 (+ (* |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 2) (select |#length| |ULTIMATE.start_main_#t~malloc216#1.base|))) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} assume !!cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1;cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset - 1;havoc cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset; {991#(and (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc216#1.base|) (* 2 |ULTIMATE.start_cstrpbrk_~s~0#1.offset|))))))} is VALID [2022-02-21 03:35:35,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:35,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-02-21 03:35:35,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:35,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,584 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 03:35:35,584 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-02-21 03:35:35,640 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Result 41 states and 51 transitions. Complement of second has 6 states. [2022-02-21 03:35:35,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:35:35,640 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:35,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:35,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:35,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:35,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-02-21 03:35:35,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:35,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:35,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:35,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 51 transitions. [2022-02-21 03:35:35,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:35,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:35,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:35,642 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:35,642 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:35,642 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-02-21 03:35:35,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:35,643 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:35,643 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 51 transitions. cyclomatic complexity: 13 [2022-02-21 03:35:35,643 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:35,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:35,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:35,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:35,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:35,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:35,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:35,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:35,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:35,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:35,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:35,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:35,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:35,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:35,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:35,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:35,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:35,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:35,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:35,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:35,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:35,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:35,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:35,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:35,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:35,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:35,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:35,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:35,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,652 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:35,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-02-21 03:35:35,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-21 03:35:35,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,653 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:35:35,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:35,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:35:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:35,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:35,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {844#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {844#unseeded} is VALID [2022-02-21 03:35:35,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {844#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; {844#unseeded} is VALID [2022-02-21 03:35:35,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {844#unseeded} assume !(main_~length1~0#1 < 1); {844#unseeded} is VALID [2022-02-21 03:35:35,764 INFO L290 TraceCheckUtils]: 3: Hoare triple {844#unseeded} assume !(main_~length2~0#1 < 1); {844#unseeded} is VALID [2022-02-21 03:35:35,765 INFO L290 TraceCheckUtils]: 4: Hoare triple {844#unseeded} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; {1115#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:35,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {1115#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {1115#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:35,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {1115#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {1115#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:35,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {1115#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1; {1115#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:35,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {1115#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); {1115#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:35,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {1115#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} assume !cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1; {1115#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:35,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {1115#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); {1115#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:35,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {1115#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1; {1115#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:35,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {1115#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset; {1115#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:35,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {1115#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {1115#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:35,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {1115#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {988#(and (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) unseeded)} is VALID [2022-02-21 03:35:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:35,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 03:35:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:35,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:35,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {989#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc216#1.base|) (* 2 |ULTIMATE.start_cstrpbrk_~s~0#1.offset|))) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1; {1146#(and (<= 0 |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) (>= oldRank0 (+ (* |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 2) (select |#length| |ULTIMATE.start_main_#t~malloc216#1.base|))) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} is VALID [2022-02-21 03:35:35,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {1146#(and (<= 0 |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) (>= oldRank0 (+ (* |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 2) (select |#length| |ULTIMATE.start_main_#t~malloc216#1.base|))) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); {1146#(and (<= 0 |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) (>= oldRank0 (+ (* |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 2) (select |#length| |ULTIMATE.start_main_#t~malloc216#1.base|))) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} is VALID [2022-02-21 03:35:35,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {1146#(and (<= 0 |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) (>= oldRank0 (+ (* |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 2) (select |#length| |ULTIMATE.start_main_#t~malloc216#1.base|))) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} assume !!cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1;cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset - 1;havoc cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset; {991#(and (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc216#1.base|) (* 2 |ULTIMATE.start_cstrpbrk_~s~0#1.offset|))))))} is VALID [2022-02-21 03:35:35,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:35,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-02-21 03:35:35,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:35,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,844 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 03:35:35,844 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-02-21 03:35:35,887 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Result 41 states and 51 transitions. Complement of second has 6 states. [2022-02-21 03:35:35,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:35:35,887 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:35,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:35,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:35,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:35,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-02-21 03:35:35,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:35,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:35,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:35,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 51 transitions. [2022-02-21 03:35:35,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:35,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:35,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:35,888 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:35,888 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:35,888 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-02-21 03:35:35,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:35,889 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:35,889 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 51 transitions. cyclomatic complexity: 13 [2022-02-21 03:35:35,889 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:35,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:35,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:35,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:35,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:35,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:35,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:35,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:35,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:35,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:35,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:35,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:35,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:35,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:35,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:35,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:35,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:35,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:35,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:35,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:35,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:35,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:35,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:35,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:35,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:35,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:35,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:35,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:35,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,897 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:35,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-02-21 03:35:35,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-21 03:35:35,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:35,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:35,898 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:35:35,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:35,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:35:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:35,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:36,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {844#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {844#unseeded} is VALID [2022-02-21 03:35:36,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {844#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; {844#unseeded} is VALID [2022-02-21 03:35:36,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {844#unseeded} assume !(main_~length1~0#1 < 1); {844#unseeded} is VALID [2022-02-21 03:35:36,012 INFO L290 TraceCheckUtils]: 3: Hoare triple {844#unseeded} assume !(main_~length2~0#1 < 1); {844#unseeded} is VALID [2022-02-21 03:35:36,013 INFO L290 TraceCheckUtils]: 4: Hoare triple {844#unseeded} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; {1221#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:36,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {1221#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {1221#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:36,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {1221#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {1221#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:36,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {1221#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1; {1221#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:36,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {1221#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); {1221#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:36,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {1221#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} assume !cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1; {1221#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:36,016 INFO L290 TraceCheckUtils]: 10: Hoare triple {1221#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); {1221#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:36,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {1221#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1; {1221#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:36,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {1221#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset; {1221#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:36,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {1221#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {1221#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:36,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {1221#(and unseeded (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {988#(and (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) unseeded)} is VALID [2022-02-21 03:35:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:36,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 03:35:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:36,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:36,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {989#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc216#1.base|) (* 2 |ULTIMATE.start_cstrpbrk_~s~0#1.offset|))) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1; {1252#(and (<= 0 |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) (>= oldRank0 (+ (* |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 2) (select |#length| |ULTIMATE.start_main_#t~malloc216#1.base|))) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} is VALID [2022-02-21 03:35:36,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {1252#(and (<= 0 |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) (>= oldRank0 (+ (* |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 2) (select |#length| |ULTIMATE.start_main_#t~malloc216#1.base|))) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); {1252#(and (<= 0 |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) (>= oldRank0 (+ (* |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 2) (select |#length| |ULTIMATE.start_main_#t~malloc216#1.base|))) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} is VALID [2022-02-21 03:35:36,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {1252#(and (<= 0 |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) (>= oldRank0 (+ (* |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 2) (select |#length| |ULTIMATE.start_main_#t~malloc216#1.base|))) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} assume !!cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1;cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset - 1;havoc cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset; {991#(and (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc216#1.base|) (* 2 |ULTIMATE.start_cstrpbrk_~s~0#1.offset|))))))} is VALID [2022-02-21 03:35:36,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:36,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-02-21 03:35:36,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:36,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:36,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,090 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 03:35:36,090 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-02-21 03:35:36,151 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Result 41 states and 53 transitions. Complement of second has 5 states. [2022-02-21 03:35:36,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:35:36,151 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:36,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:36,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:36,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:36,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-02-21 03:35:36,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:36,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:36,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:36,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 53 transitions. [2022-02-21 03:35:36,152 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:36,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:36,152 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:36,152 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:36,152 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-02-21 03:35:36,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:36,153 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:36,153 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 53 transitions. cyclomatic complexity: 15 [2022-02-21 03:35:36,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 53 transitions. cyclomatic complexity: 15 [2022-02-21 03:35:36,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:36,153 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:35:36,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:36,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:36,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:36,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:36,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:36,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:36,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:36,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:36,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:36,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:36,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:36,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:36,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:36,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:36,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:36,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:36,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:36,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:36,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:36,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:36,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:36,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:36,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:36,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:36,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:36,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:36,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:36,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,157 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:36,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-02-21 03:35:36,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-02-21 03:35:36,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:36,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:35:36,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:35:36,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:36,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. cyclomatic complexity: 15 [2022-02-21 03:35:36,159 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:36,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2022-02-21 03:35:36,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:35:36,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:35:36,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:35:36,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:36,160 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:36,160 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:36,160 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:36,160 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:35:36,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:35:36,160 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:36,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:36,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:35:36 BoogieIcfgContainer [2022-02-21 03:35:36,165 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:35:36,166 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:35:36,166 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:35:36,166 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:35:36,166 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:22" (3/4) ... [2022-02-21 03:35:36,169 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:35:36,169 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:35:36,170 INFO L158 Benchmark]: Toolchain (without parser) took 14168.25ms. Allocated memory was 96.5MB in the beginning and 232.8MB in the end (delta: 136.3MB). Free memory was 65.9MB in the beginning and 117.3MB in the end (delta: -51.4MB). Peak memory consumption was 84.8MB. Max. memory is 16.1GB. [2022-02-21 03:35:36,171 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 96.5MB. Free memory is still 51.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:36,171 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.28ms. Allocated memory was 96.5MB in the beginning and 159.4MB in the end (delta: 62.9MB). Free memory was 65.5MB in the beginning and 125.3MB in the end (delta: -59.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:35:36,171 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.10ms. Allocated memory is still 159.4MB. Free memory was 125.3MB in the beginning and 123.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:35:36,172 INFO L158 Benchmark]: Boogie Preprocessor took 18.27ms. Allocated memory is still 159.4MB. Free memory was 123.2MB in the beginning and 121.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:35:36,172 INFO L158 Benchmark]: RCFGBuilder took 471.74ms. Allocated memory is still 159.4MB. Free memory was 121.4MB in the beginning and 107.3MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-21 03:35:36,172 INFO L158 Benchmark]: BuchiAutomizer took 13183.33ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 107.3MB in the beginning and 117.3MB in the end (delta: -10.0MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. [2022-02-21 03:35:36,173 INFO L158 Benchmark]: Witness Printer took 3.46ms. Allocated memory is still 232.8MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:36,174 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 96.5MB. Free memory is still 51.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 443.28ms. Allocated memory was 96.5MB in the beginning and 159.4MB in the end (delta: 62.9MB). Free memory was 65.5MB in the beginning and 125.3MB in the end (delta: -59.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.10ms. Allocated memory is still 159.4MB. Free memory was 125.3MB in the beginning and 123.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.27ms. Allocated memory is still 159.4MB. Free memory was 123.2MB in the beginning and 121.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 471.74ms. Allocated memory is still 159.4MB. Free memory was 121.4MB in the beginning and 107.3MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 13183.33ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 107.3MB in the beginning and 117.3MB in the end (delta: -10.0MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. * Witness Printer took 3.46ms. Allocated memory is still 232.8MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[sc1] and consists of 3 locations. One deterministic module has affine ranking function 2 * s + 1 and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] + 2 * s and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.1s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 11.3s. Construction of modules took 0.1s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 129 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 184 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 107 IncrementalHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 108 mSDtfsCounter, 107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital270 mio100 ax100 hnf100 lsp103 ukn76 mio100 lsp39 div116 bol100 ite100 ukn100 eq180 hnf91 smp93 dnf461 smp34 tf100 neg95 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 323ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:35:36,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE