./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- 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/array-memsafety/openbsd_cstrstr-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 991fb09b573d5827d0db553f1ea89a581f5a664ba8b68d6f14a043df738f2f6d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:35:29,464 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:35:29,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:35:29,490 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:35:29,494 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:35:29,497 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:35:29,499 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:35:29,500 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:35:29,502 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:35:29,503 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:35:29,504 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:35:29,505 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:35:29,506 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:35:29,510 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:35:29,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:35:29,513 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:35:29,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:35:29,515 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:35:29,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:35:29,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:35:29,522 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:35:29,524 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:35:29,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:35:29,527 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:35:29,528 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:35:29,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:35:29,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:35:29,529 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:35:29,530 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:35:29,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:35:29,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:35:29,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:35:29,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:35:29,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:35:29,532 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:35:29,533 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:35:29,533 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:35:29,533 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:35:29,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:35:29,534 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:35:29,534 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:35:29,537 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:35:29,561 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:35:29,563 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:35:29,564 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:35:29,564 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:35:29,565 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:35:29,565 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:35:29,565 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:35:29,565 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:35:29,565 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:35:29,565 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:35:29,566 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:35:29,566 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:35:29,566 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:35:29,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:35:29,567 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:35:29,567 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:35:29,567 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:35:29,567 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:35:29,567 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:35:29,567 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:35:29,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:35:29,568 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:35:29,568 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:35:29,568 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:35:29,568 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:35:29,568 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:35:29,568 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:35:29,569 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:35:29,569 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:35:29,569 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:35:29,569 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:35:29,570 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:35:29,570 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 991fb09b573d5827d0db553f1ea89a581f5a664ba8b68d6f14a043df738f2f6d [2022-02-21 04:35:29,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:35:29,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:35:29,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:35:29,769 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:35:29,769 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:35:29,770 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i [2022-02-21 04:35:29,831 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39481a523/f86479c4cd914408a9a1600860955e83/FLAGd4a5f09c2 [2022-02-21 04:35:30,200 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:35:30,207 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i [2022-02-21 04:35:30,217 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39481a523/f86479c4cd914408a9a1600860955e83/FLAGd4a5f09c2 [2022-02-21 04:35:30,230 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39481a523/f86479c4cd914408a9a1600860955e83 [2022-02-21 04:35:30,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:35:30,233 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:35:30,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:30,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:35:30,236 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:35:30,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:30" (1/1) ... [2022-02-21 04:35:30,238 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eb600ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:30, skipping insertion in model container [2022-02-21 04:35:30,238 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:30" (1/1) ... [2022-02-21 04:35:30,244 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:35:30,263 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:35:30,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:30,511 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:35:30,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:30,572 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:35:30,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:30 WrapperNode [2022-02-21 04:35:30,574 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:30,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:30,577 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:35:30,577 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:35:30,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:30" (1/1) ... [2022-02-21 04:35:30,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:30" (1/1) ... [2022-02-21 04:35:30,626 INFO L137 Inliner]: procedures = 119, calls = 23, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 156 [2022-02-21 04:35:30,626 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:30,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:35:30,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:35:30,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:35:30,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:30" (1/1) ... [2022-02-21 04:35:30,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:30" (1/1) ... [2022-02-21 04:35:30,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:30" (1/1) ... [2022-02-21 04:35:30,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:30" (1/1) ... [2022-02-21 04:35:30,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:30" (1/1) ... [2022-02-21 04:35:30,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:30" (1/1) ... [2022-02-21 04:35:30,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:30" (1/1) ... [2022-02-21 04:35:30,671 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:35:30,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:35:30,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:35:30,672 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:35:30,672 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:30" (1/1) ... [2022-02-21 04:35:30,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:30,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:30,720 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 04:35:30,739 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 04:35:30,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 04:35:30,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 04:35:30,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 04:35:30,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 04:35:30,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:35:30,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:35:30,875 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:35:30,876 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:35:31,092 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:35:31,097 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:35:31,097 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-21 04:35:31,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:31 BoogieIcfgContainer [2022-02-21 04:35:31,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:35:31,100 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:35:31,100 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:35:31,102 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:35:31,103 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:31,103 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:35:30" (1/3) ... [2022-02-21 04:35:31,104 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14f86728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:31, skipping insertion in model container [2022-02-21 04:35:31,104 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:31,104 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:30" (2/3) ... [2022-02-21 04:35:31,104 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14f86728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:31, skipping insertion in model container [2022-02-21 04:35:31,104 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:31,105 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:31" (3/3) ... [2022-02-21 04:35:31,107 INFO L388 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrstr-alloca-2.i [2022-02-21 04:35:31,141 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:35:31,141 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:35:31,142 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:35:31,142 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:35:31,142 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:35:31,142 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:35:31,142 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:35:31,142 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:35:31,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 04:35:31,189 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2022-02-21 04:35:31,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:31,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:31,194 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:35:31,194 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:31,194 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:35:31,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 04:35:31,205 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2022-02-21 04:35:31,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:31,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:31,206 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:35:31,206 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:31,211 INFO L791 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 32#L555true assume !(main_~length1~0#1 < 1); 29#L555-2true assume !(main_~length2~0#1 < 1); 7#L558-1true call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 36#L564-3true [2022-02-21 04:35:31,212 INFO L793 eck$LassoCheckResult]: Loop: 36#L564-3true assume !!(main_~i~0#1 < main_~length1~0#1);call write~int(main_#t~nondet25#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet25#1; 24#L564-2true main_#t~post24#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post24#1;havoc main_#t~post24#1; 36#L564-3true [2022-02-21 04:35:31,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:31,219 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-02-21 04:35:31,227 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:31,228 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470153989] [2022-02-21 04:35:31,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:31,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:31,314 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:31,366 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:31,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:31,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2022-02-21 04:35:31,369 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:31,369 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289987650] [2022-02-21 04:35:31,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:31,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:31,392 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:31,406 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:31,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:31,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2022-02-21 04:35:31,407 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:31,408 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829541764] [2022-02-21 04:35:31,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:31,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:31,455 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:31,478 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:31,844 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:31,845 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:31,845 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:31,845 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:31,845 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:31,845 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:31,846 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:31,846 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:31,846 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration1_Lasso [2022-02-21 04:35:31,846 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:31,846 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:31,860 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 04:35:31,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 04:35:31,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:31,873 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 04:35:31,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 04:35:31,877 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 04:35:31,879 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 04:35:31,881 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 04:35:31,884 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 04:35:31,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 04:35:31,889 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 04:35:31,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 04:35:31,892 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 04:35:31,895 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 04:35:31,897 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 04:35:31,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 04:35:32,405 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:32,408 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:32,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:32,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:32,430 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 04:35:32,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:35:32,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:32,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:32,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:32,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:32,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:32,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:32,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:32,455 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 04:35:32,465 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:32,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:32,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:32,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:32,485 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 04:35:32,486 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 04:35:32,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:32,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:32,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:32,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:32,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:32,496 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:32,496 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:32,513 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:32,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:32,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:32,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:32,530 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 04:35:32,531 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 04:35:32,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:35:32,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:32,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:32,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:32,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:32,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:32,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:32,539 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:32,555 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:32,570 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 04:35:32,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:32,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:32,571 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 04:35:32,571 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 04:35:32,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:35:32,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:32,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:32,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:32,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:32,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:32,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:32,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:32,591 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:32,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-02-21 04:35:32,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:32,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:32,607 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 04:35:32,607 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 04:35:32,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:35:32,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:32,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:32,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:32,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:32,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:32,616 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:32,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:32,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:32,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:32,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:32,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:32,653 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 04:35:32,659 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 04:35:32,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:35:32,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:32,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:32,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:32,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:32,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:32,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:32,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:32,667 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:32,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:32,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:32,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:32,683 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 04:35:32,683 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 04:35:32,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:35:32,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:32,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:32,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:32,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:32,694 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:32,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:32,712 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:32,727 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 04:35:32,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:32,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:32,729 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 04:35:32,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:35:32,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:32,742 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:32,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:32,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:32,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:32,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:32,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:32,747 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 04:35:32,755 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:32,772 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 04:35:32,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:32,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:32,774 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 04:35:32,775 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 04:35:32,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:35:32,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:32,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:32,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:32,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:32,785 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:32,785 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:32,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:32,827 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 04:35:32,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:32,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:32,829 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 04:35:32,834 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 04:35:32,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:35:32,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:32,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:32,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:32,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:32,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:32,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:32,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:32,849 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:32,864 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 04:35:32,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:32,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:32,865 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 04:35:32,866 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 04:35:32,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:35:32,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:32,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:32,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:32,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:32,877 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:32,877 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:32,889 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:32,906 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 04:35:32,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:32,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:32,908 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 04:35:32,909 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 04:35:32,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:35:32,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:32,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:32,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:32,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:32,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:32,917 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:32,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:32,918 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:32,933 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 04:35:32,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:32,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:32,934 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 04:35:32,935 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 04:35:32,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:35:32,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:32,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:32,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:32,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:32,944 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:32,944 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:32,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:32,975 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 04:35:32,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:32,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:32,976 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 04:35:32,977 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 04:35:32,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:35:32,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:32,984 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:32,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:32,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:32,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:32,987 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:32,987 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:32,996 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:33,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-02-21 04:35:33,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:33,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:33,012 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 04:35:33,013 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 04:35:33,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 04:35:33,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:33,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:33,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:33,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:33,022 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:33,022 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:33,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:33,050 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 04:35:33,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:33,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:33,052 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 04:35:33,052 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 04:35:33,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:33,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:33,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:33,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:33,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:33,065 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:33,065 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:33,075 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:33,111 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-02-21 04:35:33,111 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2022-02-21 04:35:33,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:33,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:33,114 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 04:35:33,115 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 04:35:33,152 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:33,172 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:33,172 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:33,173 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~length1~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-02-21 04:35:33,189 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 04:35:33,225 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 04:35:33,230 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~length1~0#1);call write~int(main_#t~nondet25#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet25#1;" "main_#t~post24#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post24#1;havoc main_#t~post24#1;" [2022-02-21 04:35:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:33,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:33,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:35:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:33,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:33,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {47#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {47#unseeded} is VALID [2022-02-21 04:35:33,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {47#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; {47#unseeded} is VALID [2022-02-21 04:35:33,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {47#unseeded} assume !(main_~length1~0#1 < 1); {47#unseeded} is VALID [2022-02-21 04:35:33,289 INFO L290 TraceCheckUtils]: 3: Hoare triple {47#unseeded} assume !(main_~length2~0#1 < 1); {47#unseeded} is VALID [2022-02-21 04:35:33,289 INFO L290 TraceCheckUtils]: 4: Hoare triple {47#unseeded} call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; {47#unseeded} is VALID [2022-02-21 04:35:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:33,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:35:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:33,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:33,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(>= oldRank0 (+ |ULTIMATE.start_main_~length1~0#1| (* (- 1) |ULTIMATE.start_main_~i~0#1|)))} assume !!(main_~i~0#1 < main_~length1~0#1);call write~int(main_#t~nondet25#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet25#1; {107#(and (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~length1~0#1|) (>= oldRank0 (+ |ULTIMATE.start_main_~length1~0#1| (* (- 1) |ULTIMATE.start_main_~i~0#1|))))} is VALID [2022-02-21 04:35:33,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#(and (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~length1~0#1|) (>= oldRank0 (+ |ULTIMATE.start_main_~length1~0#1| (* (- 1) |ULTIMATE.start_main_~i~0#1|))))} main_#t~post24#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post24#1;havoc main_#t~post24#1; {90#(or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~length1~0#1| (* (- 1) |ULTIMATE.start_main_~i~0#1|)))) unseeded)} is VALID [2022-02-21 04:35:33,322 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 04:35:33,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 04:35:33,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:33,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 2 letters. [2022-02-21 04:35:33,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,350 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 04:35:33,351 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 04:35:33,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:33,540 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 99 states and 145 transitions. Complement of second has 7 states. [2022-02-21 04:35:33,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:33,541 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:33,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 04:35:33,543 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2022-02-21 04:35:33,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:33,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:33,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 04:35:33,546 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:33,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:33,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:33,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 145 transitions. [2022-02-21 04:35:33,554 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2022-02-21 04:35:33,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:33,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:33,558 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 04:35:33,560 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2022-02-21 04:35:33,567 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 21 examples of accepted words. [2022-02-21 04:35:33,568 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 04:35:33,570 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:33,570 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:35:33,570 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 99 states and 145 transitions. cyclomatic complexity: 56 [2022-02-21 04:35:33,572 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 19 examples of accepted words. [2022-02-21 04:35:33,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 2 letters. [2022-02-21 04:35:33,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 2 letters. [2022-02-21 04:35:33,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:33,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 04:35:33,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 04:35:33,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:33,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 2 letters. [2022-02-21 04:35:33,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 2 letters. [2022-02-21 04:35:33,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:33,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 99 letters. Loop has 99 letters. [2022-02-21 04:35:33,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 99 letters. Loop has 99 letters. [2022-02-21 04:35:33,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 99 letters. Loop has 99 letters. [2022-02-21 04:35:33,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 37 letters. Loop has 37 letters. [2022-02-21 04:35:33,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 37 letters. Loop has 37 letters. [2022-02-21 04:35:33,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 37 letters. Loop has 37 letters. [2022-02-21 04:35:33,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 5 letters. [2022-02-21 04:35:33,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 5 letters. [2022-02-21 04:35:33,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:33,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 6 letters. [2022-02-21 04:35:33,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 6 letters. [2022-02-21 04:35:33,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 17 letters. Loop has 6 letters. [2022-02-21 04:35:33,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 04:35:33,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 04:35:33,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:33,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 6 letters. [2022-02-21 04:35:33,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 6 letters. [2022-02-21 04:35:33,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 13 letters. Loop has 6 letters. [2022-02-21 04:35:33,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 5 letters. [2022-02-21 04:35:33,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 5 letters. [2022-02-21 04:35:33,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 21 letters. Loop has 5 letters. [2022-02-21 04:35:33,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 14 letters. Loop has 3 letters. [2022-02-21 04:35:33,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 14 letters. Loop has 3 letters. [2022-02-21 04:35:33,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:33,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 5 letters. [2022-02-21 04:35:33,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 5 letters. [2022-02-21 04:35:33,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:35:33,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 8 letters. [2022-02-21 04:35:33,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 8 letters. [2022-02-21 04:35:33,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 18 letters. Loop has 8 letters. [2022-02-21 04:35:33,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 20 letters. Loop has 5 letters. [2022-02-21 04:35:33,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 20 letters. Loop has 5 letters. [2022-02-21 04:35:33,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 20 letters. Loop has 5 letters. [2022-02-21 04:35:33,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 6 letters. [2022-02-21 04:35:33,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 6 letters. [2022-02-21 04:35:33,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 16 letters. Loop has 6 letters. [2022-02-21 04:35:33,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 19 letters. Loop has 5 letters. [2022-02-21 04:35:33,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 19 letters. Loop has 5 letters. [2022-02-21 04:35:33,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 19 letters. Loop has 5 letters. [2022-02-21 04:35:33,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 6 letters. [2022-02-21 04:35:33,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 6 letters. [2022-02-21 04:35:33,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 15 letters. Loop has 6 letters. [2022-02-21 04:35:33,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 6 letters. [2022-02-21 04:35:33,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 6 letters. [2022-02-21 04:35:33,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 18 letters. Loop has 6 letters. [2022-02-21 04:35:33,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 04:35:33,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 04:35:33,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:33,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 5 letters. [2022-02-21 04:35:33,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 5 letters. [2022-02-21 04:35:33,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:35:33,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 3 letters. [2022-02-21 04:35:33,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 3 letters. [2022-02-21 04:35:33,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:33,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 3 letters. [2022-02-21 04:35:33,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 3 letters. [2022-02-21 04:35:33,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:33,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 3 letters. [2022-02-21 04:35:33,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 3 letters. [2022-02-21 04:35:33,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:33,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 2 letters. [2022-02-21 04:35:33,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 2 letters. [2022-02-21 04:35:33,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:33,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 2 letters. [2022-02-21 04:35:33,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 2 letters. [2022-02-21 04:35:33,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:33,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 2 letters. [2022-02-21 04:35:33,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 2 letters. [2022-02-21 04:35:33,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:33,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 2 letters. [2022-02-21 04:35:33,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 2 letters. [2022-02-21 04:35:33,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:33,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 1 letters. [2022-02-21 04:35:33,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 1 letters. [2022-02-21 04:35:33,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:33,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 04:35:33,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 04:35:33,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:33,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 8 letters. [2022-02-21 04:35:33,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 8 letters. [2022-02-21 04:35:33,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 18 letters. Loop has 8 letters. [2022-02-21 04:35:33,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 19 letters. Loop has 8 letters. [2022-02-21 04:35:33,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 19 letters. Loop has 8 letters. [2022-02-21 04:35:33,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 19 letters. Loop has 8 letters. [2022-02-21 04:35:33,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 20 letters. Loop has 8 letters. [2022-02-21 04:35:33,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 20 letters. Loop has 8 letters. [2022-02-21 04:35:33,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 20 letters. Loop has 8 letters. [2022-02-21 04:35:33,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 20 letters. Loop has 5 letters. [2022-02-21 04:35:33,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 20 letters. Loop has 5 letters. [2022-02-21 04:35:33,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 20 letters. Loop has 5 letters. [2022-02-21 04:35:33,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 8 letters. [2022-02-21 04:35:33,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 8 letters. [2022-02-21 04:35:33,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 21 letters. Loop has 8 letters. [2022-02-21 04:35:33,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 5 letters. [2022-02-21 04:35:33,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 5 letters. [2022-02-21 04:35:33,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 21 letters. Loop has 5 letters. [2022-02-21 04:35:33,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 14 letters. Loop has 8 letters. [2022-02-21 04:35:33,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 14 letters. Loop has 8 letters. [2022-02-21 04:35:33,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 14 letters. Loop has 8 letters. [2022-02-21 04:35:33,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 22 letters. Loop has 5 letters. [2022-02-21 04:35:33,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 22 letters. Loop has 5 letters. [2022-02-21 04:35:33,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 22 letters. Loop has 5 letters. [2022-02-21 04:35:33,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 04:35:33,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 04:35:33,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:33,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 23 letters. Loop has 12 letters. [2022-02-21 04:35:33,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 23 letters. Loop has 12 letters. [2022-02-21 04:35:33,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 23 letters. Loop has 12 letters. [2022-02-21 04:35:33,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 23 letters. Loop has 5 letters. [2022-02-21 04:35:33,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 23 letters. Loop has 5 letters. [2022-02-21 04:35:33,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 23 letters. Loop has 5 letters. [2022-02-21 04:35:33,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 24 letters. Loop has 5 letters. [2022-02-21 04:35:33,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 24 letters. Loop has 5 letters. [2022-02-21 04:35:33,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 24 letters. Loop has 5 letters. [2022-02-21 04:35:33,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 04:35:33,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 04:35:33,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:33,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 04:35:33,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 04:35:33,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:33,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 3 letters. [2022-02-21 04:35:33,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 3 letters. [2022-02-21 04:35:33,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:33,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 3 letters. [2022-02-21 04:35:33,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 3 letters. [2022-02-21 04:35:33,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:33,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 3 letters. [2022-02-21 04:35:33,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 3 letters. [2022-02-21 04:35:33,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:33,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 2 letters. [2022-02-21 04:35:33,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 2 letters. [2022-02-21 04:35:33,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:33,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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 2 letters. [2022-02-21 04:35:33,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 2 letters. [2022-02-21 04:35:33,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:33,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,638 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:33,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 04:35:33,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2022-02-21 04:35:33,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:33,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:33,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 04:35:33,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:33,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 145 transitions. cyclomatic complexity: 56 [2022-02-21 04:35:33,654 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2022-02-21 04:35:33,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 32 states and 43 transitions. [2022-02-21 04:35:33,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-02-21 04:35:33,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-02-21 04:35:33,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 43 transitions. [2022-02-21 04:35:33,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:33,669 INFO L681 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2022-02-21 04:35:33,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 43 transitions. [2022-02-21 04:35:33,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-02-21 04:35:33,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:33,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states and 43 transitions. Second operand has 32 states, 32 states have (on average 1.34375) internal successors, (43), 31 states have internal predecessors, (43), 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 04:35:33,689 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states and 43 transitions. Second operand has 32 states, 32 states have (on average 1.34375) internal successors, (43), 31 states have internal predecessors, (43), 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 04:35:33,693 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 32 states, 32 states have (on average 1.34375) internal successors, (43), 31 states have internal predecessors, (43), 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 04:35:33,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:33,696 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-02-21 04:35:33,696 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-02-21 04:35:33,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:33,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:33,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 32 states have (on average 1.34375) internal successors, (43), 31 states have internal predecessors, (43), 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 32 states and 43 transitions. [2022-02-21 04:35:33,697 INFO L87 Difference]: Start difference. First operand has 32 states, 32 states have (on average 1.34375) internal successors, (43), 31 states have internal predecessors, (43), 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 32 states and 43 transitions. [2022-02-21 04:35:33,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:33,698 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-02-21 04:35:33,698 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-02-21 04:35:33,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:33,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:33,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:33,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:33,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.34375) internal successors, (43), 31 states have internal predecessors, (43), 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 04:35:33,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2022-02-21 04:35:33,701 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2022-02-21 04:35:33,701 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2022-02-21 04:35:33,701 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:35:33,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2022-02-21 04:35:33,702 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2022-02-21 04:35:33,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:33,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:33,702 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:33,702 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:33,703 INFO L791 eck$LassoCheckResult]: Stem: 248#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 232#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 233#L555 assume !(main_~length1~0#1 < 1); 250#L555-2 assume !(main_~length2~0#1 < 1); 228#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 229#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 249#L564-4 main_~i~1#1 := 0; 240#L568-3 [2022-02-21 04:35:33,703 INFO L793 eck$LassoCheckResult]: Loop: 240#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; 242#L568-2 main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 240#L568-3 [2022-02-21 04:35:33,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:33,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2022-02-21 04:35:33,704 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:33,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793785187] [2022-02-21 04:35:33,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:33,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:33,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {319#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {319#true} is VALID [2022-02-21 04:35:33,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {319#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; {319#true} is VALID [2022-02-21 04:35:33,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {319#true} assume !(main_~length1~0#1 < 1); {321#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:35:33,748 INFO L290 TraceCheckUtils]: 3: Hoare triple {321#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} assume !(main_~length2~0#1 < 1); {321#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:35:33,749 INFO L290 TraceCheckUtils]: 4: Hoare triple {321#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; {322#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~length1~0#1|))} is VALID [2022-02-21 04:35:33,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {322#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~length1~0#1|))} assume !(main_~i~0#1 < main_~length1~0#1); {320#false} is VALID [2022-02-21 04:35:33,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {320#false} main_~i~1#1 := 0; {320#false} is VALID [2022-02-21 04:35:33,750 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 04:35:33,750 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:33,751 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793785187] [2022-02-21 04:35:33,751 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793785187] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:33,751 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:33,751 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:35:33,752 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751275888] [2022-02-21 04:35:33,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:33,753 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:35:33,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:33,754 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2022-02-21 04:35:33,754 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:33,754 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714398383] [2022-02-21 04:35:33,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:33,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:33,760 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:33,764 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:33,801 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:33,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:35:33,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:35:33,806 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. cyclomatic complexity: 15 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 04:35:33,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:33,889 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-02-21 04:35:33,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 04:35:33,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 04:35:33,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:33,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2022-02-21 04:35:33,896 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2022-02-21 04:35:33,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 43 transitions. [2022-02-21 04:35:33,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-02-21 04:35:33,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-02-21 04:35:33,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2022-02-21 04:35:33,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:33,897 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-02-21 04:35:33,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2022-02-21 04:35:33,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-02-21 04:35:33,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:33,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states and 43 transitions. Second operand has 32 states, 32 states have (on average 1.3125) internal successors, (42), 31 states have internal predecessors, (42), 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 04:35:33,899 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states and 43 transitions. Second operand has 32 states, 32 states have (on average 1.3125) internal successors, (42), 31 states have internal predecessors, (42), 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 04:35:33,899 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 32 states, 32 states have (on average 1.3125) internal successors, (42), 31 states have internal predecessors, (42), 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 04:35:33,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:33,899 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-02-21 04:35:33,900 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-02-21 04:35:33,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:33,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:33,900 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 32 states have (on average 1.3125) internal successors, (42), 31 states have internal predecessors, (42), 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 33 states and 43 transitions. [2022-02-21 04:35:33,900 INFO L87 Difference]: Start difference. First operand has 32 states, 32 states have (on average 1.3125) internal successors, (42), 31 states have internal predecessors, (42), 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 33 states and 43 transitions. [2022-02-21 04:35:33,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:33,901 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-02-21 04:35:33,901 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-02-21 04:35:33,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:33,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:33,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:33,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:33,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.3125) internal successors, (42), 31 states have internal predecessors, (42), 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 04:35:33,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-02-21 04:35:33,902 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-02-21 04:35:33,902 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-02-21 04:35:33,902 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:35:33,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2022-02-21 04:35:33,902 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2022-02-21 04:35:33,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:33,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:33,902 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:33,902 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:33,902 INFO L791 eck$LassoCheckResult]: Stem: 386#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 370#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 371#L555 assume !(main_~length1~0#1 < 1); 388#L555-2 assume !(main_~length2~0#1 < 1); 364#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 365#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);call write~int(main_#t~nondet25#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet25#1; 383#L564-2 main_#t~post24#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post24#1;havoc main_#t~post24#1; 384#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 387#L564-4 main_~i~1#1 := 0; 378#L568-3 [2022-02-21 04:35:33,903 INFO L793 eck$LassoCheckResult]: Loop: 378#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; 380#L568-2 main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 378#L568-3 [2022-02-21 04:35:33,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:33,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1298440016, now seen corresponding path program 1 times [2022-02-21 04:35:33,903 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:33,903 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140331199] [2022-02-21 04:35:33,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:33,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:33,925 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:33,933 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:33,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:33,934 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 2 times [2022-02-21 04:35:33,934 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:33,934 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959364118] [2022-02-21 04:35:33,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:33,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:33,939 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:33,942 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:33,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:33,942 INFO L85 PathProgramCache]: Analyzing trace with hash -2034626574, now seen corresponding path program 1 times [2022-02-21 04:35:33,942 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:33,942 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112167088] [2022-02-21 04:35:33,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:33,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:33,958 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:33,971 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:34,261 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:34,261 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:34,261 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:34,262 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:34,262 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:34,262 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:34,262 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:34,262 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:34,262 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration3_Lasso [2022-02-21 04:35:34,262 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:34,262 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:34,264 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 04:35:34,266 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 04:35:34,268 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 04:35:34,270 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 04:35:34,272 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 04:35:34,273 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 04:35:34,275 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 04:35:34,478 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:35:34,479 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:35:34,486 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 04:35:34,489 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 04:35:34,490 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 04:35:34,492 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 04:35:34,494 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 04:35:34,495 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 04:35:34,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:34,852 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:34,852 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:34,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:34,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:34,853 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 04:35:34,854 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 04:35:34,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:35:34,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:34,901 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:34,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:34,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:34,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:34,902 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:34,902 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:34,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:34,922 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 04:35:34,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:34,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:34,923 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 04:35:34,928 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 04:35:34,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:35:34,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:34,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:34,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:34,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:34,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:34,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:34,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:34,955 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:34,973 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 04:35:34,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:34,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:34,974 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 04:35:34,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:35:34,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:34,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:34,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:34,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:34,987 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:34,987 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:34,990 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 04:35:34,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:35,051 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 04:35:35,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:35,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:35,052 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 04:35:35,053 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 04:35:35,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:35,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:35,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:35,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:35,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:35,062 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:35,062 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:35,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:35,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:35,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:35,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:35,096 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 04:35:35,097 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 04:35:35,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 04:35:35,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:35,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:35,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:35,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:35,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:35,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:35,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:35,110 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:35,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-02-21 04:35:35,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:35,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:35,126 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 04:35:35,127 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 04:35:35,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:35:35,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:35,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:35,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:35,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:35,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:35,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:35,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:35,142 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:35,158 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 04:35:35,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:35,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:35,159 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 04:35:35,160 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 04:35:35,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:35:35,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:35,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:35,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:35,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:35,170 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:35,170 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:35,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:35,207 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 04:35:35,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:35,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:35,208 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 04:35:35,209 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 04:35:35,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:35,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:35,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:35,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:35,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:35,219 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:35,219 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:35,235 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:35,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-02-21 04:35:35,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:35,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:35,251 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 04:35:35,253 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 04:35:35,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:35:35,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:35,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:35,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:35,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:35,261 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:35,261 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:35,264 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:35,279 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 04:35:35,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:35,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:35,280 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 04:35:35,283 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 04:35:35,283 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:35:35,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:35,289 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:35,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:35,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:35,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:35,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:35,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:35,290 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:35,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-02-21 04:35:35,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:35,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:35,306 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 04:35:35,307 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 04:35:35,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 04:35:35,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:35,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:35,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:35,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:35,320 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:35,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:35,345 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:35,370 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-02-21 04:35:35,371 INFO L444 ModelExtractionUtils]: 9 out of 37 variables were initially zero. Simplification set additionally 25 variables to zero. [2022-02-21 04:35:35,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:35,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:35,372 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 04:35:35,376 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:35,383 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 04:35:35,389 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:35,389 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:35,389 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~length2~0#1) = -1*ULTIMATE.start_main_~i~1#1 + 1*ULTIMATE.start_main_~length2~0#1 Supporting invariants [] [2022-02-21 04:35:35,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-02-21 04:35:35,437 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2022-02-21 04:35:35,440 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1;" "main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1;" [2022-02-21 04:35:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:35,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:35,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:35:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:35,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:35,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {465#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {465#unseeded} is VALID [2022-02-21 04:35:35,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {465#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; {465#unseeded} is VALID [2022-02-21 04:35:35,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {465#unseeded} assume !(main_~length1~0#1 < 1); {465#unseeded} is VALID [2022-02-21 04:35:35,490 INFO L290 TraceCheckUtils]: 3: Hoare triple {465#unseeded} assume !(main_~length2~0#1 < 1); {465#unseeded} is VALID [2022-02-21 04:35:35,491 INFO L290 TraceCheckUtils]: 4: Hoare triple {465#unseeded} call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; {465#unseeded} is VALID [2022-02-21 04:35:35,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {465#unseeded} assume !!(main_~i~0#1 < main_~length1~0#1);call write~int(main_#t~nondet25#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet25#1; {465#unseeded} is VALID [2022-02-21 04:35:35,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {465#unseeded} main_#t~post24#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post24#1;havoc main_#t~post24#1; {465#unseeded} is VALID [2022-02-21 04:35:35,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {465#unseeded} assume !(main_~i~0#1 < main_~length1~0#1); {465#unseeded} is VALID [2022-02-21 04:35:35,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {465#unseeded} main_~i~1#1 := 0; {465#unseeded} is VALID [2022-02-21 04:35:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:35,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:35:35,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:35,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:35,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {468#(>= oldRank0 (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|)))} assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; {552#(and (< |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~length2~0#1|) (>= oldRank0 (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|))))} is VALID [2022-02-21 04:35:35,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {552#(and (< |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~length2~0#1|) (>= oldRank0 (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|))))} main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; {523#(or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|)))) unseeded)} is VALID [2022-02-21 04:35:35,520 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 04:35:35,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:35,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:35,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:35,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,526 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 04:35:35,526 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 42 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:35,603 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 42 transitions. cyclomatic complexity: 14. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 55 states and 75 transitions. Complement of second has 6 states. [2022-02-21 04:35:35,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:35,604 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:35,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. cyclomatic complexity: 14 [2022-02-21 04:35:35,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:35,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:35,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:35,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:35,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:35,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:35,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 75 transitions. [2022-02-21 04:35:35,606 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-02-21 04:35:35,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:35,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:35,606 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 42 transitions. cyclomatic complexity: 14 [2022-02-21 04:35:35,608 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 19 examples of accepted words. [2022-02-21 04:35:35,608 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:35,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:35,608 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:35,609 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 55 states and 75 transitions. cyclomatic complexity: 26 [2022-02-21 04:35:35,610 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 17 examples of accepted words. [2022-02-21 04:35:35,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:35,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:35,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:35,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:35,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:35,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:35,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:35,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:35,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:35,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 55 letters. Loop has 55 letters. [2022-02-21 04:35:35,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 55 letters. [2022-02-21 04:35:35,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 55 letters. Loop has 55 letters. [2022-02-21 04:35:35,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 32 letters. Loop has 32 letters. [2022-02-21 04:35:35,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 32 letters. [2022-02-21 04:35:35,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 32 letters. [2022-02-21 04:35:35,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:35,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:35,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:35,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 21 letters. Loop has 8 letters. [2022-02-21 04:35:35,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 8 letters. [2022-02-21 04:35:35,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 21 letters. Loop has 8 letters. [2022-02-21 04:35:35,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 8 letters. [2022-02-21 04:35:35,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 8 letters. [2022-02-21 04:35:35,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 22 letters. Loop has 8 letters. [2022-02-21 04:35:35,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 5 letters. [2022-02-21 04:35:35,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 5 letters. [2022-02-21 04:35:35,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 22 letters. Loop has 5 letters. [2022-02-21 04:35:35,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 25 letters. Loop has 5 letters. [2022-02-21 04:35:35,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 5 letters. [2022-02-21 04:35:35,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 25 letters. Loop has 5 letters. [2022-02-21 04:35:35,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 26 letters. Loop has 5 letters. [2022-02-21 04:35:35,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 5 letters. [2022-02-21 04:35:35,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 26 letters. Loop has 5 letters. [2022-02-21 04:35:35,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 25 letters. Loop has 12 letters. [2022-02-21 04:35:35,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 12 letters. [2022-02-21 04:35:35,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 25 letters. Loop has 12 letters. [2022-02-21 04:35:35,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 3 letters. [2022-02-21 04:35:35,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 3 letters. [2022-02-21 04:35:35,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 18 letters. Loop has 3 letters. [2022-02-21 04:35:35,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 3 letters. [2022-02-21 04:35:35,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 04:35:35,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 19 letters. Loop has 3 letters. [2022-02-21 04:35:35,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 16 letters. Loop has 8 letters. [2022-02-21 04:35:35,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 8 letters. [2022-02-21 04:35:35,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 16 letters. Loop has 8 letters. [2022-02-21 04:35:35,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 24 letters. Loop has 5 letters. [2022-02-21 04:35:35,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 5 letters. [2022-02-21 04:35:35,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 24 letters. Loop has 5 letters. [2022-02-21 04:35:35,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 8 letters. [2022-02-21 04:35:35,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 8 letters. [2022-02-21 04:35:35,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 23 letters. Loop has 8 letters. [2022-02-21 04:35:35,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 5 letters. [2022-02-21 04:35:35,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 5 letters. [2022-02-21 04:35:35,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 23 letters. Loop has 5 letters. [2022-02-21 04:35:35,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:35,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:35,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:35,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 8 letters. [2022-02-21 04:35:35,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 8 letters. [2022-02-21 04:35:35,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 20 letters. Loop has 8 letters. [2022-02-21 04:35:35,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:35,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:35,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:35,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:35,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:35,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:35,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:35,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:35,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:35,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:35,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:35,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:35,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:35,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:35,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:35,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:35,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:35,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:35,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 8 letters. [2022-02-21 04:35:35,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 8 letters. [2022-02-21 04:35:35,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 23 letters. Loop has 8 letters. [2022-02-21 04:35:35,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 5 letters. [2022-02-21 04:35:35,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 5 letters. [2022-02-21 04:35:35,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 23 letters. Loop has 5 letters. [2022-02-21 04:35:35,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 24 letters. Loop has 5 letters. [2022-02-21 04:35:35,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 5 letters. [2022-02-21 04:35:35,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 24 letters. Loop has 5 letters. [2022-02-21 04:35:35,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 25 letters. Loop has 12 letters. [2022-02-21 04:35:35,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 12 letters. [2022-02-21 04:35:35,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 25 letters. Loop has 12 letters. [2022-02-21 04:35:35,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 25 letters. Loop has 5 letters. [2022-02-21 04:35:35,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 5 letters. [2022-02-21 04:35:35,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 25 letters. Loop has 5 letters. [2022-02-21 04:35:35,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 26 letters. Loop has 5 letters. [2022-02-21 04:35:35,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 5 letters. [2022-02-21 04:35:35,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 26 letters. Loop has 5 letters. [2022-02-21 04:35:35,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 16 letters. Loop has 8 letters. [2022-02-21 04:35:35,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 8 letters. [2022-02-21 04:35:35,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 16 letters. Loop has 8 letters. [2022-02-21 04:35:35,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:35,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:35,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:35,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 3 letters. [2022-02-21 04:35:35,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 3 letters. [2022-02-21 04:35:35,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 18 letters. Loop has 3 letters. [2022-02-21 04:35:35,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 3 letters. [2022-02-21 04:35:35,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 04:35:35,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 19 letters. Loop has 3 letters. [2022-02-21 04:35:35,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 8 letters. [2022-02-21 04:35:35,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 8 letters. [2022-02-21 04:35:35,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 20 letters. Loop has 8 letters. [2022-02-21 04:35:35,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 21 letters. Loop has 8 letters. [2022-02-21 04:35:35,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 8 letters. [2022-02-21 04:35:35,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 21 letters. Loop has 8 letters. [2022-02-21 04:35:35,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 8 letters. [2022-02-21 04:35:35,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 8 letters. [2022-02-21 04:35:35,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 22 letters. Loop has 8 letters. [2022-02-21 04:35:35,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 5 letters. [2022-02-21 04:35:35,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 5 letters. [2022-02-21 04:35:35,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 22 letters. Loop has 5 letters. [2022-02-21 04:35:35,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:35,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:35,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:35,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:35,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:35,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:35,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:35,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:35,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:35,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,647 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:35,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:35,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-02-21 04:35:35,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:35,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:35:35,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:35:35,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:35,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 75 transitions. cyclomatic complexity: 26 [2022-02-21 04:35:35,652 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-02-21 04:35:35,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 33 states and 44 transitions. [2022-02-21 04:35:35,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-02-21 04:35:35,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-02-21 04:35:35,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2022-02-21 04:35:35,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:35,653 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-02-21 04:35:35,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2022-02-21 04:35:35,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-21 04:35:35,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:35,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states and 44 transitions. Second operand has 33 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 32 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:35,655 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states and 44 transitions. Second operand has 33 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 32 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:35,656 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 33 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 32 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:35,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:35,657 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-02-21 04:35:35,657 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-02-21 04:35:35,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:35,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:35,658 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 32 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 33 states and 44 transitions. [2022-02-21 04:35:35,658 INFO L87 Difference]: Start difference. First operand has 33 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 32 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 33 states and 44 transitions. [2022-02-21 04:35:35,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:35,660 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-02-21 04:35:35,660 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-02-21 04:35:35,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:35,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:35,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:35,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:35,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 32 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:35,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-02-21 04:35:35,661 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-02-21 04:35:35,661 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-02-21 04:35:35,661 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:35:35,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 44 transitions. [2022-02-21 04:35:35,661 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-02-21 04:35:35,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:35,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:35,662 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:35,662 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:35:35,662 INFO L791 eck$LassoCheckResult]: Stem: 649#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 632#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 633#L555 assume !(main_~length1~0#1 < 1); 651#L555-2 assume !(main_~length2~0#1 < 1); 628#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 629#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);call write~int(main_#t~nondet25#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet25#1; 646#L564-2 main_#t~post24#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post24#1;havoc main_#t~post24#1; 647#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 650#L564-4 main_~i~1#1 := 0; 640#L568-3 assume !(main_~i~1#1 < main_~length2~0#1); 641#L568-4 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 + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, cstrstr_#t~mem18#1, cstrstr_#t~ret16#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 648#L540 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset, cstrlen_#t~mem3#1, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 638#L518-4 [2022-02-21 04:35:35,662 INFO L793 eck$LassoCheckResult]: Loop: 638#L518-4 call cstrlen_#t~mem3#1 := read~int(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 639#L518-1 assume !!(0 != cstrlen_#t~mem3#1);havoc cstrlen_#t~mem3#1; 652#L518-3 cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset; 638#L518-4 [2022-02-21 04:35:35,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:35,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1351083894, now seen corresponding path program 1 times [2022-02-21 04:35:35,663 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:35,663 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356009544] [2022-02-21 04:35:35,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:35,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:35,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {722#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {722#true} is VALID [2022-02-21 04:35:35,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {722#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; {722#true} is VALID [2022-02-21 04:35:35,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {722#true} assume !(main_~length1~0#1 < 1); {722#true} is VALID [2022-02-21 04:35:35,747 INFO L290 TraceCheckUtils]: 3: Hoare triple {722#true} assume !(main_~length2~0#1 < 1); {724#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} is VALID [2022-02-21 04:35:35,748 INFO L290 TraceCheckUtils]: 4: Hoare triple {724#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; {725#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:35,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {725#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} assume !!(main_~i~0#1 < main_~length1~0#1);call write~int(main_#t~nondet25#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet25#1; {725#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:35,749 INFO L290 TraceCheckUtils]: 6: Hoare triple {725#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} main_#t~post24#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post24#1;havoc main_#t~post24#1; {725#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:35,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {725#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} assume !(main_~i~0#1 < main_~length1~0#1); {725#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:35,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {725#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} main_~i~1#1 := 0; {726#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~i~1#1| (* (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset|)) 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:35,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {726#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~i~1#1| (* (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset|)) 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} assume !(main_~i~1#1 < main_~length2~0#1); {723#false} is VALID [2022-02-21 04:35:35,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {723#false} 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 + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, cstrstr_#t~mem18#1, cstrstr_#t~ret16#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; {723#false} is VALID [2022-02-21 04:35:35,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {723#false} assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset, cstrlen_#t~mem3#1, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; {723#false} is VALID [2022-02-21 04:35:35,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:35:35,751 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:35,751 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356009544] [2022-02-21 04:35:35,751 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356009544] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:35,751 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:35,751 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:35:35,751 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105503948] [2022-02-21 04:35:35,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:35,752 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:35:35,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:35,752 INFO L85 PathProgramCache]: Analyzing trace with hash 79603, now seen corresponding path program 1 times [2022-02-21 04:35:35,752 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:35,752 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301600735] [2022-02-21 04:35:35,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:35,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:35,757 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:35,775 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:35,804 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:35,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:35:35,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:35:35,805 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:35,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:35,884 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-02-21 04:35:35,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:35:35,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:35,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:35,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 44 transitions. [2022-02-21 04:35:35,895 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-02-21 04:35:35,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 44 transitions. [2022-02-21 04:35:35,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-02-21 04:35:35,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-02-21 04:35:35,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2022-02-21 04:35:35,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:35,896 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-02-21 04:35:35,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2022-02-21 04:35:35,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-02-21 04:35:35,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:35,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states and 44 transitions. Second operand has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 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 04:35:35,898 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states and 44 transitions. Second operand has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 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 04:35:35,898 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 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 04:35:35,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:35,899 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-02-21 04:35:35,899 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-02-21 04:35:35,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:35,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:35,899 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 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 34 states and 44 transitions. [2022-02-21 04:35:35,899 INFO L87 Difference]: Start difference. First operand has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 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 34 states and 44 transitions. [2022-02-21 04:35:35,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:35,900 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-02-21 04:35:35,900 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-02-21 04:35:35,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:35,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:35,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:35,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:35,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 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 04:35:35,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-02-21 04:35:35,902 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-02-21 04:35:35,902 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-02-21 04:35:35,902 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:35:35,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2022-02-21 04:35:35,902 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-02-21 04:35:35,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:35,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:35,903 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:35,903 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:35:35,903 INFO L791 eck$LassoCheckResult]: Stem: 792#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 775#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 776#L555 assume !(main_~length1~0#1 < 1); 794#L555-2 assume !(main_~length2~0#1 < 1); 769#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 770#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);call write~int(main_#t~nondet25#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet25#1; 789#L564-2 main_#t~post24#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post24#1;havoc main_#t~post24#1; 790#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 793#L564-4 main_~i~1#1 := 0; 783#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; 784#L568-2 main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 785#L568-3 assume !(main_~i~1#1 < main_~length2~0#1); 786#L568-4 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 + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, cstrstr_#t~mem18#1, cstrstr_#t~ret16#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 791#L540 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset, cstrlen_#t~mem3#1, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 781#L518-4 [2022-02-21 04:35:35,903 INFO L793 eck$LassoCheckResult]: Loop: 781#L518-4 call cstrlen_#t~mem3#1 := read~int(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 782#L518-1 assume !!(0 != cstrlen_#t~mem3#1);havoc cstrlen_#t~mem3#1; 795#L518-3 cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset; 781#L518-4 [2022-02-21 04:35:35,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:35,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1313217428, now seen corresponding path program 1 times [2022-02-21 04:35:35,904 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:35,904 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149311880] [2022-02-21 04:35:35,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:35,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:36,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {867#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {867#true} is VALID [2022-02-21 04:35:36,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {867#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; {867#true} is VALID [2022-02-21 04:35:36,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {867#true} assume !(main_~length1~0#1 < 1); {867#true} is VALID [2022-02-21 04:35:36,058 INFO L290 TraceCheckUtils]: 3: Hoare triple {867#true} assume !(main_~length2~0#1 < 1); {869#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} is VALID [2022-02-21 04:35:36,059 INFO L290 TraceCheckUtils]: 4: Hoare triple {869#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; {870#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)))} is VALID [2022-02-21 04:35:36,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {870#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)))} assume !!(main_~i~0#1 < main_~length1~0#1);call write~int(main_#t~nondet25#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet25#1; {870#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)))} is VALID [2022-02-21 04:35:36,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {870#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)))} main_#t~post24#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post24#1;havoc main_#t~post24#1; {870#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)))} is VALID [2022-02-21 04:35:36,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {870#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)))} assume !(main_~i~0#1 < main_~length1~0#1); {870#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)))} is VALID [2022-02-21 04:35:36,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {870#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)))} main_~i~1#1 := 0; {871#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (or (and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)))} is VALID [2022-02-21 04:35:36,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {871#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (or (and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)))} assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; {871#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (or (and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)))} is VALID [2022-02-21 04:35:36,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {871#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (or (and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)))} main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; {872#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (or (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 1) (<= |ULTIMATE.start_main_~i~1#1| 1)))} is VALID [2022-02-21 04:35:36,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {872#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (or (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 1) (<= |ULTIMATE.start_main_~i~1#1| 1)))} assume !(main_~i~1#1 < main_~length2~0#1); {873#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~length2~0#1| 1) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:36,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {873#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~length2~0#1| 1) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} 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 + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, cstrstr_#t~mem18#1, cstrstr_#t~ret16#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; {874#(= |ULTIMATE.start_cstrstr_~c~0#1| 0)} is VALID [2022-02-21 04:35:36,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {874#(= |ULTIMATE.start_cstrstr_~c~0#1| 0)} assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset, cstrlen_#t~mem3#1, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; {868#false} is VALID [2022-02-21 04:35:36,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:35:36,064 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:36,064 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149311880] [2022-02-21 04:35:36,064 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149311880] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:35:36,064 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010171708] [2022-02-21 04:35:36,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:36,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:35:36,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:36,066 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:35:36,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-02-21 04:35:36,136 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 04:35:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:36,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-21 04:35:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:36,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:36,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-02-21 04:35:36,685 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 04:35:36,745 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 04:35:36,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {867#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {867#true} is VALID [2022-02-21 04:35:36,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {867#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; {867#true} is VALID [2022-02-21 04:35:36,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {867#true} assume !(main_~length1~0#1 < 1); {867#true} is VALID [2022-02-21 04:35:36,776 INFO L290 TraceCheckUtils]: 3: Hoare triple {867#true} assume !(main_~length2~0#1 < 1); {869#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} is VALID [2022-02-21 04:35:36,777 INFO L290 TraceCheckUtils]: 4: Hoare triple {869#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; {890#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:36,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {890#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} assume !!(main_~i~0#1 < main_~length1~0#1);call write~int(main_#t~nondet25#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet25#1; {890#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:36,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {890#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} main_#t~post24#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post24#1;havoc main_#t~post24#1; {890#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:36,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {890#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} assume !(main_~i~0#1 < main_~length1~0#1); {890#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:36,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {890#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} main_~i~1#1 := 0; {903#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:36,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {903#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; {903#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:36,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {903#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; {910#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:36,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {910#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} assume !(main_~i~1#1 < main_~length2~0#1); {914#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~length2~0#1| 1) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:36,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {914#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~length2~0#1| 1) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} 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 + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, cstrstr_#t~mem18#1, cstrstr_#t~ret16#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; {874#(= |ULTIMATE.start_cstrstr_~c~0#1| 0)} is VALID [2022-02-21 04:35:36,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {874#(= |ULTIMATE.start_cstrstr_~c~0#1| 0)} assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset, cstrlen_#t~mem3#1, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; {868#false} is VALID [2022-02-21 04:35:36,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:35:36,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:35:36,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-02-21 04:35:36,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-02-21 04:35:36,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2022-02-21 04:35:37,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {874#(= |ULTIMATE.start_cstrstr_~c~0#1| 0)} assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset, cstrlen_#t~mem3#1, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; {868#false} is VALID [2022-02-21 04:35:37,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {924#(and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 1)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|)))} 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 + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, cstrstr_#t~mem18#1, cstrstr_#t~ret16#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; {874#(= |ULTIMATE.start_cstrstr_~c~0#1| 0)} is VALID [2022-02-21 04:35:37,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {928#(or (and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 1)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))) (< |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~length2~0#1|))} assume !(main_~i~1#1 < main_~length2~0#1); {924#(and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 1)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|)))} is VALID [2022-02-21 04:35:37,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {932#(or (and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 1)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))) (< (+ |ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~length2~0#1|))} main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; {928#(or (and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 1)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))) (< |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:37,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {932#(or (and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 1)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))) (< (+ |ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~length2~0#1|))} assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; {932#(or (and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 1)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))) (< (+ |ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:37,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {939#(or (< 1 |ULTIMATE.start_main_~length2~0#1|) (and (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 1) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))))} main_~i~1#1 := 0; {932#(or (and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 1)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))) (< (+ |ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:37,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {939#(or (< 1 |ULTIMATE.start_main_~length2~0#1|) (and (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 1) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))))} assume !(main_~i~0#1 < main_~length1~0#1); {939#(or (< 1 |ULTIMATE.start_main_~length2~0#1|) (and (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 1) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))))} is VALID [2022-02-21 04:35:37,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {939#(or (< 1 |ULTIMATE.start_main_~length2~0#1|) (and (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 1) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))))} main_#t~post24#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post24#1;havoc main_#t~post24#1; {939#(or (< 1 |ULTIMATE.start_main_~length2~0#1|) (and (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 1) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))))} is VALID [2022-02-21 04:35:37,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {939#(or (< 1 |ULTIMATE.start_main_~length2~0#1|) (and (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 1) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))))} assume !!(main_~i~0#1 < main_~length1~0#1);call write~int(main_#t~nondet25#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet25#1; {939#(or (< 1 |ULTIMATE.start_main_~length2~0#1|) (and (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 1) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))))} is VALID [2022-02-21 04:35:37,342 INFO L290 TraceCheckUtils]: 4: Hoare triple {869#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; {939#(or (< 1 |ULTIMATE.start_main_~length2~0#1|) (and (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 1) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))))} is VALID [2022-02-21 04:35:37,342 INFO L290 TraceCheckUtils]: 3: Hoare triple {867#true} assume !(main_~length2~0#1 < 1); {869#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} is VALID [2022-02-21 04:35:37,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {867#true} assume !(main_~length1~0#1 < 1); {867#true} is VALID [2022-02-21 04:35:37,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {867#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; {867#true} is VALID [2022-02-21 04:35:37,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {867#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {867#true} is VALID [2022-02-21 04:35:37,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:35:37,343 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010171708] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:35:37,343 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:35:37,344 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-02-21 04:35:37,344 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551069506] [2022-02-21 04:35:37,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:35:37,344 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:35:37,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:37,344 INFO L85 PathProgramCache]: Analyzing trace with hash 79603, now seen corresponding path program 2 times [2022-02-21 04:35:37,345 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:37,345 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542911255] [2022-02-21 04:35:37,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:37,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:37,349 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:37,351 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:37,379 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:37,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-21 04:35:37,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2022-02-21 04:35:37,380 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:37,711 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-02-21 04:35:37,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 04:35:37,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:37,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2022-02-21 04:35:37,745 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-02-21 04:35:37,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 36 states and 46 transitions. [2022-02-21 04:35:37,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-02-21 04:35:37,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-02-21 04:35:37,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2022-02-21 04:35:37,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:37,746 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2022-02-21 04:35:37,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2022-02-21 04:35:37,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-02-21 04:35:37,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:37,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states and 46 transitions. Second operand has 35 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 34 states have internal predecessors, (45), 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 04:35:37,747 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states and 46 transitions. Second operand has 35 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 34 states have internal predecessors, (45), 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 04:35:37,748 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 35 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 34 states have internal predecessors, (45), 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 04:35:37,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:37,748 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-02-21 04:35:37,748 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-02-21 04:35:37,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:37,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:37,749 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 34 states have internal predecessors, (45), 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 36 states and 46 transitions. [2022-02-21 04:35:37,749 INFO L87 Difference]: Start difference. First operand has 35 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 34 states have internal predecessors, (45), 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 36 states and 46 transitions. [2022-02-21 04:35:37,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:37,749 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-02-21 04:35:37,749 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-02-21 04:35:37,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:37,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:37,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:37,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:37,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 34 states have internal predecessors, (45), 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 04:35:37,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-02-21 04:35:37,750 INFO L704 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-02-21 04:35:37,750 INFO L587 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-02-21 04:35:37,750 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 04:35:37,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2022-02-21 04:35:37,750 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-02-21 04:35:37,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:37,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:37,751 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:37,751 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:35:37,751 INFO L791 eck$LassoCheckResult]: Stem: 1041#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1023#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 1024#L555 assume !(main_~length1~0#1 < 1); 1043#L555-2 assume !(main_~length2~0#1 < 1); 1017#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 1018#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);call write~int(main_#t~nondet25#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet25#1; 1037#L564-2 main_#t~post24#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post24#1;havoc main_#t~post24#1; 1038#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 1042#L564-4 main_~i~1#1 := 0; 1031#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; 1032#L568-2 main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 1033#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; 1034#L568-2 main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 1045#L568-3 assume !(main_~i~1#1 < main_~length2~0#1); 1039#L568-4 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 + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, cstrstr_#t~mem18#1, cstrstr_#t~ret16#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 1040#L540 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset, cstrlen_#t~mem3#1, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 1029#L518-4 [2022-02-21 04:35:37,751 INFO L793 eck$LassoCheckResult]: Loop: 1029#L518-4 call cstrlen_#t~mem3#1 := read~int(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 1030#L518-1 assume !!(0 != cstrlen_#t~mem3#1);havoc cstrlen_#t~mem3#1; 1044#L518-3 cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset; 1029#L518-4 [2022-02-21 04:35:37,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:37,752 INFO L85 PathProgramCache]: Analyzing trace with hash -716718030, now seen corresponding path program 2 times [2022-02-21 04:35:37,752 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:37,752 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577981279] [2022-02-21 04:35:37,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:37,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:37,776 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:37,789 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:37,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:37,790 INFO L85 PathProgramCache]: Analyzing trace with hash 79603, now seen corresponding path program 3 times [2022-02-21 04:35:37,790 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:37,790 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450177136] [2022-02-21 04:35:37,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:37,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:37,793 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:37,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:37,795 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:37,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:37,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1464353502, now seen corresponding path program 1 times [2022-02-21 04:35:37,796 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:37,796 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722351234] [2022-02-21 04:35:37,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:37,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:38,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {1125#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1125#true} is VALID [2022-02-21 04:35:38,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {1125#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; {1125#true} is VALID [2022-02-21 04:35:38,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {1125#true} assume !(main_~length1~0#1 < 1); {1125#true} is VALID [2022-02-21 04:35:38,010 INFO L290 TraceCheckUtils]: 3: Hoare triple {1125#true} assume !(main_~length2~0#1 < 1); {1125#true} is VALID [2022-02-21 04:35:38,010 INFO L290 TraceCheckUtils]: 4: Hoare triple {1125#true} call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; {1127#(= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} is VALID [2022-02-21 04:35:38,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {1127#(= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} assume !!(main_~i~0#1 < main_~length1~0#1);call write~int(main_#t~nondet25#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet25#1; {1127#(= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} is VALID [2022-02-21 04:35:38,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {1127#(= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} main_#t~post24#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post24#1;havoc main_#t~post24#1; {1127#(= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} is VALID [2022-02-21 04:35:38,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {1127#(= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} assume !(main_~i~0#1 < main_~length1~0#1); {1127#(= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} is VALID [2022-02-21 04:35:38,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {1127#(= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} main_~i~1#1 := 0; {1128#(and (or (= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 2) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~i~1#1|)) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0))} is VALID [2022-02-21 04:35:38,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {1128#(and (or (= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 2) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~i~1#1|)) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0))} assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; {1128#(and (or (= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 2) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~i~1#1|)) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0))} is VALID [2022-02-21 04:35:38,013 INFO L290 TraceCheckUtils]: 10: Hoare triple {1128#(and (or (= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 2) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~i~1#1|)) (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0))} main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; {1129#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (or (not (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 1)) (<= 1 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~i~1#1|))) (or (<= |ULTIMATE.start_main_~i~1#1| (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| 1)) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 2)))} is VALID [2022-02-21 04:35:38,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {1129#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (or (not (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 1)) (<= 1 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~i~1#1|))) (or (<= |ULTIMATE.start_main_~i~1#1| (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| 1)) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 2)))} assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; {1130#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (or (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 1) (and (<= |ULTIMATE.start_main_~i~1#1| (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| 1)) (< 1 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)))))} is VALID [2022-02-21 04:35:38,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {1130#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (or (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 1) (and (<= |ULTIMATE.start_main_~i~1#1| (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| 1)) (< 1 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)))))} main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; {1131#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 1 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)) (or (<= |ULTIMATE.start_main_~i~1#1| (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| 2)) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 2)))} is VALID [2022-02-21 04:35:38,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {1131#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 1 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)) (or (<= |ULTIMATE.start_main_~i~1#1| (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| 2)) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 2)))} assume !(main_~i~1#1 < main_~length2~0#1); {1132#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 1 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 2))} is VALID [2022-02-21 04:35:38,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {1132#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 1 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 2))} 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 + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, cstrstr_#t~mem18#1, cstrstr_#t~ret16#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; {1133#(and (<= |ULTIMATE.start_cstrstr_~find#1.offset| 1) (< 0 |ULTIMATE.start_cstrstr_~find#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_cstrstr_~find#1.base|) 1) 0))} is VALID [2022-02-21 04:35:38,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {1133#(and (<= |ULTIMATE.start_cstrstr_~find#1.offset| 1) (< 0 |ULTIMATE.start_cstrstr_~find#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_cstrstr_~find#1.base|) 1) 0))} assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset, cstrlen_#t~mem3#1, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; {1134#(= (select (select |#memory_int| |ULTIMATE.start_cstrlen_~s~0#1.base|) |ULTIMATE.start_cstrlen_~s~0#1.offset|) 0)} is VALID [2022-02-21 04:35:38,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {1134#(= (select (select |#memory_int| |ULTIMATE.start_cstrlen_~s~0#1.base|) |ULTIMATE.start_cstrlen_~s~0#1.offset|) 0)} call cstrlen_#t~mem3#1 := read~int(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); {1135#(= |ULTIMATE.start_cstrlen_#t~mem3#1| 0)} is VALID [2022-02-21 04:35:38,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {1135#(= |ULTIMATE.start_cstrlen_#t~mem3#1| 0)} assume !!(0 != cstrlen_#t~mem3#1);havoc cstrlen_#t~mem3#1; {1126#false} is VALID [2022-02-21 04:35:38,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {1126#false} cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset; {1126#false} is VALID [2022-02-21 04:35:38,019 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:35:38,019 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:38,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722351234] [2022-02-21 04:35:38,019 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722351234] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:35:38,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510952896] [2022-02-21 04:35:38,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:38,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:35:38,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:38,021 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:35:38,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-02-21 04:35:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:38,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 41 conjunts are in the unsatisfiable core [2022-02-21 04:35:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:38,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:38,400 INFO L356 Elim1Store]: treesize reduction 32, result has 37.3 percent of original size [2022-02-21 04:35:38,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 80 [2022-02-21 04:35:38,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2022-02-21 04:35:38,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2022-02-21 04:35:38,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2022-02-21 04:35:38,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 3 [2022-02-21 04:35:39,014 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 04:35:39,016 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 04:35:39,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-02-21 04:35:39,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {1125#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1125#true} is VALID [2022-02-21 04:35:39,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {1125#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; {1125#true} is VALID [2022-02-21 04:35:39,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {1125#true} assume !(main_~length1~0#1 < 1); {1125#true} is VALID [2022-02-21 04:35:39,031 INFO L290 TraceCheckUtils]: 3: Hoare triple {1125#true} assume !(main_~length2~0#1 < 1); {1125#true} is VALID [2022-02-21 04:35:39,031 INFO L290 TraceCheckUtils]: 4: Hoare triple {1125#true} call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; {1151#(<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} is VALID [2022-02-21 04:35:39,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {1151#(<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} assume !!(main_~i~0#1 < main_~length1~0#1);call write~int(main_#t~nondet25#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet25#1; {1151#(<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} is VALID [2022-02-21 04:35:39,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {1151#(<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} main_#t~post24#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post24#1;havoc main_#t~post24#1; {1151#(<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} is VALID [2022-02-21 04:35:39,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {1151#(<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} assume !(main_~i~0#1 < main_~length1~0#1); {1151#(<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} is VALID [2022-02-21 04:35:39,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {1151#(<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} main_~i~1#1 := 0; {1164#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} is VALID [2022-02-21 04:35:39,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {1164#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; {1164#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} is VALID [2022-02-21 04:35:39,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {1164#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; {1171#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1))} is VALID [2022-02-21 04:35:39,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {1171#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1))} assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; {1175#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_main_~i~1#1| 1))} is VALID [2022-02-21 04:35:39,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {1175#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_main_~i~1#1| 1))} main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; {1179#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~1#1| 2) (< 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:39,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {1179#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~1#1| 2) (< 1 |ULTIMATE.start_main_~length2~0#1|))} assume !(main_~i~1#1 < main_~length2~0#1); {1183#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 1 |ULTIMATE.start_main_~length2~0#1|) (<= |ULTIMATE.start_main_~length2~0#1| 2))} is VALID [2022-02-21 04:35:39,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {1183#(and (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 1 |ULTIMATE.start_main_~length2~0#1|) (<= |ULTIMATE.start_main_~length2~0#1| 2))} 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 + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, cstrstr_#t~mem18#1, cstrstr_#t~ret16#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; {1133#(and (<= |ULTIMATE.start_cstrstr_~find#1.offset| 1) (< 0 |ULTIMATE.start_cstrstr_~find#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_cstrstr_~find#1.base|) 1) 0))} is VALID [2022-02-21 04:35:39,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {1133#(and (<= |ULTIMATE.start_cstrstr_~find#1.offset| 1) (< 0 |ULTIMATE.start_cstrstr_~find#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_cstrstr_~find#1.base|) 1) 0))} assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset, cstrlen_#t~mem3#1, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; {1190#(and (<= |ULTIMATE.start_cstrlen_~s~0#1.offset| 1) (< 0 |ULTIMATE.start_cstrlen_~s~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_cstrlen_~s~0#1.base|) 1) 0))} is VALID [2022-02-21 04:35:39,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {1190#(and (<= |ULTIMATE.start_cstrlen_~s~0#1.offset| 1) (< 0 |ULTIMATE.start_cstrlen_~s~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_cstrlen_~s~0#1.base|) 1) 0))} call cstrlen_#t~mem3#1 := read~int(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); {1135#(= |ULTIMATE.start_cstrlen_#t~mem3#1| 0)} is VALID [2022-02-21 04:35:39,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {1135#(= |ULTIMATE.start_cstrlen_#t~mem3#1| 0)} assume !!(0 != cstrlen_#t~mem3#1);havoc cstrlen_#t~mem3#1; {1126#false} is VALID [2022-02-21 04:35:39,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {1126#false} cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset; {1126#false} is VALID [2022-02-21 04:35:39,050 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:35:39,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:35:39,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-02-21 04:35:39,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-02-21 04:35:39,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2022-02-21 04:35:39,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {1126#false} cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset; {1126#false} is VALID [2022-02-21 04:35:39,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {1135#(= |ULTIMATE.start_cstrlen_#t~mem3#1| 0)} assume !!(0 != cstrlen_#t~mem3#1);havoc cstrlen_#t~mem3#1; {1126#false} is VALID [2022-02-21 04:35:39,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {1134#(= (select (select |#memory_int| |ULTIMATE.start_cstrlen_~s~0#1.base|) |ULTIMATE.start_cstrlen_~s~0#1.offset|) 0)} call cstrlen_#t~mem3#1 := read~int(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); {1135#(= |ULTIMATE.start_cstrlen_#t~mem3#1| 0)} is VALID [2022-02-21 04:35:39,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {1209#(= (select (select |#memory_int| |ULTIMATE.start_cstrstr_~find#1.base|) |ULTIMATE.start_cstrstr_~find#1.offset|) 0)} assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset, cstrlen_#t~mem3#1, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; {1134#(= (select (select |#memory_int| |ULTIMATE.start_cstrlen_~s~0#1.base|) |ULTIMATE.start_cstrlen_~s~0#1.offset|) 0)} is VALID [2022-02-21 04:35:39,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {1213#(and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~length2~0#1|)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 2)))} 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 + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, cstrstr_#t~mem18#1, cstrstr_#t~ret16#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; {1209#(= (select (select |#memory_int| |ULTIMATE.start_cstrstr_~find#1.base|) |ULTIMATE.start_cstrstr_~find#1.offset|) 0)} is VALID [2022-02-21 04:35:39,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {1217#(or (and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~length2~0#1|)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 2))) (< |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~length2~0#1|))} assume !(main_~i~1#1 < main_~length2~0#1); {1213#(and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~length2~0#1|)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 2)))} is VALID [2022-02-21 04:35:39,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {1221#(or (and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~length2~0#1|)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 2))) (< (+ |ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~length2~0#1|))} main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; {1217#(or (and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~length2~0#1|)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 2))) (< |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:39,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {1225#(and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~i~1#1|) 1)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~i~1#1|)))} assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; {1221#(or (and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~length2~0#1|)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 2))) (< (+ |ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:39,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {1229#(and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~i~1#1|) 0)))} main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; {1225#(and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~i~1#1|) 1)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~i~1#1|)))} is VALID [2022-02-21 04:35:39,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {1229#(and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~i~1#1|) 0)))} assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; {1229#(and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~i~1#1|) 0)))} is VALID [2022-02-21 04:35:39,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {1151#(<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} main_~i~1#1 := 0; {1229#(and (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|)) (or (< |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~i~1#1|) 0)))} is VALID [2022-02-21 04:35:39,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {1151#(<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} assume !(main_~i~0#1 < main_~length1~0#1); {1151#(<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} is VALID [2022-02-21 04:35:39,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {1151#(<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} main_#t~post24#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post24#1;havoc main_#t~post24#1; {1151#(<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} is VALID [2022-02-21 04:35:39,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {1151#(<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} assume !!(main_~i~0#1 < main_~length1~0#1);call write~int(main_#t~nondet25#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet25#1; {1151#(<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} is VALID [2022-02-21 04:35:39,580 INFO L290 TraceCheckUtils]: 4: Hoare triple {1125#true} call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; {1151#(<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0)} is VALID [2022-02-21 04:35:39,580 INFO L290 TraceCheckUtils]: 3: Hoare triple {1125#true} assume !(main_~length2~0#1 < 1); {1125#true} is VALID [2022-02-21 04:35:39,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {1125#true} assume !(main_~length1~0#1 < 1); {1125#true} is VALID [2022-02-21 04:35:39,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {1125#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; {1125#true} is VALID [2022-02-21 04:35:39,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {1125#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1125#true} is VALID [2022-02-21 04:35:39,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:35:39,581 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510952896] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:35:39,581 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:35:39,581 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-02-21 04:35:39,581 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738798391] [2022-02-21 04:35:39,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:35:39,622 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:39,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-21 04:35:39,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2022-02-21 04:35:39,623 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. cyclomatic complexity: 14 Second operand has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 24 states have internal predecessors, (40), 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 04:35:40,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:40,444 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-02-21 04:35:40,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-21 04:35:40,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 24 states have internal predecessors, (40), 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 04:35:40,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:40,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 74 transitions. [2022-02-21 04:35:40,481 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 [2022-02-21 04:35:40,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 74 transitions. [2022-02-21 04:35:40,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2022-02-21 04:35:40,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2022-02-21 04:35:40,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 74 transitions. [2022-02-21 04:35:40,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:40,483 INFO L681 BuchiCegarLoop]: Abstraction has 58 states and 74 transitions. [2022-02-21 04:35:40,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 74 transitions. [2022-02-21 04:35:40,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2022-02-21 04:35:40,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:40,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states and 74 transitions. Second operand has 41 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 40 states have internal predecessors, (52), 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 04:35:40,485 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states and 74 transitions. Second operand has 41 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 40 states have internal predecessors, (52), 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 04:35:40,485 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. Second operand has 41 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 40 states have internal predecessors, (52), 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 04:35:40,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:40,486 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-02-21 04:35:40,486 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2022-02-21 04:35:40,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:40,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:40,487 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 40 states have internal predecessors, (52), 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 58 states and 74 transitions. [2022-02-21 04:35:40,487 INFO L87 Difference]: Start difference. First operand has 41 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 40 states have internal predecessors, (52), 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 58 states and 74 transitions. [2022-02-21 04:35:40,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:40,495 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-02-21 04:35:40,495 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2022-02-21 04:35:40,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:40,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:40,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:40,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:40,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 40 states have internal predecessors, (52), 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 04:35:40,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2022-02-21 04:35:40,498 INFO L704 BuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2022-02-21 04:35:40,498 INFO L587 BuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2022-02-21 04:35:40,498 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 04:35:40,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 52 transitions. [2022-02-21 04:35:40,498 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-02-21 04:35:40,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:40,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:40,499 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:40,499 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:35:40,500 INFO L791 eck$LassoCheckResult]: Stem: 1365#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1347#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet25#1, main_#t~post24#1, main_~i~0#1, main_#t~nondet27#1, main_#t~post26#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 1348#L555 assume !(main_~length1~0#1 < 1); 1367#L555-2 assume !(main_~length2~0#1 < 1); 1343#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 1344#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);call write~int(main_#t~nondet25#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet25#1; 1362#L564-2 main_#t~post24#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post24#1;havoc main_#t~post24#1; 1363#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 1366#L564-4 main_~i~1#1 := 0; 1355#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; 1356#L568-2 main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 1375#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; 1374#L568-2 main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 1373#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);call write~int(main_#t~nondet27#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet27#1; 1359#L568-2 main_#t~post26#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 1357#L568-3 assume !(main_~i~1#1 < main_~length2~0#1); 1358#L568-4 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 + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, cstrstr_#t~mem18#1, cstrstr_#t~ret16#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 1364#L540 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset, cstrlen_#t~mem3#1, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 1353#L518-4 [2022-02-21 04:35:40,500 INFO L793 eck$LassoCheckResult]: Loop: 1353#L518-4 call cstrlen_#t~mem3#1 := read~int(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 1354#L518-1 assume !!(0 != cstrlen_#t~mem3#1);havoc cstrlen_#t~mem3#1; 1368#L518-3 cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset; 1353#L518-4 [2022-02-21 04:35:40,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:40,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1569540784, now seen corresponding path program 3 times [2022-02-21 04:35:40,500 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:40,501 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727846662] [2022-02-21 04:35:40,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:40,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:40,527 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:40,538 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:40,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:40,538 INFO L85 PathProgramCache]: Analyzing trace with hash 79603, now seen corresponding path program 4 times [2022-02-21 04:35:40,538 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:40,538 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623292208] [2022-02-21 04:35:40,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:40,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:40,541 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:40,543 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:40,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:40,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1119505220, now seen corresponding path program 2 times [2022-02-21 04:35:40,544 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:40,544 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140833142] [2022-02-21 04:35:40,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:40,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:40,563 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:40,588 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:42,269 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:42,269 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:42,269 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:42,269 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:42,270 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:42,270 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:42,270 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:42,270 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:42,270 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration7_Lasso [2022-02-21 04:35:42,270 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:42,270 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:42,273 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 04:35:42,276 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 04:35:42,278 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 04:35:42,280 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 04:35:42,281 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 04:35:42,283 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 04:35:42,285 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 04:35:42,287 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 04:35:42,288 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 04:35:42,290 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 04:35:42,292 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 04:35:42,294 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 04:35:42,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 04:35:42,297 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 04:35:42,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 04:35:42,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 04:35:42,304 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 04:35:42,306 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 04:35:42,308 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 04:35:42,310 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 04:35:42,311 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 04:35:42,313 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 04:35:42,316 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 04:35:42,319 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 04:35:42,321 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 04:35:42,322 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 04:35:42,324 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 04:35:42,325 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 04:35:42,327 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 04:35:42,329 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 04:35:43,064 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~nondetString2~0#1.base) (+ 2 ULTIMATE.start_main_~nondetString2~0#1.offset))_1 was not added to the transformula! at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:509) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-21 04:35:43,067 INFO L158 Benchmark]: Toolchain (without parser) took 12833.95ms. Allocated memory was 132.1MB in the beginning and 232.8MB in the end (delta: 100.7MB). Free memory was 97.2MB in the beginning and 193.9MB in the end (delta: -96.7MB). Peak memory consumption was 107.4MB. Max. memory is 16.1GB. [2022-02-21 04:35:43,068 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 79.7MB. Free memory was 35.4MB in the beginning and 35.3MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:43,068 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.62ms. Allocated memory is still 132.1MB. Free memory was 96.9MB in the beginning and 98.0MB in the end (delta: -1.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 04:35:43,068 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.89ms. Allocated memory is still 132.1MB. Free memory was 97.6MB in the beginning and 95.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:43,068 INFO L158 Benchmark]: Boogie Preprocessor took 41.87ms. Allocated memory is still 132.1MB. Free memory was 95.2MB in the beginning and 93.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:43,069 INFO L158 Benchmark]: RCFGBuilder took 427.42ms. Allocated memory is still 132.1MB. Free memory was 93.1MB in the beginning and 74.6MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-21 04:35:43,069 INFO L158 Benchmark]: BuchiAutomizer took 11966.76ms. Allocated memory was 132.1MB in the beginning and 232.8MB in the end (delta: 100.7MB). Free memory was 74.2MB in the beginning and 194.9MB in the end (delta: -120.7MB). Peak memory consumption was 87.0MB. Max. memory is 16.1GB. [2022-02-21 04:35:43,070 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.16ms. Allocated memory is still 79.7MB. Free memory was 35.4MB in the beginning and 35.3MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 341.62ms. Allocated memory is still 132.1MB. Free memory was 96.9MB in the beginning and 98.0MB in the end (delta: -1.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.89ms. Allocated memory is still 132.1MB. Free memory was 97.6MB in the beginning and 95.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.87ms. Allocated memory is still 132.1MB. Free memory was 95.2MB in the beginning and 93.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 427.42ms. Allocated memory is still 132.1MB. Free memory was 93.1MB in the beginning and 74.6MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 11966.76ms. Allocated memory was 132.1MB in the beginning and 232.8MB in the end (delta: 100.7MB). Free memory was 74.2MB in the beginning and 194.9MB in the end (delta: -120.7MB). Peak memory consumption was 87.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~nondetString2~0#1.base) (+ 2 ULTIMATE.start_main_~nondetString2~0#1.offset))_1 was not added to the transformula! de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~nondetString2~0#1.base) (+ 2 ULTIMATE.start_main_~nondetString2~0#1.offset))_1 was not added to the transformula!: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 04:35:43,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-02-21 04:35:43,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-02-21 04:35:43,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~nondetString2~0#1.base) (+ 2 ULTIMATE.start_main_~nondetString2~0#1.offset))_1 was not added to the transformula!