./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrcat-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_cstrcat-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 8688e0efa9d37c2205606fbd307da42d83b0f0e2936dd15336b8b67e136d86b0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:35:18,568 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:35:18,570 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:35:18,626 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:35:18,626 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:35:18,629 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:35:18,630 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:35:18,632 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:35:18,633 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:35:18,637 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:35:18,638 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:35:18,639 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:35:18,639 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:35:18,641 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:35:18,642 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:35:18,645 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:35:18,646 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:35:18,647 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:35:18,664 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:35:18,669 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:35:18,670 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:35:18,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:35:18,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:35:18,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:35:18,673 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:35:18,673 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:35:18,673 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:35:18,674 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:35:18,674 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:35:18,675 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:35:18,675 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:35:18,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:35:18,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:35:18,676 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:35:18,676 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:35:18,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:35:18,677 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:35:18,677 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:35:18,677 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:35:18,678 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:35:18,678 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:35:18,681 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:18,730 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:35:18,730 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:35:18,731 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:35:18,731 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:35:18,732 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:35:18,732 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:35:18,732 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:35:18,732 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:35:18,733 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:35:18,733 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:35:18,733 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:35:18,734 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:35:18,734 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:35:18,734 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:35:18,734 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:35:18,734 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:35:18,734 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:35:18,734 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:35:18,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:35:18,735 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:35:18,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:35:18,735 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:35:18,735 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:35:18,735 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:35:18,736 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:35:18,736 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:35:18,736 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:35:18,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:35:18,737 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:35:18,737 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:35:18,737 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:35:18,738 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:35:18,739 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 -> 8688e0efa9d37c2205606fbd307da42d83b0f0e2936dd15336b8b67e136d86b0 [2022-02-21 04:35:19,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:35:19,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:35:19,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:35:19,144 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:35:19,145 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:35:19,146 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrcat-alloca-2.i [2022-02-21 04:35:19,222 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/082d8733f/3c7b6c85c7e34fd688c7231ee974804e/FLAG5843c3f7a [2022-02-21 04:35:19,695 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:35:19,695 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrcat-alloca-2.i [2022-02-21 04:35:19,717 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/082d8733f/3c7b6c85c7e34fd688c7231ee974804e/FLAG5843c3f7a [2022-02-21 04:35:20,218 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/082d8733f/3c7b6c85c7e34fd688c7231ee974804e [2022-02-21 04:35:20,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:35:20,222 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:35:20,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:20,223 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:35:20,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:35:20,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:20" (1/1) ... [2022-02-21 04:35:20,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@455fcd20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:20, skipping insertion in model container [2022-02-21 04:35:20,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:20" (1/1) ... [2022-02-21 04:35:20,235 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:35:20,258 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:35:20,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:20,586 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:35:20,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:20,646 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:35:20,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:20 WrapperNode [2022-02-21 04:35:20,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:20,648 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:20,648 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:35:20,648 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:35:20,674 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:20" (1/1) ... [2022-02-21 04:35:20,685 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:20" (1/1) ... [2022-02-21 04:35:20,724 INFO L137 Inliner]: procedures = 117, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 89 [2022-02-21 04:35:20,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:20,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:35:20,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:35:20,728 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:35:20,734 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:20" (1/1) ... [2022-02-21 04:35:20,735 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:20" (1/1) ... [2022-02-21 04:35:20,748 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:20" (1/1) ... [2022-02-21 04:35:20,758 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:20" (1/1) ... [2022-02-21 04:35:20,768 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:20" (1/1) ... [2022-02-21 04:35:20,772 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:20" (1/1) ... [2022-02-21 04:35:20,773 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:20" (1/1) ... [2022-02-21 04:35:20,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:35:20,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:35:20,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:35:20,776 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:35:20,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:20" (1/1) ... [2022-02-21 04:35:20,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:20,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:20,815 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:20,819 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:20,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 04:35:20,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 04:35:20,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 04:35:20,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 04:35:20,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:35:20,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:35:21,022 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:35:21,024 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:35:21,247 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:35:21,252 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:35:21,252 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-21 04:35:21,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:21 BoogieIcfgContainer [2022-02-21 04:35:21,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:35:21,255 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:35:21,255 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:35:21,258 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:35:21,258 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:21,259 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:35:20" (1/3) ... [2022-02-21 04:35:21,259 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e10c2e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:21, skipping insertion in model container [2022-02-21 04:35:21,260 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:21,260 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:20" (2/3) ... [2022-02-21 04:35:21,260 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e10c2e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:21, skipping insertion in model container [2022-02-21 04:35:21,260 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:21,260 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:21" (3/3) ... [2022-02-21 04:35:21,262 INFO L388 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrcat-alloca-2.i [2022-02-21 04:35:21,304 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:35:21,304 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:35:21,304 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:35:21,305 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:35:21,305 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:35:21,305 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:35:21,305 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:35:21,305 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:35:21,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:21,351 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2022-02-21 04:35:21,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:21,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:21,357 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 04:35:21,357 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:21,357 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:35:21,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:21,367 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2022-02-21 04:35:21,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:21,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:21,368 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 04:35:21,368 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:21,373 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~length1~0#1, main_~length2~0#1, main_~length3~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~nondet7#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~length3~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 3#L525true assume !(main_~length1~0#1 < 1); 11#L525-2true assume !(main_~length2~0#1 < 2); 21#L528-1true assume !(main_~length3~0#1 < 1); 13#L531-1true assume !(main_~length2~0#1 - main_~length3~0#1 < main_~length1~0#1 || main_~length3~0#1 > main_~length2~0#1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 4#L538-3true [2022-02-21 04:35:21,373 INFO L793 eck$LassoCheckResult]: Loop: 4#L538-3true assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 18#L538-2true main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 4#L538-3true [2022-02-21 04:35:21,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:21,377 INFO L85 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2022-02-21 04:35:21,405 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:21,406 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219735584] [2022-02-21 04:35:21,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:21,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:21,550 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:21,581 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:21,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:21,584 INFO L85 PathProgramCache]: Analyzing trace with hash 2019, now seen corresponding path program 1 times [2022-02-21 04:35:21,585 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:21,585 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773577854] [2022-02-21 04:35:21,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:21,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:21,605 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:21,612 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:21,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:21,613 INFO L85 PathProgramCache]: Analyzing trace with hash 180553841, now seen corresponding path program 1 times [2022-02-21 04:35:21,613 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:21,614 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207837156] [2022-02-21 04:35:21,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:21,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:21,643 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:21,662 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:22,057 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:22,058 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:22,058 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:22,058 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:22,058 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:22,058 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:22,058 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:22,058 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:22,058 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcat-alloca-2.i_Iteration1_Lasso [2022-02-21 04:35:22,058 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:22,058 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:22,073 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:22,079 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:22,081 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:22,082 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:22,086 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:22,088 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:22,090 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:22,092 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:22,094 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:22,096 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:22,318 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:22,320 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:22,333 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:22,337 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:22,339 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:22,340 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:22,342 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:22,642 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:22,645 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:22,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:22,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:22,659 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:22,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:22,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:22,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:22,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:22,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:22,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:22,669 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:22,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:22,672 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:22,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:22,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 04:35:22,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:22,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:22,710 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:22,713 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:22,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:22,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:22,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:22,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:22,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:22,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:22,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:22,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:22,761 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:22,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-02-21 04:35:22,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:22,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:22,793 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:22,795 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:22,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:22,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:22,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:22,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:22,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:22,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:22,803 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:22,803 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:22,818 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:22,851 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:22,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:22,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:22,852 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:22,853 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:22,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:22,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:22,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:22,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:22,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:22,864 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:22,864 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:22,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:22,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:22,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:22,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:22,908 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:22,910 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:22,912 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:22,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:22,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:22,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:22,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:22,924 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:22,924 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:22,928 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:22,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-02-21 04:35:22,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:22,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:22,951 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:22,953 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:22,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:22,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:22,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:22,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:22,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:22,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:22,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:22,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:22,971 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:22,993 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:22,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:22,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:22,995 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:22,996 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:22,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:23,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:23,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:23,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:23,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:23,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:23,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:23,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:23,009 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:23,028 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:23,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:23,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:23,029 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:23,030 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:23,032 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:23,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:23,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:23,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:23,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:23,043 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:23,043 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:23,054 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:23,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-02-21 04:35:23,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:23,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:23,075 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:23,075 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:23,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:23,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:23,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:23,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:23,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:23,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:23,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:23,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:23,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:23,114 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:23,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:23,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:23,116 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:23,119 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:23,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:23,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:23,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:23,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:23,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:23,133 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:23,133 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:23,142 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:23,165 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:23,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:23,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:23,167 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:23,167 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:23,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:23,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:23,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:23,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:23,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:23,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:23,178 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:23,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:23,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:23,198 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:23,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:23,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:23,200 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:23,202 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:23,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:23,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:23,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:23,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:23,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:23,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:23,210 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:23,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:23,212 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:23,228 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:23,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:23,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:23,229 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:23,230 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:23,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:23,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:23,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:23,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:23,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:23,241 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:23,241 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:23,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:23,282 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:23,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:23,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:23,284 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:23,284 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:23,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:23,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:23,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:23,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:23,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:23,295 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:23,295 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:23,301 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:23,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:23,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:23,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:23,321 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:23,322 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:23,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:23,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:23,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:23,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:23,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:23,346 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:23,346 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:23,373 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:23,393 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-02-21 04:35:23,393 INFO L444 ModelExtractionUtils]: 9 out of 31 variables were initially zero. Simplification set additionally 19 variables to zero. [2022-02-21 04:35:23,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:23,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:23,416 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:23,417 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:23,419 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:23,464 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:23,464 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:23,464 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:23,489 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:23,533 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 04:35:23,537 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1;" "main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1;" [2022-02-21 04:35:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:23,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:23,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:35:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:23,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:23,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {32#unseeded} is VALID [2022-02-21 04:35:23,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~length1~0#1, main_~length2~0#1, main_~length3~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~nondet7#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~length3~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {32#unseeded} is VALID [2022-02-21 04:35:23,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#unseeded} assume !(main_~length1~0#1 < 1); {32#unseeded} is VALID [2022-02-21 04:35:23,634 INFO L290 TraceCheckUtils]: 3: Hoare triple {32#unseeded} assume !(main_~length2~0#1 < 2); {32#unseeded} is VALID [2022-02-21 04:35:23,635 INFO L290 TraceCheckUtils]: 4: Hoare triple {32#unseeded} assume !(main_~length3~0#1 < 1); {32#unseeded} is VALID [2022-02-21 04:35:23,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#unseeded} assume !(main_~length2~0#1 - main_~length3~0#1 < main_~length1~0#1 || main_~length3~0#1 > main_~length2~0#1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; {32#unseeded} is VALID [2022-02-21 04:35:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:23,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:35:23,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:23,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:23,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#(>= oldRank0 (+ |ULTIMATE.start_main_~length1~0#1| (* (- 1) |ULTIMATE.start_main_~i~0#1|)))} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; {95#(and (< (+ |ULTIMATE.start_main_~i~0#1| 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:23,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {95#(and (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~length1~0#1|) (>= oldRank0 (+ |ULTIMATE.start_main_~length1~0#1| (* (- 1) |ULTIMATE.start_main_~i~0#1|))))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {75#(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:23,670 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:23,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:23,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:23,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:23,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,705 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:23,707 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:23,797 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 55 states and 77 transitions. Complement of second has 7 states. [2022-02-21 04:35:23,797 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:23,797 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:23,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:23,799 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2022-02-21 04:35:23,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:23,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:23,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:23,802 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:23,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:23,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:23,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 77 transitions. [2022-02-21 04:35:23,804 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2022-02-21 04:35:23,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:23,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:23,805 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:23,816 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2022-02-21 04:35:23,820 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 04:35:23,820 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:23,822 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:23,822 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:35:23,822 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 55 states and 77 transitions. cyclomatic complexity: 32 [2022-02-21 04:35:23,837 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 04:35:23,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:23,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:23,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 77 transitions. cyclomatic complexity: 32 Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:23,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:23,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:23,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 77 transitions. cyclomatic complexity: 32 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:23,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:23,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:23,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 77 transitions. cyclomatic complexity: 32 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:23,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 55 letters. [2022-02-21 04:35:23,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 55 letters. [2022-02-21 04:35:23,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 77 transitions. cyclomatic complexity: 32 Stem has 55 letters. Loop has 55 letters. [2022-02-21 04:35:23,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 22 letters. [2022-02-21 04:35:23,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 22 letters. [2022-02-21 04:35:23,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 77 transitions. cyclomatic complexity: 32 Stem has 22 letters. Loop has 22 letters. [2022-02-21 04:35:23,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:23,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:23,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 77 transitions. cyclomatic complexity: 32 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:23,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:35:23,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:35:23,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 77 transitions. cyclomatic complexity: 32 Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:35:23,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:23,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:23,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 77 transitions. cyclomatic complexity: 32 Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:23,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:23,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:23,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 77 transitions. cyclomatic complexity: 32 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:23,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:23,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:23,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 77 transitions. cyclomatic complexity: 32 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:23,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:23,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:23,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 77 transitions. cyclomatic complexity: 32 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:23,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:23,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:23,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 77 transitions. cyclomatic complexity: 32 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:23,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:23,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:23,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 77 transitions. cyclomatic complexity: 32 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:23,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:23,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:23,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 77 transitions. cyclomatic complexity: 32 Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:23,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:23,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:23,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 77 transitions. cyclomatic complexity: 32 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:23,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:23,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:23,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 77 transitions. cyclomatic complexity: 32 Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:23,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:23,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:23,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 77 transitions. cyclomatic complexity: 32 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:23,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:23,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:23,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 77 transitions. cyclomatic complexity: 32 Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:23,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:35:23,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:35:23,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 77 transitions. cyclomatic complexity: 32 Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:35:23,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:23,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:23,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 77 transitions. cyclomatic complexity: 32 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:23,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:23,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:23,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 77 transitions. cyclomatic complexity: 32 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:23,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:23,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:23,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 77 transitions. cyclomatic complexity: 32 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:23,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:23,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:23,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 77 transitions. cyclomatic complexity: 32 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:23,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:23,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:23,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 77 transitions. cyclomatic complexity: 32 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:23,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,879 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:23,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:23,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-02-21 04:35:23,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:23,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:23,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 6 letters. Loop has 4 letters. [2022-02-21 04:35:23,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:23,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 77 transitions. cyclomatic complexity: 32 [2022-02-21 04:35:23,889 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:23,890 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2022-02-21 04:35:23,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 18 states and 25 transitions. [2022-02-21 04:35:23,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-02-21 04:35:23,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-02-21 04:35:23,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2022-02-21 04:35:23,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:23,893 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 04:35:23,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2022-02-21 04:35:23,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-21 04:35:23,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:23,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 25 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:23,911 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 25 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:23,912 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:23,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:23,915 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-02-21 04:35:23,915 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2022-02-21 04:35:23,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:23,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:23,915 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states and 25 transitions. [2022-02-21 04:35:23,916 INFO L87 Difference]: Start difference. First operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states and 25 transitions. [2022-02-21 04:35:23,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:23,916 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-02-21 04:35:23,916 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2022-02-21 04:35:23,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:23,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:23,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:23,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:23,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:23,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2022-02-21 04:35:23,918 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 04:35:23,918 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 04:35:23,918 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:35:23,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2022-02-21 04:35:23,918 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2022-02-21 04:35:23,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:23,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:23,918 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:23,919 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:23,919 INFO L791 eck$LassoCheckResult]: Stem: 170#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 171#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~length1~0#1, main_~length2~0#1, main_~length3~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~nondet7#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~length3~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 164#L525 assume !(main_~length1~0#1 < 1); 165#L525-2 assume !(main_~length2~0#1 < 2); 177#L528-1 assume !(main_~length3~0#1 < 1); 179#L531-1 assume !(main_~length2~0#1 - main_~length3~0#1 < main_~length1~0#1 || main_~length3~0#1 > main_~length2~0#1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 166#L538-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 168#L538-4 main_~i~1#1 := 0; 172#L542-3 [2022-02-21 04:35:23,919 INFO L793 eck$LassoCheckResult]: Loop: 172#L542-3 assume !!(main_~i~1#1 < main_~length3~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 178#L542-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 172#L542-3 [2022-02-21 04:35:23,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:23,919 INFO L85 PathProgramCache]: Analyzing trace with hash 180553783, now seen corresponding path program 1 times [2022-02-21 04:35:23,919 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:23,919 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626065721] [2022-02-21 04:35:23,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:23,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:23,933 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:23,942 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:23,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:23,943 INFO L85 PathProgramCache]: Analyzing trace with hash 2467, now seen corresponding path program 1 times [2022-02-21 04:35:23,943 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:23,943 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337690848] [2022-02-21 04:35:23,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:23,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:23,949 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:23,954 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:23,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:23,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1713495129, now seen corresponding path program 1 times [2022-02-21 04:35:23,954 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:23,955 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148658376] [2022-02-21 04:35:23,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:23,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:23,969 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:23,982 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:24,225 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:24,226 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:24,226 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:24,226 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:24,226 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:24,226 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:24,226 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:24,226 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:24,226 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcat-alloca-2.i_Iteration2_Lasso [2022-02-21 04:35:24,226 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:24,226 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:24,228 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:24,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:24,232 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:24,234 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:24,236 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:24,239 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:24,241 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:24,243 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:24,245 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:24,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:24,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:24,408 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:24,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:24,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:24,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:24,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:24,777 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:24,777 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:24,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:24,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:24,778 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:24,801 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:24,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:24,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:24,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:24,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:24,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:24,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:24,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:24,810 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:24,836 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:24,862 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:24,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:24,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:24,863 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:24,864 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:24,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:24,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:24,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:24,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:24,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:24,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:24,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:24,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:24,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:24,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-02-21 04:35:24,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:24,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:24,915 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:24,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:24,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:24,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:24,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:24,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:24,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:24,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:24,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:24,933 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:24,955 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:24,984 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:24,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:24,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:24,986 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:24,993 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:25,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:25,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:25,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:25,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:25,006 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:25,006 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:25,009 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:25,030 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:25,081 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:25,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:25,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:25,088 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:25,089 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:25,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:25,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:25,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:25,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:25,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:25,100 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:25,100 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:25,115 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:25,142 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:25,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:25,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:25,144 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:25,144 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:25,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:25,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:25,192 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:25,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:25,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:25,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:25,193 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:25,193 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:25,206 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:25,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:25,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:25,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:25,231 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:25,233 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:25,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:25,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:25,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:25,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:25,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:25,242 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:25,242 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:25,257 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:25,277 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:25,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:25,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:25,288 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:25,308 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:25,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:25,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:25,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:25,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:25,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:25,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:25,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:25,332 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:25,360 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:25,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:25,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:25,363 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:25,364 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:25,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:25,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:25,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:25,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:25,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:25,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:25,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:25,390 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:25,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:25,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:25,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:25,409 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:25,410 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:25,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:25,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:25,419 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:25,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:25,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:25,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:25,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:25,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:25,421 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:25,436 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:25,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:25,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:25,438 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:25,440 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:25,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:25,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:25,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:25,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:25,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:25,455 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:25,455 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:25,479 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:25,497 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-02-21 04:35:25,497 INFO L444 ModelExtractionUtils]: 12 out of 34 variables were initially zero. Simplification set additionally 17 variables to zero. [2022-02-21 04:35:25,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:25,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:25,499 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:25,499 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:25,501 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:25,516 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 04:35:25,516 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:25,516 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_1) = -1*ULTIMATE.start_main_~i~1#1 + 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_1 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_1 - 1*ULTIMATE.start_main_~length3~0#1 >= 0] [2022-02-21 04:35:25,532 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:25,567 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2022-02-21 04:35:25,577 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~1#1 < main_~length3~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1;" "main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2022-02-21 04:35:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:25,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:25,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:25,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 04:35:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:25,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:25,802 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-21 04:35:25,802 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-02-21 04:35:25,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {227#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {227#unseeded} is VALID [2022-02-21 04:35:25,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {227#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~length1~0#1, main_~length2~0#1, main_~length3~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~nondet7#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~length3~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {227#unseeded} is VALID [2022-02-21 04:35:25,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {227#unseeded} assume !(main_~length1~0#1 < 1); {227#unseeded} is VALID [2022-02-21 04:35:25,826 INFO L290 TraceCheckUtils]: 3: Hoare triple {227#unseeded} assume !(main_~length2~0#1 < 2); {227#unseeded} is VALID [2022-02-21 04:35:25,826 INFO L290 TraceCheckUtils]: 4: Hoare triple {227#unseeded} assume !(main_~length3~0#1 < 1); {227#unseeded} is VALID [2022-02-21 04:35:25,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {227#unseeded} assume !(main_~length2~0#1 - main_~length3~0#1 < main_~length1~0#1 || main_~length3~0#1 > main_~length2~0#1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; {276#(and (>= (+ (* (- 1) |ULTIMATE.start_main_~length3~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|)) 0) unseeded)} is VALID [2022-02-21 04:35:25,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {276#(and (>= (+ (* (- 1) |ULTIMATE.start_main_~length3~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|)) 0) unseeded)} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {276#(and (>= (+ (* (- 1) |ULTIMATE.start_main_~length3~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|)) 0) unseeded)} is VALID [2022-02-21 04:35:25,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {276#(and (>= (+ (* (- 1) |ULTIMATE.start_main_~length3~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|)) 0) unseeded)} main_~i~1#1 := 0; {276#(and (>= (+ (* (- 1) |ULTIMATE.start_main_~length3~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|)) 0) unseeded)} is VALID [2022-02-21 04:35:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:25,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 04:35:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:25,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:25,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {277#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_main_~i~1#1|))) (>= (+ (* (- 1) |ULTIMATE.start_main_~length3~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|)) 0))} assume !!(main_~i~1#1 < main_~length3~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; {306#(and (< (+ |ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~length3~0#1|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_main_~i~1#1|))) (>= (+ (* (- 1) |ULTIMATE.start_main_~length3~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|)) 0))} is VALID [2022-02-21 04:35:25,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {306#(and (< (+ |ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~length3~0#1|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_main_~i~1#1|))) (>= (+ (* (- 1) |ULTIMATE.start_main_~length3~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|)) 0))} main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {279#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_main_~i~1#1|))))) (>= (+ (* (- 1) |ULTIMATE.start_main_~length3~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|)) 0))} is VALID [2022-02-21 04:35:25,861 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:25,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:25,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:25,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:25,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,869 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 04:35:25,869 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:25,969 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 38 transitions. Complement of second has 7 states. [2022-02-21 04:35:25,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:25,970 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:25,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. cyclomatic complexity: 11 [2022-02-21 04:35:25,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:25,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:25,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:25,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:25,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:25,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:25,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 38 transitions. [2022-02-21 04:35:25,972 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 04:35:25,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:25,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:25,972 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 25 transitions. cyclomatic complexity: 11 [2022-02-21 04:35:25,973 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 04:35:25,973 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:25,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:25,974 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:25,974 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 38 transitions. cyclomatic complexity: 18 [2022-02-21 04:35:25,974 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 04:35:25,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:25,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:25,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 38 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:25,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:25,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:25,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 38 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:25,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:25,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:25,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 38 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:25,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 11 Stem has 26 letters. Loop has 26 letters. [2022-02-21 04:35:25,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 26 letters. [2022-02-21 04:35:25,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 38 transitions. cyclomatic complexity: 18 Stem has 26 letters. Loop has 26 letters. [2022-02-21 04:35:25,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 11 Stem has 18 letters. Loop has 18 letters. [2022-02-21 04:35:25,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 18 letters. [2022-02-21 04:35:25,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 38 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 18 letters. [2022-02-21 04:35:25,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:25,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:25,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 38 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:25,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:35:25,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:35:25,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 38 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:35:25,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:25,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:25,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 38 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:25,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:25,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:25,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 38 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:25,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:25,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:25,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 38 transitions. cyclomatic complexity: 18 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:25,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:25,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:25,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 38 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:25,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:25,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:25,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 38 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:25,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:25,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:25,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 38 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:25,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:25,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:25,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 38 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:25,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:25,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:25,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 38 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:25,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:35:25,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:35:25,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 38 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:35:25,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:25,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:25,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 38 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:35:25,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:25,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:25,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 38 transitions. cyclomatic complexity: 18 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:25,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:25,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:25,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 38 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:25,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,987 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:25,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:25,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2022-02-21 04:35:25,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:25,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:25,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:25,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 38 transitions. cyclomatic complexity: 18 [2022-02-21 04:35:25,989 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 04:35:25,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 19 states and 27 transitions. [2022-02-21 04:35:25,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 04:35:25,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-02-21 04:35:25,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 27 transitions. [2022-02-21 04:35:25,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:25,990 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2022-02-21 04:35:25,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 27 transitions. [2022-02-21 04:35:25,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-21 04:35:25,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:25,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 27 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 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:25,992 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 27 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 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:25,992 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 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:25,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:25,992 INFO L93 Difference]: Finished difference Result 19 states and 27 transitions. [2022-02-21 04:35:25,993 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 27 transitions. [2022-02-21 04:35:25,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:25,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:25,993 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 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 19 states and 27 transitions. [2022-02-21 04:35:25,993 INFO L87 Difference]: Start difference. First operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 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 19 states and 27 transitions. [2022-02-21 04:35:25,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:25,994 INFO L93 Difference]: Finished difference Result 19 states and 27 transitions. [2022-02-21 04:35:25,994 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 27 transitions. [2022-02-21 04:35:25,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:25,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:25,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:25,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:25,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 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:25,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2022-02-21 04:35:25,995 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2022-02-21 04:35:25,995 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2022-02-21 04:35:25,995 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:35:25,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2022-02-21 04:35:25,996 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 04:35:25,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:25,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:25,996 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:25,996 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:35:25,996 INFO L791 eck$LassoCheckResult]: Stem: 354#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 355#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~length1~0#1, main_~length2~0#1, main_~length3~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~nondet7#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~length3~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 352#L525 assume !(main_~length1~0#1 < 1); 353#L525-2 assume !(main_~length2~0#1 < 2); 363#L528-1 assume !(main_~length3~0#1 < 1); 364#L531-1 assume !(main_~length2~0#1 - main_~length3~0#1 < main_~length1~0#1 || main_~length3~0#1 > main_~length2~0#1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 348#L538-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 350#L538-4 main_~i~1#1 := 0; 356#L542-3 assume !(main_~i~1#1 < main_~length3~0#1 - 1); 365#L542-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_~length3~0#1 - 1), 1);assume { :begin_inline_cstrcat } true;cstrcat_#in~s#1.base, cstrcat_#in~s#1.offset, cstrcat_#in~append#1.base, cstrcat_#in~append#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;havoc cstrcat_#res#1.base, cstrcat_#res#1.offset;havoc cstrcat_#t~pre2#1.base, cstrcat_#t~pre2#1.offset, cstrcat_#t~mem3#1, cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset, cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset, cstrcat_#t~mem6#1, cstrcat_~s#1.base, cstrcat_~s#1.offset, cstrcat_~append#1.base, cstrcat_~append#1.offset, cstrcat_~save~0#1.base, cstrcat_~save~0#1.offset;cstrcat_~s#1.base, cstrcat_~s#1.offset := cstrcat_#in~s#1.base, cstrcat_#in~s#1.offset;cstrcat_~append#1.base, cstrcat_~append#1.offset := cstrcat_#in~append#1.base, cstrcat_#in~append#1.offset;cstrcat_~save~0#1.base, cstrcat_~save~0#1.offset := cstrcat_~s#1.base, cstrcat_~s#1.offset; 366#L517-4 [2022-02-21 04:35:25,997 INFO L793 eck$LassoCheckResult]: Loop: 366#L517-4 call cstrcat_#t~mem3#1 := read~int(cstrcat_~s#1.base, cstrcat_~s#1.offset, 1); 357#L517-1 assume !!(0 != cstrcat_#t~mem3#1);havoc cstrcat_#t~mem3#1; 359#L517-3 cstrcat_#t~pre2#1.base, cstrcat_#t~pre2#1.offset := cstrcat_~s#1.base, 1 + cstrcat_~s#1.offset;cstrcat_~s#1.base, cstrcat_~s#1.offset := cstrcat_~s#1.base, 1 + cstrcat_~s#1.offset;havoc cstrcat_#t~pre2#1.base, cstrcat_#t~pre2#1.offset; 366#L517-4 [2022-02-21 04:35:25,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:25,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1713495071, now seen corresponding path program 1 times [2022-02-21 04:35:25,997 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:25,997 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571343236] [2022-02-21 04:35:25,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:25,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:26,015 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:26,025 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:26,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:26,026 INFO L85 PathProgramCache]: Analyzing trace with hash 86554, now seen corresponding path program 1 times [2022-02-21 04:35:26,026 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:26,026 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346972736] [2022-02-21 04:35:26,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:26,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:26,030 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:26,033 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:26,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:26,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1045403964, now seen corresponding path program 1 times [2022-02-21 04:35:26,033 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:26,033 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286993767] [2022-02-21 04:35:26,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:26,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:26,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {412#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {412#true} is VALID [2022-02-21 04:35:26,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {412#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~length1~0#1, main_~length2~0#1, main_~length3~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~nondet7#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~length3~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {412#true} is VALID [2022-02-21 04:35:26,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {412#true} assume !(main_~length1~0#1 < 1); {412#true} is VALID [2022-02-21 04:35:26,166 INFO L290 TraceCheckUtils]: 3: Hoare triple {412#true} assume !(main_~length2~0#1 < 2); {412#true} is VALID [2022-02-21 04:35:26,167 INFO L290 TraceCheckUtils]: 4: Hoare triple {412#true} assume !(main_~length3~0#1 < 1); {414#(<= 1 |ULTIMATE.start_main_~length3~0#1|)} is VALID [2022-02-21 04:35:26,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {414#(<= 1 |ULTIMATE.start_main_~length3~0#1|)} assume !(main_~length2~0#1 - main_~length3~0#1 < main_~length1~0#1 || main_~length3~0#1 > main_~length2~0#1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; {415#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length3~0#1|))} is VALID [2022-02-21 04:35:26,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {415#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length3~0#1|))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {415#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length3~0#1|))} is VALID [2022-02-21 04:35:26,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {415#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length3~0#1|))} main_~i~1#1 := 0; {416#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~length3~0#1|))} is VALID [2022-02-21 04:35:26,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {416#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~length3~0#1|))} assume !(main_~i~1#1 < main_~length3~0#1 - 1); {417#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length3~0#1|) 1) (<= 1 |ULTIMATE.start_main_~length3~0#1|))} is VALID [2022-02-21 04:35:26,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {417#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length3~0#1|) 1) (<= 1 |ULTIMATE.start_main_~length3~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_~length3~0#1 - 1), 1);assume { :begin_inline_cstrcat } true;cstrcat_#in~s#1.base, cstrcat_#in~s#1.offset, cstrcat_#in~append#1.base, cstrcat_#in~append#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;havoc cstrcat_#res#1.base, cstrcat_#res#1.offset;havoc cstrcat_#t~pre2#1.base, cstrcat_#t~pre2#1.offset, cstrcat_#t~mem3#1, cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset, cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset, cstrcat_#t~mem6#1, cstrcat_~s#1.base, cstrcat_~s#1.offset, cstrcat_~append#1.base, cstrcat_~append#1.offset, cstrcat_~save~0#1.base, cstrcat_~save~0#1.offset;cstrcat_~s#1.base, cstrcat_~s#1.offset := cstrcat_#in~s#1.base, cstrcat_#in~s#1.offset;cstrcat_~append#1.base, cstrcat_~append#1.offset := cstrcat_#in~append#1.base, cstrcat_#in~append#1.offset;cstrcat_~save~0#1.base, cstrcat_~save~0#1.offset := cstrcat_~s#1.base, cstrcat_~s#1.offset; {418#(= (select (select |#memory_int| |ULTIMATE.start_cstrcat_~s#1.base|) |ULTIMATE.start_cstrcat_~s#1.offset|) 0)} is VALID [2022-02-21 04:35:26,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {418#(= (select (select |#memory_int| |ULTIMATE.start_cstrcat_~s#1.base|) |ULTIMATE.start_cstrcat_~s#1.offset|) 0)} call cstrcat_#t~mem3#1 := read~int(cstrcat_~s#1.base, cstrcat_~s#1.offset, 1); {419#(= 0 |ULTIMATE.start_cstrcat_#t~mem3#1|)} is VALID [2022-02-21 04:35:26,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {419#(= 0 |ULTIMATE.start_cstrcat_#t~mem3#1|)} assume !!(0 != cstrcat_#t~mem3#1);havoc cstrcat_#t~mem3#1; {413#false} is VALID [2022-02-21 04:35:26,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {413#false} cstrcat_#t~pre2#1.base, cstrcat_#t~pre2#1.offset := cstrcat_~s#1.base, 1 + cstrcat_~s#1.offset;cstrcat_~s#1.base, cstrcat_~s#1.offset := cstrcat_~s#1.base, 1 + cstrcat_~s#1.offset;havoc cstrcat_#t~pre2#1.base, cstrcat_#t~pre2#1.offset; {413#false} is VALID [2022-02-21 04:35:26,174 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:26,174 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:26,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286993767] [2022-02-21 04:35:26,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286993767] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:26,174 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:26,175 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-21 04:35:26,175 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918331599] [2022-02-21 04:35:26,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:26,221 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:26,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 04:35:26,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-02-21 04:35:26,225 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. cyclomatic complexity: 12 Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:26,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:26,406 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2022-02-21 04:35:26,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 04:35:26,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:26,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:26,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2022-02-21 04:35:26,417 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2022-02-21 04:35:26,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 34 transitions. [2022-02-21 04:35:26,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-02-21 04:35:26,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-02-21 04:35:26,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2022-02-21 04:35:26,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:26,419 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-02-21 04:35:26,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2022-02-21 04:35:26,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2022-02-21 04:35:26,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:26,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 34 transitions. Second operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 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:26,420 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 34 transitions. Second operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 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:26,420 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 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:26,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:26,421 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2022-02-21 04:35:26,421 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-02-21 04:35:26,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:26,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:26,422 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 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 26 states and 34 transitions. [2022-02-21 04:35:26,422 INFO L87 Difference]: Start difference. First operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 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 26 states and 34 transitions. [2022-02-21 04:35:26,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:26,423 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2022-02-21 04:35:26,423 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-02-21 04:35:26,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:26,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:26,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:26,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:26,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 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:26,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2022-02-21 04:35:26,425 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-02-21 04:35:26,425 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-02-21 04:35:26,425 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:35:26,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2022-02-21 04:35:26,425 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 04:35:26,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:26,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:26,426 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:26,426 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:26,426 INFO L791 eck$LassoCheckResult]: Stem: 458#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 459#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~length1~0#1, main_~length2~0#1, main_~length3~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~nondet7#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~length3~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 452#L525 assume !(main_~length1~0#1 < 1); 453#L525-2 assume !(main_~length2~0#1 < 2); 464#L528-1 assume !(main_~length3~0#1 < 1); 467#L531-1 assume !(main_~length2~0#1 - main_~length3~0#1 < main_~length1~0#1 || main_~length3~0#1 > main_~length2~0#1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 454#L538-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 456#L538-4 main_~i~1#1 := 0; 460#L542-3 assume !(main_~i~1#1 < main_~length3~0#1 - 1); 468#L542-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_~length3~0#1 - 1), 1);assume { :begin_inline_cstrcat } true;cstrcat_#in~s#1.base, cstrcat_#in~s#1.offset, cstrcat_#in~append#1.base, cstrcat_#in~append#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;havoc cstrcat_#res#1.base, cstrcat_#res#1.offset;havoc cstrcat_#t~pre2#1.base, cstrcat_#t~pre2#1.offset, cstrcat_#t~mem3#1, cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset, cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset, cstrcat_#t~mem6#1, cstrcat_~s#1.base, cstrcat_~s#1.offset, cstrcat_~append#1.base, cstrcat_~append#1.offset, cstrcat_~save~0#1.base, cstrcat_~save~0#1.offset;cstrcat_~s#1.base, cstrcat_~s#1.offset := cstrcat_#in~s#1.base, cstrcat_#in~s#1.offset;cstrcat_~append#1.base, cstrcat_~append#1.offset := cstrcat_#in~append#1.base, cstrcat_#in~append#1.offset;cstrcat_~save~0#1.base, cstrcat_~save~0#1.offset := cstrcat_~s#1.base, cstrcat_~s#1.offset; 470#L517-4 call cstrcat_#t~mem3#1 := read~int(cstrcat_~s#1.base, cstrcat_~s#1.offset, 1); 461#L517-1 assume !(0 != cstrcat_#t~mem3#1);havoc cstrcat_#t~mem3#1; 462#L518-2 [2022-02-21 04:35:26,426 INFO L793 eck$LassoCheckResult]: Loop: 462#L518-2 cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset := cstrcat_~s#1.base, cstrcat_~s#1.offset;cstrcat_~s#1.base, cstrcat_~s#1.offset := cstrcat_#t~post4#1.base, 1 + cstrcat_#t~post4#1.offset;cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset := cstrcat_~append#1.base, cstrcat_~append#1.offset;cstrcat_~append#1.base, cstrcat_~append#1.offset := cstrcat_#t~post5#1.base, 1 + cstrcat_#t~post5#1.offset;call cstrcat_#t~mem6#1 := read~int(cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset, 1);call write~int(cstrcat_#t~mem6#1, cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset, 1); 463#L518 assume !!(0 != cstrcat_#t~mem6#1);havoc cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset;havoc cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset;havoc cstrcat_#t~mem6#1; 462#L518-2 [2022-02-21 04:35:26,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:26,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1696290690, now seen corresponding path program 1 times [2022-02-21 04:35:26,427 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:26,427 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974821949] [2022-02-21 04:35:26,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:26,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:26,444 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:26,456 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:26,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:26,456 INFO L85 PathProgramCache]: Analyzing trace with hash 3238, now seen corresponding path program 1 times [2022-02-21 04:35:26,456 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:26,457 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557283342] [2022-02-21 04:35:26,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:26,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:26,462 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:26,466 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:26,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:26,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1952217113, now seen corresponding path program 1 times [2022-02-21 04:35:26,467 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:26,467 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785883287] [2022-02-21 04:35:26,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:26,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:26,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {533#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {533#true} is VALID [2022-02-21 04:35:26,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {533#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~length1~0#1, main_~length2~0#1, main_~length3~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~nondet7#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~length3~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {533#true} is VALID [2022-02-21 04:35:26,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {533#true} assume !(main_~length1~0#1 < 1); {535#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:35:26,577 INFO L290 TraceCheckUtils]: 3: Hoare triple {535#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} assume !(main_~length2~0#1 < 2); {535#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:35:26,578 INFO L290 TraceCheckUtils]: 4: Hoare triple {535#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} assume !(main_~length3~0#1 < 1); {535#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:35:26,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {535#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} assume !(main_~length2~0#1 - main_~length3~0#1 < main_~length1~0#1 || main_~length3~0#1 > main_~length2~0#1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; {536#(and (= |ULTIMATE.start_main_~i~0#1| 0) (or (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)))} is VALID [2022-02-21 04:35:26,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {536#(and (= |ULTIMATE.start_main_~i~0#1| 0) (or (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {537#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} is VALID [2022-02-21 04:35:26,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {537#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} main_~i~1#1 := 0; {537#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} is VALID [2022-02-21 04:35:26,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {537#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} assume !(main_~i~1#1 < main_~length3~0#1 - 1); {537#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} is VALID [2022-02-21 04:35:26,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {537#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 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_~length3~0#1 - 1), 1);assume { :begin_inline_cstrcat } true;cstrcat_#in~s#1.base, cstrcat_#in~s#1.offset, cstrcat_#in~append#1.base, cstrcat_#in~append#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;havoc cstrcat_#res#1.base, cstrcat_#res#1.offset;havoc cstrcat_#t~pre2#1.base, cstrcat_#t~pre2#1.offset, cstrcat_#t~mem3#1, cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset, cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset, cstrcat_#t~mem6#1, cstrcat_~s#1.base, cstrcat_~s#1.offset, cstrcat_~append#1.base, cstrcat_~append#1.offset, cstrcat_~save~0#1.base, cstrcat_~save~0#1.offset;cstrcat_~s#1.base, cstrcat_~s#1.offset := cstrcat_#in~s#1.base, cstrcat_#in~s#1.offset;cstrcat_~append#1.base, cstrcat_~append#1.offset := cstrcat_#in~append#1.base, cstrcat_#in~append#1.offset;cstrcat_~save~0#1.base, cstrcat_~save~0#1.offset := cstrcat_~s#1.base, cstrcat_~s#1.offset; {538#(= 0 (select (select |#memory_int| |ULTIMATE.start_cstrcat_~append#1.base|) |ULTIMATE.start_cstrcat_~append#1.offset|))} is VALID [2022-02-21 04:35:26,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {538#(= 0 (select (select |#memory_int| |ULTIMATE.start_cstrcat_~append#1.base|) |ULTIMATE.start_cstrcat_~append#1.offset|))} call cstrcat_#t~mem3#1 := read~int(cstrcat_~s#1.base, cstrcat_~s#1.offset, 1); {538#(= 0 (select (select |#memory_int| |ULTIMATE.start_cstrcat_~append#1.base|) |ULTIMATE.start_cstrcat_~append#1.offset|))} is VALID [2022-02-21 04:35:26,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {538#(= 0 (select (select |#memory_int| |ULTIMATE.start_cstrcat_~append#1.base|) |ULTIMATE.start_cstrcat_~append#1.offset|))} assume !(0 != cstrcat_#t~mem3#1);havoc cstrcat_#t~mem3#1; {538#(= 0 (select (select |#memory_int| |ULTIMATE.start_cstrcat_~append#1.base|) |ULTIMATE.start_cstrcat_~append#1.offset|))} is VALID [2022-02-21 04:35:26,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {538#(= 0 (select (select |#memory_int| |ULTIMATE.start_cstrcat_~append#1.base|) |ULTIMATE.start_cstrcat_~append#1.offset|))} cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset := cstrcat_~s#1.base, cstrcat_~s#1.offset;cstrcat_~s#1.base, cstrcat_~s#1.offset := cstrcat_#t~post4#1.base, 1 + cstrcat_#t~post4#1.offset;cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset := cstrcat_~append#1.base, cstrcat_~append#1.offset;cstrcat_~append#1.base, cstrcat_~append#1.offset := cstrcat_#t~post5#1.base, 1 + cstrcat_#t~post5#1.offset;call cstrcat_#t~mem6#1 := read~int(cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset, 1);call write~int(cstrcat_#t~mem6#1, cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset, 1); {539#(= 0 |ULTIMATE.start_cstrcat_#t~mem6#1|)} is VALID [2022-02-21 04:35:26,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {539#(= 0 |ULTIMATE.start_cstrcat_#t~mem6#1|)} assume !!(0 != cstrcat_#t~mem6#1);havoc cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset;havoc cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset;havoc cstrcat_#t~mem6#1; {534#false} is VALID [2022-02-21 04:35:26,583 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:26,583 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:26,583 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785883287] [2022-02-21 04:35:26,583 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785883287] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:26,584 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:26,584 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-21 04:35:26,584 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36495133] [2022-02-21 04:35:26,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:26,676 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:26,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 04:35:26,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-21 04:35:26,676 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 12 Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:26,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:26,896 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-02-21 04:35:26,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 04:35:26,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:26,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:26,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 46 transitions. [2022-02-21 04:35:26,912 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-02-21 04:35:26,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 31 states and 40 transitions. [2022-02-21 04:35:26,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-02-21 04:35:26,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-02-21 04:35:26,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2022-02-21 04:35:26,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:26,913 INFO L681 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2022-02-21 04:35:26,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2022-02-21 04:35:26,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-02-21 04:35:26,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:26,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states and 40 transitions. Second operand has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 states have internal predecessors, (39), 0 states have call successors, (0), 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:26,915 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states and 40 transitions. Second operand has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 states have internal predecessors, (39), 0 states have call successors, (0), 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:26,916 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 states have internal predecessors, (39), 0 states have call successors, (0), 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:26,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:26,917 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-02-21 04:35:26,917 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-02-21 04:35:26,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:26,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:26,918 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 states have internal predecessors, (39), 0 states have call successors, (0), 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 31 states and 40 transitions. [2022-02-21 04:35:26,918 INFO L87 Difference]: Start difference. First operand has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 states have internal predecessors, (39), 0 states have call successors, (0), 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 31 states and 40 transitions. [2022-02-21 04:35:26,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:26,919 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-02-21 04:35:26,919 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-02-21 04:35:26,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:26,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:26,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:26,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:26,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 states have internal predecessors, (39), 0 states have call successors, (0), 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:26,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-02-21 04:35:26,921 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-02-21 04:35:26,921 INFO L587 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-02-21 04:35:26,921 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:35:26,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2022-02-21 04:35:26,921 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-02-21 04:35:26,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:26,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:26,922 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:26,922 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:35:26,922 INFO L791 eck$LassoCheckResult]: Stem: 589#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 590#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~length1~0#1, main_~length2~0#1, main_~length3~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~nondet7#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~length3~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 582#L525 assume !(main_~length1~0#1 < 1); 583#L525-2 assume !(main_~length2~0#1 < 2); 596#L528-1 assume !(main_~length3~0#1 < 1); 599#L531-1 assume !(main_~length2~0#1 - main_~length3~0#1 < main_~length1~0#1 || main_~length3~0#1 > main_~length2~0#1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 584#L538-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 586#L538-4 main_~i~1#1 := 0; 600#L542-3 assume !!(main_~i~1#1 < main_~length3~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 601#L542-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 610#L542-3 assume !(main_~i~1#1 < main_~length3~0#1 - 1); 609#L542-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_~length3~0#1 - 1), 1);assume { :begin_inline_cstrcat } true;cstrcat_#in~s#1.base, cstrcat_#in~s#1.offset, cstrcat_#in~append#1.base, cstrcat_#in~append#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;havoc cstrcat_#res#1.base, cstrcat_#res#1.offset;havoc cstrcat_#t~pre2#1.base, cstrcat_#t~pre2#1.offset, cstrcat_#t~mem3#1, cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset, cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset, cstrcat_#t~mem6#1, cstrcat_~s#1.base, cstrcat_~s#1.offset, cstrcat_~append#1.base, cstrcat_~append#1.offset, cstrcat_~save~0#1.base, cstrcat_~save~0#1.offset;cstrcat_~s#1.base, cstrcat_~s#1.offset := cstrcat_#in~s#1.base, cstrcat_#in~s#1.offset;cstrcat_~append#1.base, cstrcat_~append#1.offset := cstrcat_#in~append#1.base, cstrcat_#in~append#1.offset;cstrcat_~save~0#1.base, cstrcat_~save~0#1.offset := cstrcat_~s#1.base, cstrcat_~s#1.offset; 608#L517-4 [2022-02-21 04:35:26,922 INFO L793 eck$LassoCheckResult]: Loop: 608#L517-4 call cstrcat_#t~mem3#1 := read~int(cstrcat_~s#1.base, cstrcat_~s#1.offset, 1); 592#L517-1 assume !!(0 != cstrcat_#t~mem3#1);havoc cstrcat_#t~mem3#1; 593#L517-3 cstrcat_#t~pre2#1.base, cstrcat_#t~pre2#1.offset := cstrcat_~s#1.base, 1 + cstrcat_~s#1.offset;cstrcat_~s#1.base, cstrcat_~s#1.offset := cstrcat_~s#1.base, 1 + cstrcat_~s#1.offset;havoc cstrcat_#t~pre2#1.base, cstrcat_#t~pre2#1.offset; 608#L517-4 [2022-02-21 04:35:26,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:26,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1696346049, now seen corresponding path program 1 times [2022-02-21 04:35:26,923 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:26,923 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582046497] [2022-02-21 04:35:26,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:26,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:26,945 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:26,956 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:26,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:26,957 INFO L85 PathProgramCache]: Analyzing trace with hash 86554, now seen corresponding path program 2 times [2022-02-21 04:35:26,957 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:26,957 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560947397] [2022-02-21 04:35:26,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:26,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:26,962 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:26,964 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:26,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:26,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1259997786, now seen corresponding path program 1 times [2022-02-21 04:35:26,965 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:26,965 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721546080] [2022-02-21 04:35:26,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:26,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:26,982 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:26,993 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:27,535 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:27,536 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:27,536 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:27,536 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:27,536 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:27,536 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:27,536 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:27,536 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:27,536 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcat-alloca-2.i_Iteration5_Lasso [2022-02-21 04:35:27,536 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:27,536 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:27,539 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:27,542 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:27,544 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:27,545 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:27,547 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:27,548 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:27,910 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:35:27,913 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:35:27,922 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:27,924 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:27,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:27,927 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:27,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:27,930 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:27,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:27,933 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:27,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:27,937 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:27,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:27,940 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:27,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:27,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:27,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:27,946 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:27,948 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:27,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:27,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:27,952 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:28,337 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:28,338 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:28,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:28,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:28,347 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:28,349 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:28,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:28,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:28,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:28,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:28,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:28,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:28,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:28,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:28,373 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:28,392 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:28,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:28,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:28,394 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:28,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 04:35:28,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:28,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:28,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:28,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:28,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:28,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:28,421 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:28,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-02-21 04:35:28,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:28,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:28,439 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:28,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 04:35:28,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:28,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:28,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:28,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:28,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:28,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:28,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:28,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:28,472 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:28,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:28,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:28,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:28,496 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:28,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 04:35:28,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:28,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:28,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:28,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:28,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:28,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:28,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:28,528 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:28,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-02-21 04:35:28,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:28,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:28,560 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:28,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 04:35:28,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:28,611 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:28,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:28,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:28,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:28,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:28,611 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:28,621 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:28,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:28,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:28,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:28,651 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:28,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 04:35:28,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:28,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:28,659 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 04:35:28,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:28,663 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-02-21 04:35:28,663 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:35:28,676 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:28,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:28,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:28,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:28,696 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:28,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-02-21 04:35:28,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:28,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:28,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:28,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:28,708 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:28,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:28,748 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:28,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:28,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:28,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:28,767 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:28,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 04:35:28,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:28,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:28,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:28,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:28,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:28,781 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:28,782 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:28,797 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:28,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-02-21 04:35:28,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:28,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:28,817 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:28,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 04:35:28,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:28,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:28,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:28,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:28,828 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:28,828 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:28,848 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:28,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:28,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:28,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:28,868 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:28,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 04:35:28,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:28,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:28,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:28,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:28,878 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:28,878 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:28,880 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:28,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:28,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:28,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:28,900 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:28,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-02-21 04:35:28,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:28,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:28,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:28,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:28,920 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:28,920 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:28,936 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:28,965 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2022-02-21 04:35:28,965 INFO L444 ModelExtractionUtils]: 12 out of 55 variables were initially zero. Simplification set additionally 40 variables to zero. [2022-02-21 04:35:28,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:28,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:28,966 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:28,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-02-21 04:35:28,968 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:28,989 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:28,989 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:28,989 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcat_~s#1.base)_1, ULTIMATE.start_cstrcat_~s#1.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcat_~s#1.base)_1 - 1*ULTIMATE.start_cstrcat_~s#1.offset Supporting invariants [] [2022-02-21 04:35:29,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:29,056 INFO L297 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2022-02-21 04:35:29,060 INFO L390 LassoCheck]: Loop: "call cstrcat_#t~mem3#1 := read~int(cstrcat_~s#1.base, cstrcat_~s#1.offset, 1);" "assume !!(0 != cstrcat_#t~mem3#1);havoc cstrcat_#t~mem3#1;" "cstrcat_#t~pre2#1.base, cstrcat_#t~pre2#1.offset := cstrcat_~s#1.base, 1 + cstrcat_~s#1.offset;cstrcat_~s#1.base, cstrcat_~s#1.offset := cstrcat_~s#1.base, 1 + cstrcat_~s#1.offset;havoc cstrcat_#t~pre2#1.base, cstrcat_#t~pre2#1.offset;" [2022-02-21 04:35:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:29,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:29,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:35:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:29,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:29,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {683#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {683#unseeded} is VALID [2022-02-21 04:35:29,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {683#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~length1~0#1, main_~length2~0#1, main_~length3~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~nondet7#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~length3~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {683#unseeded} is VALID [2022-02-21 04:35:29,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {683#unseeded} assume !(main_~length1~0#1 < 1); {683#unseeded} is VALID [2022-02-21 04:35:29,137 INFO L290 TraceCheckUtils]: 3: Hoare triple {683#unseeded} assume !(main_~length2~0#1 < 2); {683#unseeded} is VALID [2022-02-21 04:35:29,137 INFO L290 TraceCheckUtils]: 4: Hoare triple {683#unseeded} assume !(main_~length3~0#1 < 1); {683#unseeded} is VALID [2022-02-21 04:35:29,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {683#unseeded} assume !(main_~length2~0#1 - main_~length3~0#1 < main_~length1~0#1 || main_~length3~0#1 > main_~length2~0#1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; {683#unseeded} is VALID [2022-02-21 04:35:29,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {683#unseeded} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {683#unseeded} is VALID [2022-02-21 04:35:29,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {683#unseeded} main_~i~1#1 := 0; {683#unseeded} is VALID [2022-02-21 04:35:29,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {683#unseeded} assume !!(main_~i~1#1 < main_~length3~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; {683#unseeded} is VALID [2022-02-21 04:35:29,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {683#unseeded} main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {683#unseeded} is VALID [2022-02-21 04:35:29,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {683#unseeded} assume !(main_~i~1#1 < main_~length3~0#1 - 1); {683#unseeded} is VALID [2022-02-21 04:35:29,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {683#unseeded} 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_~length3~0#1 - 1), 1);assume { :begin_inline_cstrcat } true;cstrcat_#in~s#1.base, cstrcat_#in~s#1.offset, cstrcat_#in~append#1.base, cstrcat_#in~append#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;havoc cstrcat_#res#1.base, cstrcat_#res#1.offset;havoc cstrcat_#t~pre2#1.base, cstrcat_#t~pre2#1.offset, cstrcat_#t~mem3#1, cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset, cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset, cstrcat_#t~mem6#1, cstrcat_~s#1.base, cstrcat_~s#1.offset, cstrcat_~append#1.base, cstrcat_~append#1.offset, cstrcat_~save~0#1.base, cstrcat_~save~0#1.offset;cstrcat_~s#1.base, cstrcat_~s#1.offset := cstrcat_#in~s#1.base, cstrcat_#in~s#1.offset;cstrcat_~append#1.base, cstrcat_~append#1.offset := cstrcat_#in~append#1.base, cstrcat_#in~append#1.offset;cstrcat_~save~0#1.base, cstrcat_~save~0#1.offset := cstrcat_~s#1.base, cstrcat_~s#1.offset; {683#unseeded} is VALID [2022-02-21 04:35:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:29,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 04:35:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:29,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:29,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {686#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcat_~s#1.offset|) (select |#length| |ULTIMATE.start_cstrcat_~s#1.base|)))} call cstrcat_#t~mem3#1 := read~int(cstrcat_~s#1.base, cstrcat_~s#1.offset, 1); {794#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcat_~s#1.offset|) (select |#length| |ULTIMATE.start_cstrcat_~s#1.base|))) (<= (+ |ULTIMATE.start_cstrcat_~s#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcat_~s#1.base|)))} is VALID [2022-02-21 04:35:29,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {794#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcat_~s#1.offset|) (select |#length| |ULTIMATE.start_cstrcat_~s#1.base|))) (<= (+ |ULTIMATE.start_cstrcat_~s#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcat_~s#1.base|)))} assume !!(0 != cstrcat_#t~mem3#1);havoc cstrcat_#t~mem3#1; {794#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcat_~s#1.offset|) (select |#length| |ULTIMATE.start_cstrcat_~s#1.base|))) (<= (+ |ULTIMATE.start_cstrcat_~s#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcat_~s#1.base|)))} is VALID [2022-02-21 04:35:29,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {794#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcat_~s#1.offset|) (select |#length| |ULTIMATE.start_cstrcat_~s#1.base|))) (<= (+ |ULTIMATE.start_cstrcat_~s#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcat_~s#1.base|)))} cstrcat_#t~pre2#1.base, cstrcat_#t~pre2#1.offset := cstrcat_~s#1.base, 1 + cstrcat_~s#1.offset;cstrcat_~s#1.base, cstrcat_~s#1.offset := cstrcat_~s#1.base, 1 + cstrcat_~s#1.offset;havoc cstrcat_#t~pre2#1.base, cstrcat_#t~pre2#1.offset; {756#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcat_~s#1.offset|) (select |#length| |ULTIMATE.start_cstrcat_~s#1.base|)))))} is VALID [2022-02-21 04:35:29,210 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:29,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:29,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:29,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:29,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,222 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:29,222 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:29,269 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 15. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 52 transitions. Complement of second has 6 states. [2022-02-21 04:35:29,269 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:29,269 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:29,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. cyclomatic complexity: 15 [2022-02-21 04:35:29,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:29,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:29,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:29,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:29,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:29,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:29,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 52 transitions. [2022-02-21 04:35:29,271 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:29,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:29,271 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 39 transitions. cyclomatic complexity: 15 [2022-02-21 04:35:29,272 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 04:35:29,272 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:29,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:29,272 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:29,272 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 40 states and 52 transitions. cyclomatic complexity: 18 [2022-02-21 04:35:29,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 52 transitions. cyclomatic complexity: 18 [2022-02-21 04:35:29,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:29,273 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:35:29,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:29,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:29,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 52 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:29,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:29,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:29,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 52 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:29,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 15 Stem has 40 letters. Loop has 40 letters. [2022-02-21 04:35:29,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 40 letters. [2022-02-21 04:35:29,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 52 transitions. cyclomatic complexity: 18 Stem has 40 letters. Loop has 40 letters. [2022-02-21 04:35:29,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 15 Stem has 30 letters. Loop has 30 letters. [2022-02-21 04:35:29,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 30 letters. [2022-02-21 04:35:29,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 52 transitions. cyclomatic complexity: 18 Stem has 30 letters. Loop has 30 letters. [2022-02-21 04:35:29,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:29,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:29,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 52 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:29,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 15 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:29,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:29,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 52 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:29,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:29,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:29,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 52 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:29,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:29,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:29,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 52 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:29,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 2 letters. [2022-02-21 04:35:29,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 2 letters. [2022-02-21 04:35:29,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 52 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 2 letters. [2022-02-21 04:35:29,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 2 letters. [2022-02-21 04:35:29,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 2 letters. [2022-02-21 04:35:29,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 52 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 2 letters. [2022-02-21 04:35:29,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:29,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:29,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 52 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:29,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:29,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:29,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 52 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:29,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:29,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:29,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 52 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:29,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:29,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:29,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 52 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:29,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,282 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:29,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:29,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-02-21 04:35:29,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:29,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:29,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 12 letters. Loop has 6 letters. [2022-02-21 04:35:29,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:29,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 52 transitions. cyclomatic complexity: 18 [2022-02-21 04:35:29,285 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:29,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2022-02-21 04:35:29,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:35:29,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:35:29,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:35:29,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:29,285 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:29,285 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:29,285 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:29,285 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 04:35:29,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:35:29,286 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:29,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:29,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:35:29 BoogieIcfgContainer [2022-02-21 04:35:29,290 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:35:29,291 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:35:29,291 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:35:29,291 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:35:29,291 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:21" (3/4) ... [2022-02-21 04:35:29,293 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:35:29,293 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:35:29,294 INFO L158 Benchmark]: Toolchain (without parser) took 9072.27ms. Allocated memory was 104.9MB in the beginning and 151.0MB in the end (delta: 46.1MB). Free memory was 73.7MB in the beginning and 65.6MB in the end (delta: 8.1MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. [2022-02-21 04:35:29,294 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:29,295 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.10ms. Allocated memory is still 104.9MB. Free memory was 73.6MB in the beginning and 73.0MB in the end (delta: 517.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 04:35:29,295 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.31ms. Allocated memory is still 104.9MB. Free memory was 73.0MB in the beginning and 70.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:29,295 INFO L158 Benchmark]: Boogie Preprocessor took 48.03ms. Allocated memory is still 104.9MB. Free memory was 70.8MB in the beginning and 69.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:29,295 INFO L158 Benchmark]: RCFGBuilder took 478.09ms. Allocated memory is still 104.9MB. Free memory was 69.3MB in the beginning and 55.2MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-21 04:35:29,296 INFO L158 Benchmark]: BuchiAutomizer took 8035.55ms. Allocated memory was 104.9MB in the beginning and 151.0MB in the end (delta: 46.1MB). Free memory was 54.9MB in the beginning and 66.7MB in the end (delta: -11.8MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. [2022-02-21 04:35:29,296 INFO L158 Benchmark]: Witness Printer took 2.70ms. Allocated memory is still 151.0MB. Free memory was 66.7MB in the beginning and 65.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:29,297 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.17ms. Allocated memory is still 83.9MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 424.10ms. Allocated memory is still 104.9MB. Free memory was 73.6MB in the beginning and 73.0MB in the end (delta: 517.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.31ms. Allocated memory is still 104.9MB. Free memory was 73.0MB in the beginning and 70.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.03ms. Allocated memory is still 104.9MB. Free memory was 70.8MB in the beginning and 69.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 478.09ms. Allocated memory is still 104.9MB. Free memory was 69.3MB in the beginning and 55.2MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 8035.55ms. Allocated memory was 104.9MB in the beginning and 151.0MB in the end (delta: 46.1MB). Free memory was 54.9MB in the beginning and 66.7MB in the end (delta: -11.8MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. * Witness Printer took 2.70ms. Allocated memory is still 151.0MB. Free memory was 66.7MB in the beginning and 65.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[nondetString2] + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.9s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 6.4s. Construction of modules took 0.1s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 30 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 149 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 149 mSDsluCounter, 255 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 162 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 119 IncrementalHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 93 mSDtfsCounter, 119 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital166 mio100 ax111 hnf100 lsp83 ukn79 mio100 lsp58 div100 bol100 ite100 ukn100 eq169 hnf90 smp97 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 3 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:35:29,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:29,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE