./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/cstrcmp-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/cstrcmp-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 382beab9cdcef42f6594628efe520684fdbc8c72ada26cb53ddf4918b8957d49 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:34:48,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:34:48,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:34:48,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:34:48,228 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:34:48,230 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:34:48,231 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:34:48,234 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:34:48,235 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:34:48,239 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:34:48,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:34:48,240 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:34:48,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:34:48,243 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:34:48,244 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:34:48,246 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:34:48,246 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:34:48,247 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:34:48,249 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:34:48,253 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:34:48,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:34:48,255 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:34:48,257 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:34:48,257 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:34:48,262 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:34:48,262 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:34:48,263 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:34:48,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:34:48,264 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:34:48,265 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:34:48,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:34:48,266 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:34:48,267 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:34:48,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:34:48,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:34:48,269 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:34:48,270 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:34:48,270 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:34:48,270 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:34:48,271 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:34:48,271 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:34:48,272 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:34:48,305 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:34:48,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:34:48,306 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:34:48,306 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:34:48,307 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:34:48,307 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:34:48,308 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:34:48,308 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:34:48,308 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:34:48,308 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:34:48,309 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:34:48,309 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:34:48,309 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:34:48,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:34:48,310 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:34:48,310 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:34:48,310 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:34:48,310 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:34:48,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:34:48,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:34:48,311 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:34:48,311 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:34:48,311 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:34:48,311 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:34:48,312 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:34:48,312 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:34:48,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:34:48,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:34:48,313 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:34:48,313 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:34:48,313 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:34:48,314 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:34:48,315 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 -> 382beab9cdcef42f6594628efe520684fdbc8c72ada26cb53ddf4918b8957d49 [2022-02-21 04:34:48,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:34:48,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:34:48,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:34:48,560 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:34:48,560 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:34:48,561 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.i [2022-02-21 04:34:48,613 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffb90e09f/d9a64d6c0cba450baa15a57ea020bc9e/FLAGba25e8020 [2022-02-21 04:34:49,016 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:34:49,017 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.i [2022-02-21 04:34:49,033 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffb90e09f/d9a64d6c0cba450baa15a57ea020bc9e/FLAGba25e8020 [2022-02-21 04:34:49,041 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffb90e09f/d9a64d6c0cba450baa15a57ea020bc9e [2022-02-21 04:34:49,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:34:49,046 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:34:49,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:34:49,049 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:34:49,052 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:34:49,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eed3ed1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49, skipping insertion in model container [2022-02-21 04:34:49,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:34:49,097 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:34:49,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:34:49,370 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:34:49,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:34:49,440 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:34:49,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49 WrapperNode [2022-02-21 04:34:49,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:34:49,442 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:34:49,443 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:34:49,443 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:34:49,448 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:34:49" (1/1) ... [2022-02-21 04:34:49,466 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:34:49" (1/1) ... [2022-02-21 04:34:49,494 INFO L137 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 91 [2022-02-21 04:34:49,495 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:34:49,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:34:49,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:34:49,496 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:34:49,501 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,510 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:34:49,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:34:49,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:34:49,519 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:34:49,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (1/1) ... [2022-02-21 04:34:49,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:49,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:49,552 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:34:49,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 04:34:49,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 04:34:49,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 04:34:49,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 04:34:49,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 04:34:49,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:34:49,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:34:49,730 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:34:49,731 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:34:49,961 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:34:49,966 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:34:49,967 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-21 04:34:49,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:34:49 BoogieIcfgContainer [2022-02-21 04:34:49,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:34:49,969 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:34:49,969 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:34:49,972 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:34:49,972 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:34:49,973 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:34:49" (1/3) ... [2022-02-21 04:34:49,974 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ba07863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:34:49, skipping insertion in model container [2022-02-21 04:34:49,974 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:34:49,974 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:49" (2/3) ... [2022-02-21 04:34:49,974 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ba07863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:34:49, skipping insertion in model container [2022-02-21 04:34:49,974 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:34:49,974 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:34:49" (3/3) ... [2022-02-21 04:34:49,975 INFO L388 chiAutomizerObserver]: Analyzing ICFG cstrcmp-alloca-2.i [2022-02-21 04:34:50,016 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:34:50,016 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:34:50,016 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:34:50,017 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:34:50,017 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:34:50,017 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:34:50,017 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:34:50,017 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:34:50,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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:34:50,053 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2022-02-21 04:34:50,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:50,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:50,058 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:34:50,058 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:34:50,059 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:34:50,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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:34:50,063 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2022-02-21 04:34:50,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:50,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:50,064 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:34:50,064 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:34:50,083 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 13#L528true assume !(main_~length1~0#1 < 1); 7#L528-2true assume !(main_~length2~0#1 < 1); 14#L531-1true call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; 6#L537-3true [2022-02-21 04:34:50,083 INFO L793 eck$LassoCheckResult]: Loop: 6#L537-3true assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet16#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; 19#L537-2true main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; 6#L537-3true [2022-02-21 04:34:50,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:50,087 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-02-21 04:34:50,094 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:50,095 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365227624] [2022-02-21 04:34:50,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:50,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:50,166 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:50,194 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:50,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:50,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2022-02-21 04:34:50,197 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:50,198 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760279225] [2022-02-21 04:34:50,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:50,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:50,220 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:50,230 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:50,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:50,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2022-02-21 04:34:50,232 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:50,232 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943960699] [2022-02-21 04:34:50,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:50,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:50,266 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:50,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:50,282 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:50,661 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:34:50,662 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:34:50,662 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:34:50,662 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:34:50,662 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:34:50,663 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:50,663 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:34:50,663 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:34:50,663 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcmp-alloca-2.i_Iteration1_Lasso [2022-02-21 04:34:50,663 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:34:50,664 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:34:50,686 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:34:50,693 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:34:50,696 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:34:50,698 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:34:50,701 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:34:50,705 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:34:50,709 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:34:50,712 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:34:50,715 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:34:50,718 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:34:50,723 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:34:50,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:50,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:50,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:50,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:51,227 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:34:51,231 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:34:51,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,239 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:34:51,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:34:51,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:51,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:51,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:51,254 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:34:51,260 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,279 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:34:51,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,281 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:34:51,287 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:34:51,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:51,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:51,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:51,315 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,334 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:34:51,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,336 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:34:51,338 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:34:51,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:51,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:51,346 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:51,351 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 04:34:51,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,371 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:34:51,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,393 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:34:51,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:51,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:51,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:51,396 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-02-21 04:34:51,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,421 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:34:51,421 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:34:51,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:34:51,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:51,452 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:51,461 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:51,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,483 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:34:51,484 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:34:51,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:34:51,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,494 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:51,494 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:51,509 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,527 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:34:51,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,529 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:34:51,529 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:34:51,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:34:51,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:51,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:51,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:51,547 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,563 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:34:51,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,565 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:34:51,566 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:34:51,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:34:51,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,577 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:51,577 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:51,615 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:51,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,633 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:34:51,634 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:34:51,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:34:51,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:51,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:51,644 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:51,658 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,675 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:34:51,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,677 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:34:51,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:34:51,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,692 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:51,692 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:51,695 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:34:51,711 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,732 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:34:51,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,734 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:34:51,735 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:34:51,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,746 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:51,746 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:51,762 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,778 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:34:51,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,780 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:34:51,780 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:34:51,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:34:51,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,791 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:51,791 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:51,806 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,831 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:34:51,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,832 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:34:51,833 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:34:51,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:51,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,842 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:51,843 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:51,858 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:51,875 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:34:51,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,877 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:34:51,878 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:34:51,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:34:51,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:51,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:51,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:51,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:51,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:51,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:51,917 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:34:51,955 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-02-21 04:34:51,955 INFO L444 ModelExtractionUtils]: 9 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-02-21 04:34:51,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:51,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:51,958 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:34:51,959 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:34:51,960 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:34:52,000 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:34:52,001 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:34:52,001 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nondetString1~0#1.offset, ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1) = -1*ULTIMATE.start_main_~nondetString1~0#1.offset - 1*ULTIMATE.start_main_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1 Supporting invariants [] [2022-02-21 04:34:52,038 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:34:52,061 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 04:34:52,065 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet16#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;" "main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1;" [2022-02-21 04:34:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:52,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:52,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:34:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:52,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:52,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {31#unseeded} is VALID [2022-02-21 04:34:52,176 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:34:52,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {31#unseeded} is VALID [2022-02-21 04:34:52,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#unseeded} assume !(main_~length1~0#1 < 1); {31#unseeded} is VALID [2022-02-21 04:34:52,178 INFO L290 TraceCheckUtils]: 3: Hoare triple {31#unseeded} assume !(main_~length2~0#1 < 1); {31#unseeded} is VALID [2022-02-21 04:34:52,178 INFO L290 TraceCheckUtils]: 4: Hoare triple {31#unseeded} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {31#unseeded} is VALID [2022-02-21 04:34:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:52,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:34:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:52,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:52,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (* (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|)))} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet16#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; {91#(and (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~i~0#1| 1) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (* (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))))} is VALID [2022-02-21 04:34:52,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {91#(and (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~i~0#1| 1) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (* (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {74#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (* (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|)))))} is VALID [2022-02-21 04:34:52,220 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:34:52,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:34:52,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:34:52,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,253 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:34:52,254 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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 has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,358 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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 has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 51 states and 73 transitions. Complement of second has 7 states. [2022-02-21 04:34:52,359 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:34:52,359 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:34:52,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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:34:52,361 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2022-02-21 04:34:52,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:52,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:52,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,365 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:34:52,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:52,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:52,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 73 transitions. [2022-02-21 04:34:52,367 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 04:34:52,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:52,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:52,370 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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:34:52,371 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2022-02-21 04:34:52,372 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 04:34:52,373 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,374 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:34:52,375 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:34:52,375 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 51 states and 73 transitions. cyclomatic complexity: 29 [2022-02-21 04:34:52,375 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 04:34:52,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:34:52,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:34:52,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:34:52,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:52,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:52,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:52,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:52,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:52,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:52,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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) Stem has 51 letters. Loop has 51 letters. [2022-02-21 04:34:52,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 51 letters. [2022-02-21 04:34:52,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 51 letters. Loop has 51 letters. [2022-02-21 04:34:52,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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) Stem has 21 letters. Loop has 21 letters. [2022-02-21 04:34:52,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 21 letters. [2022-02-21 04:34:52,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 21 letters. Loop has 21 letters. [2022-02-21 04:34:52,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:34:52,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:34:52,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:34:52,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:34:52,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:34:52,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:34:52,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:34:52,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:34:52,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:34:52,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:52,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:52,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:52,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:52,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:52,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:52,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:52,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:52,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:52,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:34:52,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:34:52,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:34:52,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:34:52,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:34:52,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:34:52,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:34:52,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:34:52,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:34:52,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:52,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:52,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:52,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:52,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:52,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:52,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:34:52,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:34:52,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:34:52,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:34:52,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:34:52,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:34:52,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:52,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:52,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:52,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 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) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:52,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:52,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:52,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,410 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:34:52,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:52,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-02-21 04:34:52,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 49 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:34:52,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 49 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:52,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 49 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 04:34:52,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:52,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 73 transitions. cyclomatic complexity: 29 [2022-02-21 04:34:52,419 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 04:34:52,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 15 states and 21 transitions. [2022-02-21 04:34:52,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 04:34:52,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-02-21 04:34:52,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2022-02-21 04:34:52,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:34:52,424 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2022-02-21 04:34:52,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2022-02-21 04:34:52,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-21 04:34:52,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:34:52,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 21 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 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:34:52,444 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 21 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 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:34:52,446 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 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:34:52,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:52,449 INFO L93 Difference]: Finished difference Result 15 states and 21 transitions. [2022-02-21 04:34:52,449 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 21 transitions. [2022-02-21 04:34:52,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:52,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:52,450 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 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 15 states and 21 transitions. [2022-02-21 04:34:52,450 INFO L87 Difference]: Start difference. First operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 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 15 states and 21 transitions. [2022-02-21 04:34:52,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:52,451 INFO L93 Difference]: Finished difference Result 15 states and 21 transitions. [2022-02-21 04:34:52,451 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 21 transitions. [2022-02-21 04:34:52,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:52,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:52,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:34:52,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:34:52,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 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:34:52,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2022-02-21 04:34:52,453 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2022-02-21 04:34:52,453 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2022-02-21 04:34:52,453 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:34:52,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2022-02-21 04:34:52,454 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 04:34:52,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:52,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:52,454 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:34:52,454 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:34:52,455 INFO L791 eck$LassoCheckResult]: Stem: 156#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 157#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 167#L528 assume !(main_~length1~0#1 < 1); 163#L528-2 assume !(main_~length2~0#1 < 1); 164#L531-1 call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; 160#L537-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 158#L537-4 main_~i~1#1 := 0; 159#L542-3 [2022-02-21 04:34:52,455 INFO L793 eck$LassoCheckResult]: Loop: 159#L542-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet18#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet18#1; 168#L542-2 main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 159#L542-3 [2022-02-21 04:34:52,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:52,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2022-02-21 04:34:52,455 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:52,456 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482199461] [2022-02-21 04:34:52,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:52,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:52,470 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:52,479 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:52,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:52,480 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2022-02-21 04:34:52,480 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:52,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503104734] [2022-02-21 04:34:52,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:52,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:52,488 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:52,493 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:52,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:52,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2022-02-21 04:34:52,493 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:52,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559949122] [2022-02-21 04:34:52,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:52,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:52,510 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:52,522 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:52,742 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:34:52,742 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:34:52,742 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:34:52,742 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:34:52,742 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:34:52,742 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:52,742 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:34:52,743 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:34:52,743 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcmp-alloca-2.i_Iteration2_Lasso [2022-02-21 04:34:52,743 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:34:52,743 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:34:52,745 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:34:52,747 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:34:52,749 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:34:52,751 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:34:52,754 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:34:52,756 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:34:52,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:52,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:52,942 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:34:52,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:34:52,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:34:52,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:34:52,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:34:52,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:53,241 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:34:53,241 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:34:53,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:53,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:53,256 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:34:53,257 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:34:53,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:34:53,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:53,266 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:53,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:53,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:53,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:53,267 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:53,267 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:53,279 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:53,298 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:34:53,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:53,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:53,300 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:34:53,301 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:34:53,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:34:53,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:53,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:53,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:53,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:53,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:53,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:53,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:53,325 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:53,342 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:34:53,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:53,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:53,343 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:34:53,345 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:34:53,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:34:53,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:53,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:53,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:53,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:53,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:53,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:53,368 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:53,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:53,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:53,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:53,392 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:34:53,393 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:34:53,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:34:53,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:53,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:53,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:53,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:53,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:53,402 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:53,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:53,412 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:53,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-02-21 04:34:53,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:53,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:53,429 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:34:53,430 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:34:53,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:53,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:53,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:53,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:53,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:53,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:53,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:53,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:53,440 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:53,459 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:34:53,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:53,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:53,460 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:34:53,461 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:34:53,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:34:53,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:53,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:53,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:53,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:53,470 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:53,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:53,481 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:53,501 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:34:53,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:53,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:53,502 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:34:53,503 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:34:53,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:53,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:53,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:53,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:53,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:53,514 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:53,514 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:53,524 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:53,539 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:34:53,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:53,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:53,541 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:34:53,542 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:34:53,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:53,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:53,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:53,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:53,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:53,556 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:53,556 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:53,575 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:34:53,588 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-02-21 04:34:53,589 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-02-21 04:34:53,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:53,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:53,590 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:34:53,591 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:34:53,592 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:34:53,607 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:34:53,608 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:34:53,608 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~length2~0#1) = -1*ULTIMATE.start_main_~i~1#1 + 1*ULTIMATE.start_main_~length2~0#1 Supporting invariants [] [2022-02-21 04:34:53,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-02-21 04:34:53,653 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 04:34:53,656 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet18#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet18#1;" "main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" [2022-02-21 04:34:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:53,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:53,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:34:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:53,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:53,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {210#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {210#unseeded} is VALID [2022-02-21 04:34:53,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {210#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {210#unseeded} is VALID [2022-02-21 04:34:53,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {210#unseeded} assume !(main_~length1~0#1 < 1); {210#unseeded} is VALID [2022-02-21 04:34:53,709 INFO L290 TraceCheckUtils]: 3: Hoare triple {210#unseeded} assume !(main_~length2~0#1 < 1); {210#unseeded} is VALID [2022-02-21 04:34:53,710 INFO L290 TraceCheckUtils]: 4: Hoare triple {210#unseeded} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {210#unseeded} is VALID [2022-02-21 04:34:53,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {210#unseeded} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {210#unseeded} is VALID [2022-02-21 04:34:53,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {210#unseeded} main_~i~1#1 := 0; {210#unseeded} is VALID [2022-02-21 04:34:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:53,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:34:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:53,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:53,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {213#(>= oldRank0 (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|)))} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet18#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet18#1; {276#(and (< (+ |ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~length2~0#1|) (>= oldRank0 (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|))))} is VALID [2022-02-21 04:34:53,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {276#(and (< (+ |ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~length2~0#1|) (>= oldRank0 (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|))))} main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {253#(or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|)))) unseeded)} is VALID [2022-02-21 04:34:53,747 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:34:53,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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:34:53,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:34:53,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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:34:53,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,755 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:34:53,756 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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:34:53,800 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 32 transitions. Complement of second has 6 states. [2022-02-21 04:34:53,800 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:34:53,800 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:34:53,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. cyclomatic complexity: 9 [2022-02-21 04:34:53,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:53,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:53,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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:34:53,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:34:53,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:53,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:53,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 32 transitions. [2022-02-21 04:34:53,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:34:53,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:53,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:53,803 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 21 transitions. cyclomatic complexity: 9 [2022-02-21 04:34:53,803 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 04:34:53,804 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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:34:53,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:34:53,804 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:34:53,804 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 32 transitions. cyclomatic complexity: 15 [2022-02-21 04:34:53,805 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 04:34:53,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:53,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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:34:53,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:53,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:53,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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:34:53,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:53,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:53,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:53,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:53,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 21 letters. [2022-02-21 04:34:53,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 21 letters. [2022-02-21 04:34:53,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 15 Stem has 21 letters. Loop has 21 letters. [2022-02-21 04:34:53,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 15 letters. [2022-02-21 04:34:53,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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 15 letters. [2022-02-21 04:34:53,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 15 letters. [2022-02-21 04:34:53,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:34:53,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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:34:53,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:34:53,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:34:53,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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:34:53,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:34:53,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:34:53,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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:34:53,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:34:53,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:53,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:53,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:53,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:53,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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:34:53,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:53,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:53,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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:34:53,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:53,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:53,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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:34:53,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:53,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:53,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:53,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:53,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:34:53,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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:34:53,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:34:53,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:34:53,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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:34:53,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:34:53,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,828 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:34:53,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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:34:53,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-02-21 04:34:53,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:53,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:34:53,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:34:53,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:53,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 32 transitions. cyclomatic complexity: 15 [2022-02-21 04:34:53,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:34:53,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 23 transitions. [2022-02-21 04:34:53,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 04:34:53,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 04:34:53,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 23 transitions. [2022-02-21 04:34:53,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:34:53,831 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2022-02-21 04:34:53,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 23 transitions. [2022-02-21 04:34:53,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-21 04:34:53,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:34:53,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 23 transitions. Second operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 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:34:53,832 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 23 transitions. Second operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 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:34:53,832 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. Second operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 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:34:53,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:53,832 INFO L93 Difference]: Finished difference Result 16 states and 23 transitions. [2022-02-21 04:34:53,832 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 23 transitions. [2022-02-21 04:34:53,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:53,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:53,833 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 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 16 states and 23 transitions. [2022-02-21 04:34:53,833 INFO L87 Difference]: Start difference. First operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 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 16 states and 23 transitions. [2022-02-21 04:34:53,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:53,833 INFO L93 Difference]: Finished difference Result 16 states and 23 transitions. [2022-02-21 04:34:53,833 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 23 transitions. [2022-02-21 04:34:53,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:53,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:53,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:34:53,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:34:53,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 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:34:53,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2022-02-21 04:34:53,834 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2022-02-21 04:34:53,834 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2022-02-21 04:34:53,834 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:34:53,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2022-02-21 04:34:53,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:34:53,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:53,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:53,835 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:34:53,835 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:34:53,835 INFO L791 eck$LassoCheckResult]: Stem: 310#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 311#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 321#L528 assume !(main_~length1~0#1 < 1); 317#L528-2 assume !(main_~length2~0#1 < 1); 318#L531-1 call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; 314#L537-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 312#L537-4 main_~i~1#1 := 0; 313#L542-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 324#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_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset, cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcmp_#res#1;havoc cstrcmp_#t~post6#1.base, cstrcmp_#t~post6#1.offset, cstrcmp_#t~post7#1.base, cstrcmp_#t~post7#1.offset, cstrcmp_#t~mem2#1, cstrcmp_#t~mem3#1, cstrcmp_#t~mem4#1, cstrcmp_#t~short5#1, cstrcmp_#t~mem8#1, cstrcmp_#t~mem9#1, cstrcmp_#t~ite10#1, cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset, cstrcmp_~uc1~0#1, cstrcmp_~uc2~0#1;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset;havoc cstrcmp_~uc1~0#1;havoc cstrcmp_~uc2~0#1; 325#L517-5 [2022-02-21 04:34:53,835 INFO L793 eck$LassoCheckResult]: Loop: 325#L517-5 call cstrcmp_#t~mem2#1 := read~int(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);cstrcmp_#t~short5#1 := 0 != cstrcmp_#t~mem2#1; 319#L517-1 assume cstrcmp_#t~short5#1;call cstrcmp_#t~mem3#1 := read~int(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);call cstrcmp_#t~mem4#1 := read~int(cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset, 1);cstrcmp_#t~short5#1 := cstrcmp_#t~mem3#1 == cstrcmp_#t~mem4#1; 320#L517-3 assume !!cstrcmp_#t~short5#1;havoc cstrcmp_#t~mem2#1;havoc cstrcmp_#t~mem3#1;havoc cstrcmp_#t~mem4#1;havoc cstrcmp_#t~short5#1;cstrcmp_#t~post6#1.base, cstrcmp_#t~post6#1.offset := cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#t~post6#1.base, 1 + cstrcmp_#t~post6#1.offset;havoc cstrcmp_#t~post6#1.base, cstrcmp_#t~post6#1.offset;cstrcmp_#t~post7#1.base, cstrcmp_#t~post7#1.offset := cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#t~post7#1.base, 1 + cstrcmp_#t~post7#1.offset;havoc cstrcmp_#t~post7#1.base, cstrcmp_#t~post7#1.offset; 325#L517-5 [2022-02-21 04:34:53,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:53,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2022-02-21 04:34:53,835 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:53,836 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533270480] [2022-02-21 04:34:53,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:53,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:53,858 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:53,871 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:53,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:53,871 INFO L85 PathProgramCache]: Analyzing trace with hash 77559, now seen corresponding path program 1 times [2022-02-21 04:34:53,872 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:53,872 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315434557] [2022-02-21 04:34:53,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:53,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:53,879 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:34:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:53,890 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:53,895 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:53,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:53,899 INFO L85 PathProgramCache]: Analyzing trace with hash -296047742, now seen corresponding path program 1 times [2022-02-21 04:34:53,899 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:53,899 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054802969] [2022-02-21 04:34:53,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:53,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:54,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {365#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {365#true} is VALID [2022-02-21 04:34:54,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {365#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {365#true} is VALID [2022-02-21 04:34:54,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {365#true} assume !(main_~length1~0#1 < 1); {367#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:34:54,033 INFO L290 TraceCheckUtils]: 3: Hoare triple {367#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} assume !(main_~length2~0#1 < 1); {367#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:34:54,034 INFO L290 TraceCheckUtils]: 4: Hoare triple {367#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {368#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)))} is VALID [2022-02-21 04:34:54,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {368#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {369#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:34:54,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {369#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} main_~i~1#1 := 0; {369#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:34:54,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {369#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {369#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:34:54,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {369#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset, cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcmp_#res#1;havoc cstrcmp_#t~post6#1.base, cstrcmp_#t~post6#1.offset, cstrcmp_#t~post7#1.base, cstrcmp_#t~post7#1.offset, cstrcmp_#t~mem2#1, cstrcmp_#t~mem3#1, cstrcmp_#t~mem4#1, cstrcmp_#t~short5#1, cstrcmp_#t~mem8#1, cstrcmp_#t~mem9#1, cstrcmp_#t~ite10#1, cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset, cstrcmp_~uc1~0#1, cstrcmp_~uc2~0#1;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset;havoc cstrcmp_~uc1~0#1;havoc cstrcmp_~uc2~0#1; {370#(= (select (select |#memory_int| |ULTIMATE.start_cstrcmp_~s1#1.base|) |ULTIMATE.start_cstrcmp_~s1#1.offset|) 0)} is VALID [2022-02-21 04:34:54,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {370#(= (select (select |#memory_int| |ULTIMATE.start_cstrcmp_~s1#1.base|) |ULTIMATE.start_cstrcmp_~s1#1.offset|) 0)} call cstrcmp_#t~mem2#1 := read~int(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);cstrcmp_#t~short5#1 := 0 != cstrcmp_#t~mem2#1; {371#(not |ULTIMATE.start_cstrcmp_#t~short5#1|)} is VALID [2022-02-21 04:34:54,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {371#(not |ULTIMATE.start_cstrcmp_#t~short5#1|)} assume cstrcmp_#t~short5#1;call cstrcmp_#t~mem3#1 := read~int(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);call cstrcmp_#t~mem4#1 := read~int(cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset, 1);cstrcmp_#t~short5#1 := cstrcmp_#t~mem3#1 == cstrcmp_#t~mem4#1; {366#false} is VALID [2022-02-21 04:34:54,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {366#false} assume !!cstrcmp_#t~short5#1;havoc cstrcmp_#t~mem2#1;havoc cstrcmp_#t~mem3#1;havoc cstrcmp_#t~mem4#1;havoc cstrcmp_#t~short5#1;cstrcmp_#t~post6#1.base, cstrcmp_#t~post6#1.offset := cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#t~post6#1.base, 1 + cstrcmp_#t~post6#1.offset;havoc cstrcmp_#t~post6#1.base, cstrcmp_#t~post6#1.offset;cstrcmp_#t~post7#1.base, cstrcmp_#t~post7#1.offset := cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#t~post7#1.base, 1 + cstrcmp_#t~post7#1.offset;havoc cstrcmp_#t~post7#1.base, cstrcmp_#t~post7#1.offset; {366#false} is VALID [2022-02-21 04:34:54,038 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:34:54,039 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:34:54,039 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054802969] [2022-02-21 04:34:54,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054802969] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:34:54,040 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:34:54,040 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-21 04:34:54,040 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693627717] [2022-02-21 04:34:54,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:34:54,165 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:34:54,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 04:34:54,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-21 04:34:54,168 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. cyclomatic complexity: 10 Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:54,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:54,309 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-02-21 04:34:54,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 04:34:54,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:54,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:34:54,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2022-02-21 04:34:54,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:34:54,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 17 states and 22 transitions. [2022-02-21 04:34:54,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 04:34:54,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 04:34:54,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2022-02-21 04:34:54,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:34:54,326 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2022-02-21 04:34:54,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2022-02-21 04:34:54,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-02-21 04:34:54,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:34:54,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 22 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 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:34:54,327 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 22 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 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:34:54,327 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 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:34:54,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:54,330 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2022-02-21 04:34:54,330 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2022-02-21 04:34:54,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:54,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:54,330 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 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 17 states and 22 transitions. [2022-02-21 04:34:54,330 INFO L87 Difference]: Start difference. First operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 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 17 states and 22 transitions. [2022-02-21 04:34:54,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:54,331 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2022-02-21 04:34:54,331 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2022-02-21 04:34:54,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:54,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:54,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:34:54,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:34:54,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 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:34:54,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2022-02-21 04:34:54,331 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2022-02-21 04:34:54,331 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2022-02-21 04:34:54,331 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:34:54,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2022-02-21 04:34:54,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:34:54,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:54,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:54,332 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:34:54,332 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:34:54,332 INFO L791 eck$LassoCheckResult]: Stem: 404#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 405#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 415#L528 assume !(main_~length1~0#1 < 1); 411#L528-2 assume !(main_~length2~0#1 < 1); 412#L531-1 call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; 408#L537-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet16#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; 409#L537-2 main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; 410#L537-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 406#L537-4 main_~i~1#1 := 0; 407#L542-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 418#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_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset, cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcmp_#res#1;havoc cstrcmp_#t~post6#1.base, cstrcmp_#t~post6#1.offset, cstrcmp_#t~post7#1.base, cstrcmp_#t~post7#1.offset, cstrcmp_#t~mem2#1, cstrcmp_#t~mem3#1, cstrcmp_#t~mem4#1, cstrcmp_#t~short5#1, cstrcmp_#t~mem8#1, cstrcmp_#t~mem9#1, cstrcmp_#t~ite10#1, cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset, cstrcmp_~uc1~0#1, cstrcmp_~uc2~0#1;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset;havoc cstrcmp_~uc1~0#1;havoc cstrcmp_~uc2~0#1; 419#L517-5 [2022-02-21 04:34:54,333 INFO L793 eck$LassoCheckResult]: Loop: 419#L517-5 call cstrcmp_#t~mem2#1 := read~int(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);cstrcmp_#t~short5#1 := 0 != cstrcmp_#t~mem2#1; 413#L517-1 assume cstrcmp_#t~short5#1;call cstrcmp_#t~mem3#1 := read~int(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);call cstrcmp_#t~mem4#1 := read~int(cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset, 1);cstrcmp_#t~short5#1 := cstrcmp_#t~mem3#1 == cstrcmp_#t~mem4#1; 414#L517-3 assume !!cstrcmp_#t~short5#1;havoc cstrcmp_#t~mem2#1;havoc cstrcmp_#t~mem3#1;havoc cstrcmp_#t~mem4#1;havoc cstrcmp_#t~short5#1;cstrcmp_#t~post6#1.base, cstrcmp_#t~post6#1.offset := cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#t~post6#1.base, 1 + cstrcmp_#t~post6#1.offset;havoc cstrcmp_#t~post6#1.base, cstrcmp_#t~post6#1.offset;cstrcmp_#t~post7#1.base, cstrcmp_#t~post7#1.offset := cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#t~post7#1.base, 1 + cstrcmp_#t~post7#1.offset;havoc cstrcmp_#t~post7#1.base, cstrcmp_#t~post7#1.offset; 419#L517-5 [2022-02-21 04:34:54,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:54,333 INFO L85 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2022-02-21 04:34:54,333 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:54,334 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479081879] [2022-02-21 04:34:54,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:54,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:54,351 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:54,361 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:54,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:54,362 INFO L85 PathProgramCache]: Analyzing trace with hash 77559, now seen corresponding path program 2 times [2022-02-21 04:34:54,362 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:54,362 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094891619] [2022-02-21 04:34:54,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:54,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:54,375 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:54,379 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:54,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:54,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1311502304, now seen corresponding path program 1 times [2022-02-21 04:34:54,379 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:54,379 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338355236] [2022-02-21 04:34:54,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:54,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:54,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {461#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {461#true} is VALID [2022-02-21 04:34:54,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {461#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {461#true} is VALID [2022-02-21 04:34:54,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {461#true} assume !(main_~length1~0#1 < 1); {461#true} is VALID [2022-02-21 04:34:54,539 INFO L290 TraceCheckUtils]: 3: Hoare triple {461#true} assume !(main_~length2~0#1 < 1); {463#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} is VALID [2022-02-21 04:34:54,540 INFO L290 TraceCheckUtils]: 4: Hoare triple {463#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {464#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)))} is VALID [2022-02-21 04:34:54,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {464#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)))} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet16#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; {464#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)))} is VALID [2022-02-21 04:34:54,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {464#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {464#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)))} is VALID [2022-02-21 04:34:54,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {464#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {464#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)))} is VALID [2022-02-21 04:34:54,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {464#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)))} main_~i~1#1 := 0; {465#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (or (and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)))} is VALID [2022-02-21 04:34:54,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {465#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (or (and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {466#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~length2~0#1| 1) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:34:54,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {466#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~length2~0#1| 1) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset, cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcmp_#res#1;havoc cstrcmp_#t~post6#1.base, cstrcmp_#t~post6#1.offset, cstrcmp_#t~post7#1.base, cstrcmp_#t~post7#1.offset, cstrcmp_#t~mem2#1, cstrcmp_#t~mem3#1, cstrcmp_#t~mem4#1, cstrcmp_#t~short5#1, cstrcmp_#t~mem8#1, cstrcmp_#t~mem9#1, cstrcmp_#t~ite10#1, cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset, cstrcmp_~uc1~0#1, cstrcmp_~uc2~0#1;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset;havoc cstrcmp_~uc1~0#1;havoc cstrcmp_~uc2~0#1; {467#(= (select (select |#memory_int| |ULTIMATE.start_cstrcmp_~s2#1.base|) |ULTIMATE.start_cstrcmp_~s2#1.offset|) 0)} is VALID [2022-02-21 04:34:54,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {467#(= (select (select |#memory_int| |ULTIMATE.start_cstrcmp_~s2#1.base|) |ULTIMATE.start_cstrcmp_~s2#1.offset|) 0)} call cstrcmp_#t~mem2#1 := read~int(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);cstrcmp_#t~short5#1 := 0 != cstrcmp_#t~mem2#1; {468#(or (not |ULTIMATE.start_cstrcmp_#t~short5#1|) (not (= (select (select |#memory_int| |ULTIMATE.start_cstrcmp_~s1#1.base|) |ULTIMATE.start_cstrcmp_~s1#1.offset|) (select (select |#memory_int| |ULTIMATE.start_cstrcmp_~s2#1.base|) |ULTIMATE.start_cstrcmp_~s2#1.offset|))))} is VALID [2022-02-21 04:34:54,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {468#(or (not |ULTIMATE.start_cstrcmp_#t~short5#1|) (not (= (select (select |#memory_int| |ULTIMATE.start_cstrcmp_~s1#1.base|) |ULTIMATE.start_cstrcmp_~s1#1.offset|) (select (select |#memory_int| |ULTIMATE.start_cstrcmp_~s2#1.base|) |ULTIMATE.start_cstrcmp_~s2#1.offset|))))} assume cstrcmp_#t~short5#1;call cstrcmp_#t~mem3#1 := read~int(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);call cstrcmp_#t~mem4#1 := read~int(cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset, 1);cstrcmp_#t~short5#1 := cstrcmp_#t~mem3#1 == cstrcmp_#t~mem4#1; {469#(not |ULTIMATE.start_cstrcmp_#t~short5#1|)} is VALID [2022-02-21 04:34:54,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {469#(not |ULTIMATE.start_cstrcmp_#t~short5#1|)} assume !!cstrcmp_#t~short5#1;havoc cstrcmp_#t~mem2#1;havoc cstrcmp_#t~mem3#1;havoc cstrcmp_#t~mem4#1;havoc cstrcmp_#t~short5#1;cstrcmp_#t~post6#1.base, cstrcmp_#t~post6#1.offset := cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#t~post6#1.base, 1 + cstrcmp_#t~post6#1.offset;havoc cstrcmp_#t~post6#1.base, cstrcmp_#t~post6#1.offset;cstrcmp_#t~post7#1.base, cstrcmp_#t~post7#1.offset := cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#t~post7#1.base, 1 + cstrcmp_#t~post7#1.offset;havoc cstrcmp_#t~post7#1.base, cstrcmp_#t~post7#1.offset; {462#false} is VALID [2022-02-21 04:34:54,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:34:54,546 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:34:54,546 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338355236] [2022-02-21 04:34:54,546 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338355236] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:34:54,546 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:34:54,546 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-21 04:34:54,546 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822652174] [2022-02-21 04:34:54,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:34:54,672 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:34:54,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 04:34:54,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-02-21 04:34:54,672 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 9 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:34:54,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:54,829 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-02-21 04:34:54,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 04:34:54,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.75) internal successors, (14), 9 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:34:54,840 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:34:54,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. [2022-02-21 04:34:54,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:34:54,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 21 transitions. [2022-02-21 04:34:54,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 04:34:54,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 04:34:54,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2022-02-21 04:34:54,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:34:54,842 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-02-21 04:34:54,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2022-02-21 04:34:54,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-02-21 04:34:54,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:34:54,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 21 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:54,843 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 21 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:54,843 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:54,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:54,844 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-02-21 04:34:54,844 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-02-21 04:34:54,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:54,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:54,844 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states and 21 transitions. [2022-02-21 04:34:54,844 INFO L87 Difference]: Start difference. First operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states and 21 transitions. [2022-02-21 04:34:54,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:54,844 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-02-21 04:34:54,845 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-02-21 04:34:54,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:54,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:54,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:34:54,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:34:54,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:54,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2022-02-21 04:34:54,845 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-02-21 04:34:54,845 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-02-21 04:34:54,845 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:34:54,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2022-02-21 04:34:54,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:34:54,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:54,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:54,846 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:34:54,846 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:34:54,846 INFO L791 eck$LassoCheckResult]: Stem: 497#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 498#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 508#L528 assume !(main_~length1~0#1 < 1); 504#L528-2 assume !(main_~length2~0#1 < 1); 505#L531-1 call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; 501#L537-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet16#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; 502#L537-2 main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; 503#L537-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 499#L537-4 main_~i~1#1 := 0; 500#L542-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet18#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet18#1; 509#L542-2 main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 510#L542-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 511#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_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset, cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcmp_#res#1;havoc cstrcmp_#t~post6#1.base, cstrcmp_#t~post6#1.offset, cstrcmp_#t~post7#1.base, cstrcmp_#t~post7#1.offset, cstrcmp_#t~mem2#1, cstrcmp_#t~mem3#1, cstrcmp_#t~mem4#1, cstrcmp_#t~short5#1, cstrcmp_#t~mem8#1, cstrcmp_#t~mem9#1, cstrcmp_#t~ite10#1, cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset, cstrcmp_~uc1~0#1, cstrcmp_~uc2~0#1;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset;havoc cstrcmp_~uc1~0#1;havoc cstrcmp_~uc2~0#1; 512#L517-5 [2022-02-21 04:34:54,846 INFO L793 eck$LassoCheckResult]: Loop: 512#L517-5 call cstrcmp_#t~mem2#1 := read~int(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);cstrcmp_#t~short5#1 := 0 != cstrcmp_#t~mem2#1; 506#L517-1 assume cstrcmp_#t~short5#1;call cstrcmp_#t~mem3#1 := read~int(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);call cstrcmp_#t~mem4#1 := read~int(cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset, 1);cstrcmp_#t~short5#1 := cstrcmp_#t~mem3#1 == cstrcmp_#t~mem4#1; 507#L517-3 assume !!cstrcmp_#t~short5#1;havoc cstrcmp_#t~mem2#1;havoc cstrcmp_#t~mem3#1;havoc cstrcmp_#t~mem4#1;havoc cstrcmp_#t~short5#1;cstrcmp_#t~post6#1.base, cstrcmp_#t~post6#1.offset := cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#t~post6#1.base, 1 + cstrcmp_#t~post6#1.offset;havoc cstrcmp_#t~post6#1.base, cstrcmp_#t~post6#1.offset;cstrcmp_#t~post7#1.base, cstrcmp_#t~post7#1.offset := cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#t~post7#1.base, 1 + cstrcmp_#t~post7#1.offset;havoc cstrcmp_#t~post7#1.base, cstrcmp_#t~post7#1.offset; 512#L517-5 [2022-02-21 04:34:54,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:54,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2022-02-21 04:34:54,846 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:54,846 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105813073] [2022-02-21 04:34:54,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:54,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:54,866 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:54,886 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:54,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:54,886 INFO L85 PathProgramCache]: Analyzing trace with hash 77559, now seen corresponding path program 3 times [2022-02-21 04:34:54,886 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:54,886 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794592060] [2022-02-21 04:34:54,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:54,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:54,895 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:54,898 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:54,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:54,898 INFO L85 PathProgramCache]: Analyzing trace with hash -718433154, now seen corresponding path program 1 times [2022-02-21 04:34:54,898 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:54,898 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75694393] [2022-02-21 04:34:54,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:54,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:54,924 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:54,942 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:55,822 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:34:55,822 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:34:55,822 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:34:55,822 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:34:55,822 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:34:55,822 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:55,822 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:34:55,822 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:34:55,822 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcmp-alloca-2.i_Iteration5_Lasso [2022-02-21 04:34:55,822 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:34:55,823 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:34:55,825 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:34:55,831 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:34:55,833 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:34:55,835 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:34:55,837 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:34:55,838 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:34:56,512 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 04:34:56,514 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 04:34:56,525 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:34:56,527 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:34:56,529 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:34:56,531 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:34:56,533 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:34:56,535 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:34:56,536 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:34:56,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:34:56,541 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:34:56,543 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:34:56,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:34:56,546 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:34:56,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:34:56,550 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:34:56,552 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:34:56,554 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:34:56,555 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:34:56,558 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:34:56,559 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:34:56,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:56,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:56,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:56,567 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:34:57,216 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:34:57,216 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:34:57,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:57,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:57,217 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:34:57,223 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:34:57,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:34:57,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:57,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:57,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:57,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:57,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:57,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:57,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:57,231 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:57,247 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:34:57,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:57,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:57,249 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:34:57,267 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:34:57,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:34:57,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:57,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:57,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:57,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:57,287 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:57,287 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:57,302 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:57,333 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:34:57,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:57,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:57,335 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:34:57,336 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:34:57,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:34:57,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:57,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:57,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:57,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:57,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:57,344 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:57,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:57,355 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:57,379 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:34:57,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:57,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:57,380 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:34:57,396 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:34:57,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:34:57,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:57,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:57,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:57,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:57,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:57,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:57,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:57,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:57,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-02-21 04:34:57,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:57,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:57,439 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:34:57,440 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:34:57,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:34:57,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:57,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:57,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:57,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:57,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:57,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:57,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:57,449 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:57,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-02-21 04:34:57,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:57,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:57,470 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:34:57,471 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:34:57,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:34:57,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:57,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:57,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:57,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:57,502 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:57,503 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:57,522 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:34:57,571 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2022-02-21 04:34:57,571 INFO L444 ModelExtractionUtils]: 12 out of 52 variables were initially zero. Simplification set additionally 37 variables to zero. [2022-02-21 04:34:57,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:57,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:57,572 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:34:57,574 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:34:57,574 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:34:57,584 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:34:57,584 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:34:57,584 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_2, ULTIMATE.start_cstrcmp_~s1#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_2 - 1*ULTIMATE.start_cstrcmp_~s1#1.offset Supporting invariants [] [2022-02-21 04:34:57,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:57,732 INFO L297 tatePredicateManager]: 25 out of 26 supporting invariants were superfluous and have been removed [2022-02-21 04:34:57,737 INFO L390 LassoCheck]: Loop: "call cstrcmp_#t~mem2#1 := read~int(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);cstrcmp_#t~short5#1 := 0 != cstrcmp_#t~mem2#1;" "assume cstrcmp_#t~short5#1;call cstrcmp_#t~mem3#1 := read~int(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);call cstrcmp_#t~mem4#1 := read~int(cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset, 1);cstrcmp_#t~short5#1 := cstrcmp_#t~mem3#1 == cstrcmp_#t~mem4#1;" "assume !!cstrcmp_#t~short5#1;havoc cstrcmp_#t~mem2#1;havoc cstrcmp_#t~mem3#1;havoc cstrcmp_#t~mem4#1;havoc cstrcmp_#t~short5#1;cstrcmp_#t~post6#1.base, cstrcmp_#t~post6#1.offset := cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#t~post6#1.base, 1 + cstrcmp_#t~post6#1.offset;havoc cstrcmp_#t~post6#1.base, cstrcmp_#t~post6#1.offset;cstrcmp_#t~post7#1.base, cstrcmp_#t~post7#1.offset := cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#t~post7#1.base, 1 + cstrcmp_#t~post7#1.offset;havoc cstrcmp_#t~post7#1.base, cstrcmp_#t~post7#1.offset;" [2022-02-21 04:34:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:57,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:57,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 04:34:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:57,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:57,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {556#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {556#unseeded} is VALID [2022-02-21 04:34:57,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {556#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet16#1, main_#t~post15#1, main_~i~0#1, main_#t~nondet18#1, main_#t~post17#1, main_~i~1#1, main_#t~ret19#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {556#unseeded} is VALID [2022-02-21 04:34:57,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {556#unseeded} assume !(main_~length1~0#1 < 1); {556#unseeded} is VALID [2022-02-21 04:34:57,814 INFO L290 TraceCheckUtils]: 3: Hoare triple {556#unseeded} assume !(main_~length2~0#1 < 1); {556#unseeded} is VALID [2022-02-21 04:34:57,815 INFO L290 TraceCheckUtils]: 4: Hoare triple {556#unseeded} call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; {556#unseeded} is VALID [2022-02-21 04:34:57,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {556#unseeded} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet16#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; {556#unseeded} is VALID [2022-02-21 04:34:57,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {556#unseeded} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {556#unseeded} is VALID [2022-02-21 04:34:57,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {556#unseeded} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {556#unseeded} is VALID [2022-02-21 04:34:57,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {556#unseeded} main_~i~1#1 := 0; {556#unseeded} is VALID [2022-02-21 04:34:57,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {556#unseeded} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet18#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet18#1; {556#unseeded} is VALID [2022-02-21 04:34:57,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {556#unseeded} main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {556#unseeded} is VALID [2022-02-21 04:34:57,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {556#unseeded} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {556#unseeded} is VALID [2022-02-21 04:34:57,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {556#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_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset, cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcmp_#res#1;havoc cstrcmp_#t~post6#1.base, cstrcmp_#t~post6#1.offset, cstrcmp_#t~post7#1.base, cstrcmp_#t~post7#1.offset, cstrcmp_#t~mem2#1, cstrcmp_#t~mem3#1, cstrcmp_#t~mem4#1, cstrcmp_#t~short5#1, cstrcmp_#t~mem8#1, cstrcmp_#t~mem9#1, cstrcmp_#t~ite10#1, cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset, cstrcmp_~uc1~0#1, cstrcmp_~uc2~0#1;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#in~s1#1.base, cstrcmp_#in~s1#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#in~s2#1.base, cstrcmp_#in~s2#1.offset;havoc cstrcmp_~uc1~0#1;havoc cstrcmp_~uc2~0#1; {700#(and unseeded (= |ULTIMATE.start_cstrcmp_~s1#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))} is VALID [2022-02-21 04:34:57,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:57,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:34:57,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:57,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:57,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {701#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcmp_~s1#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (= |ULTIMATE.start_cstrcmp_~s1#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))} call cstrcmp_#t~mem2#1 := read~int(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);cstrcmp_#t~short5#1 := 0 != cstrcmp_#t~mem2#1; {745#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcmp_~s1#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (<= (+ |ULTIMATE.start_cstrcmp_~s1#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcmp_~s1#1.base|)) (= |ULTIMATE.start_cstrcmp_~s1#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))} is VALID [2022-02-21 04:34:57,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {745#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcmp_~s1#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (<= (+ |ULTIMATE.start_cstrcmp_~s1#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcmp_~s1#1.base|)) (= |ULTIMATE.start_cstrcmp_~s1#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))} assume cstrcmp_#t~short5#1;call cstrcmp_#t~mem3#1 := read~int(cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset, 1);call cstrcmp_#t~mem4#1 := read~int(cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset, 1);cstrcmp_#t~short5#1 := cstrcmp_#t~mem3#1 == cstrcmp_#t~mem4#1; {745#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcmp_~s1#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (<= (+ |ULTIMATE.start_cstrcmp_~s1#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcmp_~s1#1.base|)) (= |ULTIMATE.start_cstrcmp_~s1#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))} is VALID [2022-02-21 04:34:57,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {745#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcmp_~s1#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (<= (+ |ULTIMATE.start_cstrcmp_~s1#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcmp_~s1#1.base|)) (= |ULTIMATE.start_cstrcmp_~s1#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))} assume !!cstrcmp_#t~short5#1;havoc cstrcmp_#t~mem2#1;havoc cstrcmp_#t~mem3#1;havoc cstrcmp_#t~mem4#1;havoc cstrcmp_#t~short5#1;cstrcmp_#t~post6#1.base, cstrcmp_#t~post6#1.offset := cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset;cstrcmp_~s1#1.base, cstrcmp_~s1#1.offset := cstrcmp_#t~post6#1.base, 1 + cstrcmp_#t~post6#1.offset;havoc cstrcmp_#t~post6#1.base, cstrcmp_#t~post6#1.offset;cstrcmp_#t~post7#1.base, cstrcmp_#t~post7#1.offset := cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset;cstrcmp_~s2#1.base, cstrcmp_~s2#1.offset := cstrcmp_#t~post7#1.base, 1 + cstrcmp_#t~post7#1.offset;havoc cstrcmp_#t~post7#1.base, cstrcmp_#t~post7#1.offset; {703#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcmp_~s1#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))))) (= |ULTIMATE.start_cstrcmp_~s1#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))} is VALID [2022-02-21 04:34:57,875 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:34:57,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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:34:57,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:34:57,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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:34:57,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,885 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:34:57,885 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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:34:57,920 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 19 states and 24 transitions. Complement of second has 4 states. [2022-02-21 04:34:57,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 04:34:57,921 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:34:57,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. cyclomatic complexity: 7 [2022-02-21 04:34:57,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:57,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:57,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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:34:57,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:34:57,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:57,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:57,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2022-02-21 04:34:57,922 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:34:57,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:34:57,922 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 20 transitions. cyclomatic complexity: 7 [2022-02-21 04:34:57,923 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 04:34:57,923 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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:34:57,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:34:57,923 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:34:57,923 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 24 transitions. cyclomatic complexity: 8 [2022-02-21 04:34:57,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. cyclomatic complexity: 8 [2022-02-21 04:34:57,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:34:57,924 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:34:57,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:34:57,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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:34:57,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:34:57,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:57,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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:34:57,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:57,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 19 letters. Loop has 19 letters. [2022-02-21 04:34:57,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 19 letters. [2022-02-21 04:34:57,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 19 letters. [2022-02-21 04:34:57,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:34:57,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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 16 letters. [2022-02-21 04:34:57,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:34:57,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:34:57,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:34:57,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:34:57,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:34:57,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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:34:57,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:34:57,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:34:57,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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:34:57,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:34:57,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:34:57,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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:34:57,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:34:57,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:57,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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:34:57,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:57,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,927 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:34:57,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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:34:57,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-02-21 04:34:57,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:34:57,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:34:57,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 13 letters. Loop has 6 letters. [2022-02-21 04:34:57,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:57,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. cyclomatic complexity: 8 [2022-02-21 04:34:57,929 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:34:57,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2022-02-21 04:34:57,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:34:57,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:34:57,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:34:57,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:34:57,930 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:34:57,930 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:34:57,930 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:34:57,930 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 04:34:57,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:34:57,930 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:34:57,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:34:57,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:34:57 BoogieIcfgContainer [2022-02-21 04:34:57,935 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:34:57,935 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:34:57,935 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:34:57,935 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:34:57,936 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:34:49" (3/4) ... [2022-02-21 04:34:57,938 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:34:57,938 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:34:57,938 INFO L158 Benchmark]: Toolchain (without parser) took 8892.05ms. Allocated memory was 100.7MB in the beginning and 188.7MB in the end (delta: 88.1MB). Free memory was 70.9MB in the beginning and 98.9MB in the end (delta: -28.0MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. [2022-02-21 04:34:57,939 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 55.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:34:57,939 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.44ms. Allocated memory is still 100.7MB. Free memory was 70.5MB in the beginning and 68.0MB in the end (delta: 2.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 04:34:57,939 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.87ms. Allocated memory is still 100.7MB. Free memory was 68.0MB in the beginning and 66.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:34:57,939 INFO L158 Benchmark]: Boogie Preprocessor took 22.60ms. Allocated memory is still 100.7MB. Free memory was 65.6MB in the beginning and 64.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:34:57,940 INFO L158 Benchmark]: RCFGBuilder took 449.41ms. Allocated memory was 100.7MB in the beginning and 130.0MB in the end (delta: 29.4MB). Free memory was 64.2MB in the beginning and 106.0MB in the end (delta: -41.8MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2022-02-21 04:34:57,940 INFO L158 Benchmark]: BuchiAutomizer took 7965.56ms. Allocated memory was 130.0MB in the beginning and 188.7MB in the end (delta: 58.7MB). Free memory was 105.8MB in the beginning and 98.9MB in the end (delta: 7.0MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. [2022-02-21 04:34:57,940 INFO L158 Benchmark]: Witness Printer took 2.44ms. Allocated memory is still 188.7MB. Free memory is still 98.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:34:57,941 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.18ms. Allocated memory is still 100.7MB. Free memory is still 55.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 392.44ms. Allocated memory is still 100.7MB. Free memory was 70.5MB in the beginning and 68.0MB in the end (delta: 2.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.87ms. Allocated memory is still 100.7MB. Free memory was 68.0MB in the beginning and 66.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.60ms. Allocated memory is still 100.7MB. Free memory was 65.6MB in the beginning and 64.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 449.41ms. Allocated memory was 100.7MB in the beginning and 130.0MB in the end (delta: 29.4MB). Free memory was 64.2MB in the beginning and 106.0MB in the end (delta: -41.8MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * BuchiAutomizer took 7965.56ms. Allocated memory was 130.0MB in the beginning and 188.7MB in the end (delta: 58.7MB). Free memory was 105.8MB in the beginning and 98.9MB in the end (delta: 7.0MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. * Witness Printer took 2.44ms. Allocated memory is still 188.7MB. Free memory is still 98.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + -1 * nondetString1 + unknown-#length-unknown[nondetString1] and consists of 5 locations. One deterministic module has affine ranking function length2 + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[nondetString1] and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.9s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 6.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 16 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 112 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 112 mSDsluCounter, 180 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 109 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 121 IncrementalHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 71 mSDtfsCounter, 121 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital204 mio100 ax111 hnf100 lsp83 ukn75 mio100 lsp48 div100 bol100 ite100 ukn100 eq176 hnf90 smp97 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 42ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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:34:57,967 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:34:58,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE