./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/subseq-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/subseq-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 332083c9703e7f789c3b57b3574f68dffe1c5555ad9f8a0d56f0eaba0a86f436 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:35:40,405 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:35:40,407 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:35:40,431 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:35:40,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:35:40,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:35:40,434 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:35:40,435 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:35:40,437 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:35:40,438 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:35:40,438 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:35:40,440 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:35:40,440 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:35:40,441 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:35:40,442 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:35:40,443 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:35:40,444 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:35:40,445 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:35:40,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:35:40,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:35:40,455 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:35:40,458 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:35:40,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:35:40,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:35:40,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:35:40,462 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:35:40,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:35:40,463 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:35:40,464 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:35:40,464 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:35:40,465 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:35:40,465 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:35:40,466 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:35:40,467 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:35:40,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:35:40,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:35:40,469 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:35:40,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:35:40,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:35:40,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:35:40,471 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:35:40,472 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:35:40,501 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:35:40,502 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:35:40,504 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:35:40,505 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:35:40,507 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:35:40,507 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:35:40,507 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:35:40,507 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:35:40,507 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:35:40,508 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:35:40,508 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:35:40,508 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:35:40,509 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:35:40,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:35:40,509 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:35:40,509 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:35:40,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:35:40,509 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:35:40,510 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:35:40,510 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:35:40,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:35:40,510 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:35:40,510 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:35:40,510 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:35:40,511 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:35:40,511 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:35:40,511 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:35:40,511 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:35:40,511 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:35:40,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:35:40,512 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:35:40,513 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:35:40,513 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 -> 332083c9703e7f789c3b57b3574f68dffe1c5555ad9f8a0d56f0eaba0a86f436 [2022-02-21 04:35:40,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:35:40,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:35:40,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:35:40,763 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:35:40,763 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:35:40,765 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/subseq-alloca-2.i [2022-02-21 04:35:40,831 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14cfbcf68/ec04418623b04104b81587f4dbffb19d/FLAG4e26ca2c3 [2022-02-21 04:35:41,235 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:35:41,236 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/subseq-alloca-2.i [2022-02-21 04:35:41,249 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14cfbcf68/ec04418623b04104b81587f4dbffb19d/FLAG4e26ca2c3 [2022-02-21 04:35:41,258 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14cfbcf68/ec04418623b04104b81587f4dbffb19d [2022-02-21 04:35:41,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:35:41,261 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:35:41,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:41,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:35:41,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:35:41,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:41" (1/1) ... [2022-02-21 04:35:41,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a69b54a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:41, skipping insertion in model container [2022-02-21 04:35:41,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:41" (1/1) ... [2022-02-21 04:35:41,284 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:35:41,305 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:35:41,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:41,573 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:35:41,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:41,654 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:35:41,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:41 WrapperNode [2022-02-21 04:35:41,655 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:41,656 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:41,656 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:35:41,656 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:35:41,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:41" (1/1) ... [2022-02-21 04:35:41,670 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:41" (1/1) ... [2022-02-21 04:35:41,700 INFO L137 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 91 [2022-02-21 04:35:41,701 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:41,702 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:35:41,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:35:41,702 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:35:41,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:41" (1/1) ... [2022-02-21 04:35:41,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:41" (1/1) ... [2022-02-21 04:35:41,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:41" (1/1) ... [2022-02-21 04:35:41,710 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:41" (1/1) ... [2022-02-21 04:35:41,715 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:41" (1/1) ... [2022-02-21 04:35:41,719 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:41" (1/1) ... [2022-02-21 04:35:41,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:41" (1/1) ... [2022-02-21 04:35:41,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:35:41,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:35:41,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:35:41,724 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:35:41,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:41" (1/1) ... [2022-02-21 04:35:41,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:41,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:41,767 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:41,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 04:35:41,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 04:35:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 04:35:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 04:35:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 04:35:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:35:41,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:35:41,903 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:35:41,904 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:35:42,107 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:35:42,119 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:35:42,119 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-21 04:35:42,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:42 BoogieIcfgContainer [2022-02-21 04:35:42,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:35:42,121 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:35:42,121 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:35:42,126 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:35:42,127 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:42,128 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:35:41" (1/3) ... [2022-02-21 04:35:42,128 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cd80734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:42, skipping insertion in model container [2022-02-21 04:35:42,129 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:42,129 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:41" (2/3) ... [2022-02-21 04:35:42,129 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cd80734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:42, skipping insertion in model container [2022-02-21 04:35:42,129 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:42,129 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:42" (3/3) ... [2022-02-21 04:35:42,131 INFO L388 chiAutomizerObserver]: Analyzing ICFG subseq-alloca-2.i [2022-02-21 04:35:42,170 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:35:42,170 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:35:42,170 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:35:42,171 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:35:42,171 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:35:42,171 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:35:42,171 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:35:42,171 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:35:42,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:42,221 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 04:35:42,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:42,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:42,225 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:35:42,225 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:42,225 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:35:42,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:42,227 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 04:35:42,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:42,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:42,228 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:35:42,228 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:42,232 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 14#L530true assume !(main_~length1~0#1 < 1); 7#L530-2true assume !(main_~length2~0#1 < 1); 16#L533-1true call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 8#L539-3true [2022-02-21 04:35:42,233 INFO L793 eck$LassoCheckResult]: Loop: 8#L539-3true assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; 19#L539-2true main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 8#L539-3true [2022-02-21 04:35:42,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:42,237 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-02-21 04:35:42,243 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:42,243 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294412478] [2022-02-21 04:35:42,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:42,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:42,346 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:42,368 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:42,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:42,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2022-02-21 04:35:42,371 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:42,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197350085] [2022-02-21 04:35:42,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:42,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:42,403 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:42,414 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:42,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:42,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2022-02-21 04:35:42,419 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:42,419 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717610988] [2022-02-21 04:35:42,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:42,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:42,468 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:42,485 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:42,816 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:42,817 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:42,817 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:42,817 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:42,818 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:42,818 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:42,818 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:42,818 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:42,818 INFO L133 ssoRankerPreferences]: Filename of dumped script: subseq-alloca-2.i_Iteration1_Lasso [2022-02-21 04:35:42,818 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:42,819 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:42,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:42,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:42,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:42,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:42,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:42,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:43,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:43,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:43,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:43,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:43,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:43,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:43,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:43,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:43,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:43,415 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:43,418 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:43,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:43,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:43,421 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:43,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 04:35:43,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:43,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:43,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:43,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:43,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:43,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:43,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:43,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:43,450 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:43,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 04:35:43,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:43,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:43,474 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:43,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 04:35:43,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:43,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:43,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:43,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:43,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:43,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:43,486 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:43,501 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:43,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:43,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:43,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:43,532 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:43,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 04:35:43,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:43,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:43,540 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:43,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:43,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:43,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:43,541 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:43,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:43,555 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:43,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:43,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:43,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:43,575 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:43,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 04:35:43,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:43,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:43,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:43,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:43,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:43,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:43,584 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:43,584 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:43,599 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:43,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:43,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:43,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:43,616 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:43,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 04:35:43,618 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:43,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:43,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:43,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:43,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:43,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:43,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:43,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:43,642 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:43,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-02-21 04:35:43,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:43,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:43,661 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:43,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 04:35:43,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:43,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:43,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:43,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:43,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:43,675 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:43,675 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:43,691 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:43,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-02-21 04:35:43,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:43,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:43,728 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:43,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 04:35:43,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:43,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:43,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:43,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:43,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:43,740 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:43,740 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:43,748 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:43,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:43,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:43,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:43,765 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:43,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 04:35:43,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:43,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:43,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:43,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:43,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:43,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:43,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:43,793 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:43,856 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2022-02-21 04:35:43,856 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-02-21 04:35:43,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:43,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:43,875 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:43,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 04:35:43,900 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:43,922 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 04:35:43,922 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:43,923 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_#t~malloc12#1.base)_1) = -1*ULTIMATE.start_main_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12#1.base)_1 Supporting invariants [1*ULTIMATE.start_main_~nondetString1~0#1.offset >= 0] [2022-02-21 04:35:43,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:43,989 INFO L297 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2022-02-21 04:35:43,999 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1;" "main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2022-02-21 04:35:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:44,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:44,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 04:35:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:44,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:44,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {32#unseeded} is VALID [2022-02-21 04:35:44,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {32#unseeded} is VALID [2022-02-21 04:35:44,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#unseeded} assume !(main_~length1~0#1 < 1); {32#unseeded} is VALID [2022-02-21 04:35:44,084 INFO L290 TraceCheckUtils]: 3: Hoare triple {32#unseeded} assume !(main_~length2~0#1 < 1); {32#unseeded} is VALID [2022-02-21 04:35:44,085 INFO L290 TraceCheckUtils]: 4: Hoare triple {32#unseeded} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {82#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded (>= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:44,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 04:35:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:44,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:44,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {83#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|))) (>= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; {103#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|))) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~i~0#1| 1) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (>= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:44,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {103#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|))) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~i~0#1| 1) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (>= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {85#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|))))) (>= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 04:35:44,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:44,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:44,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:44,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:44,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,182 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:35:44,184 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:44,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:44,378 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). 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 76 transitions. Complement of second has 8 states. [2022-02-21 04:35:44,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:44,380 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:44,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:44,386 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 04:35:44,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:44,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:44,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:44,390 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:44,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:44,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:44,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 76 transitions. [2022-02-21 04:35:44,396 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 04:35:44,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:44,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:44,398 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:44,399 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 04:35:44,401 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 04:35:44,401 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:44,409 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:44,409 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:35:44,409 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 51 states and 76 transitions. cyclomatic complexity: 32 [2022-02-21 04:35:44,410 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 04:35:44,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:44,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:44,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 76 transitions. cyclomatic complexity: 32 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:44,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:44,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:44,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 76 transitions. cyclomatic complexity: 32 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:44,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:44,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:44,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 76 transitions. cyclomatic complexity: 32 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:44,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 51 letters. [2022-02-21 04:35:44,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,413 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:35:44,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 76 transitions. cyclomatic complexity: 32 Stem has 51 letters. Loop has 51 letters. [2022-02-21 04:35:44,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 22 letters. [2022-02-21 04:35:44,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 22 letters. [2022-02-21 04:35:44,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 76 transitions. cyclomatic complexity: 32 Stem has 22 letters. Loop has 22 letters. [2022-02-21 04:35:44,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:44,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:44,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 76 transitions. cyclomatic complexity: 32 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:44,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 5 letters. [2022-02-21 04:35:44,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,415 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 5 letters. [2022-02-21 04:35:44,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 76 transitions. cyclomatic complexity: 32 Stem has 11 letters. Loop has 5 letters. [2022-02-21 04:35:44,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 5 letters. [2022-02-21 04:35:44,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 5 letters. [2022-02-21 04:35:44,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 76 transitions. cyclomatic complexity: 32 Stem has 13 letters. Loop has 5 letters. [2022-02-21 04:35:44,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 5 letters. [2022-02-21 04:35:44,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,432 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 5 letters. [2022-02-21 04:35:44,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 76 transitions. cyclomatic complexity: 32 Stem has 10 letters. Loop has 5 letters. [2022-02-21 04:35:44,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 5 letters. [2022-02-21 04:35:44,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 5 letters. [2022-02-21 04:35:44,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 76 transitions. cyclomatic complexity: 32 Stem has 12 letters. Loop has 5 letters. [2022-02-21 04:35:44,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 5 letters. [2022-02-21 04:35:44,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,434 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 5 letters. [2022-02-21 04:35:44,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 76 transitions. cyclomatic complexity: 32 Stem has 9 letters. Loop has 5 letters. [2022-02-21 04:35:44,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:44,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:44,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 76 transitions. cyclomatic complexity: 32 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:44,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:44,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:44,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 76 transitions. cyclomatic complexity: 32 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:44,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:44,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:44,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 76 transitions. cyclomatic complexity: 32 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:44,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:44,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:44,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 76 transitions. cyclomatic complexity: 32 Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:44,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:44,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:44,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 76 transitions. cyclomatic complexity: 32 Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:44,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:44,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:44,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 76 transitions. cyclomatic complexity: 32 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:44,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 5 letters. [2022-02-21 04:35:44,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 5 letters. [2022-02-21 04:35:44,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 76 transitions. cyclomatic complexity: 32 Stem has 13 letters. Loop has 5 letters. [2022-02-21 04:35:44,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 5 letters. [2022-02-21 04:35:44,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,438 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 5 letters. [2022-02-21 04:35:44,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 76 transitions. cyclomatic complexity: 32 Stem has 10 letters. Loop has 5 letters. [2022-02-21 04:35:44,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 5 letters. [2022-02-21 04:35:44,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,439 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 5 letters. [2022-02-21 04:35:44,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 76 transitions. cyclomatic complexity: 32 Stem has 11 letters. Loop has 5 letters. [2022-02-21 04:35:44,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 5 letters. [2022-02-21 04:35:44,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 5 letters. [2022-02-21 04:35:44,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 76 transitions. cyclomatic complexity: 32 Stem has 12 letters. Loop has 5 letters. [2022-02-21 04:35:44,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 5 letters. [2022-02-21 04:35:44,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,440 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 5 letters. [2022-02-21 04:35:44,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 76 transitions. cyclomatic complexity: 32 Stem has 9 letters. Loop has 5 letters. [2022-02-21 04:35:44,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:44,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:44,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 76 transitions. cyclomatic complexity: 32 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:44,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:44,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:44,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 76 transitions. cyclomatic complexity: 32 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:44,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,441 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:44,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:44,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-02-21 04:35:44,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:44,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:44,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 04:35:44,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,450 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 76 transitions. cyclomatic complexity: 32 [2022-02-21 04:35:44,453 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 04:35:44,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 17 states and 24 transitions. [2022-02-21 04:35:44,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 04:35:44,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-02-21 04:35:44,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2022-02-21 04:35:44,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:44,458 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2022-02-21 04:35:44,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2022-02-21 04:35:44,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-21 04:35:44,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:44,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 24 transitions. Second operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:44,477 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 24 transitions. Second operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:44,478 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. Second operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:44,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:44,480 INFO L93 Difference]: Finished difference Result 17 states and 24 transitions. [2022-02-21 04:35:44,481 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. [2022-02-21 04:35:44,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:44,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:44,481 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states and 24 transitions. [2022-02-21 04:35:44,482 INFO L87 Difference]: Start difference. First operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states and 24 transitions. [2022-02-21 04:35:44,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:44,483 INFO L93 Difference]: Finished difference Result 17 states and 24 transitions. [2022-02-21 04:35:44,483 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. [2022-02-21 04:35:44,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:44,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:44,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:44,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:44,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2022-02-21 04:35:44,485 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2022-02-21 04:35:44,485 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2022-02-21 04:35:44,485 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:35:44,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2022-02-21 04:35:44,486 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 04:35:44,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:44,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:44,486 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:44,487 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:44,487 INFO L791 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 174#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 184#L530 assume !(main_~length1~0#1 < 1); 175#L530-2 assume !(main_~length2~0#1 < 1); 176#L533-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 177#L539-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 178#L539-4 main_~i~1#1 := 0; 170#L545-3 [2022-02-21 04:35:44,487 INFO L793 eck$LassoCheckResult]: Loop: 170#L545-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; 172#L545-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 170#L545-3 [2022-02-21 04:35:44,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:44,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2022-02-21 04:35:44,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:44,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463002455] [2022-02-21 04:35:44,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:44,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:44,500 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:44,520 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:44,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:44,521 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2022-02-21 04:35:44,521 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:44,521 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970708168] [2022-02-21 04:35:44,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:44,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:44,531 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:44,535 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:44,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:44,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2022-02-21 04:35:44,535 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:44,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444665936] [2022-02-21 04:35:44,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:44,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:44,559 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:44,571 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:44,796 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:44,796 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:44,796 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:44,796 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:44,796 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:44,796 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:44,796 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:44,796 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:44,796 INFO L133 ssoRankerPreferences]: Filename of dumped script: subseq-alloca-2.i_Iteration2_Lasso [2022-02-21 04:35:44,796 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:44,796 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:44,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:44,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:44,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:44,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:44,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:44,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:44,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:44,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:44,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:44,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:44,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:44,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:44,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:44,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:45,248 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:45,248 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:45,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:45,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:45,252 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:45,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 04:35:45,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:45,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:45,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:45,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:45,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:45,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:45,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:45,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:45,279 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:45,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-02-21 04:35:45,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:45,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:45,296 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:45,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 04:35:45,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:45,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:45,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:45,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:45,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:45,309 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:45,309 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:45,325 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:45,337 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-02-21 04:35:45,337 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-02-21 04:35:45,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:45,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:45,343 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:45,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 04:35:45,346 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:45,362 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 04:35:45,363 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:45,363 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_2) = -1*ULTIMATE.start_main_~i~1#1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_2 Supporting invariants [1*ULTIMATE.start_main_~nondetString2~0#1.offset >= 0] [2022-02-21 04:35:45,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:45,404 INFO L297 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2022-02-21 04:35:45,412 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1;" "main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1;" [2022-02-21 04:35:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:45,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:45,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 04:35:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:45,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:45,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {230#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {230#unseeded} is VALID [2022-02-21 04:35:45,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {230#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {230#unseeded} is VALID [2022-02-21 04:35:45,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {230#unseeded} assume !(main_~length1~0#1 < 1); {230#unseeded} is VALID [2022-02-21 04:35:45,485 INFO L290 TraceCheckUtils]: 3: Hoare triple {230#unseeded} assume !(main_~length2~0#1 < 1); {230#unseeded} is VALID [2022-02-21 04:35:45,485 INFO L290 TraceCheckUtils]: 4: Hoare triple {230#unseeded} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {280#(and unseeded (>= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:45,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {280#(and unseeded (>= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {280#(and unseeded (>= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:45,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {280#(and unseeded (>= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} main_~i~1#1 := 0; {280#(and unseeded (>= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:45,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 04:35:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:45,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:45,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {281#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (* (- 1) |ULTIMATE.start_main_~i~1#1|))) (>= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; {307#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (* (- 1) |ULTIMATE.start_main_~i~1#1|))) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~i~1#1| 1) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|)) (>= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:45,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (* (- 1) |ULTIMATE.start_main_~i~1#1|))) (<= (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~i~1#1| 1) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|)) (>= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {283#(and (or (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (* (- 1) |ULTIMATE.start_main_~i~1#1|))) (>= oldRank0 0)) unseeded) (>= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 04:35:45,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:45,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:35:45,529 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:35:45,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:35:45,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,529 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 04:35:45,529 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:35:45,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:45,632 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 25 states and 38 transitions. Complement of second has 7 states. [2022-02-21 04:35:45,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:45,632 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:45,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. cyclomatic complexity: 10 [2022-02-21 04:35:45,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:45,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:45,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:35:45,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:45,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:45,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:45,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 38 transitions. [2022-02-21 04:35:45,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:35:45,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:45,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:45,635 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 24 transitions. cyclomatic complexity: 10 [2022-02-21 04:35:45,636 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 04:35:45,636 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:35:45,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:45,637 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:45,637 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 38 transitions. cyclomatic complexity: 17 [2022-02-21 04:35:45,637 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 04:35:45,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:45,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:35:45,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:45,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:45,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 2 letters. Loop has 2 letters. [2022-02-21 04:35:45,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 17 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:45,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 5 letters. [2022-02-21 04:35:45,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 5 letters. [2022-02-21 04:35:45,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 5 letters. [2022-02-21 04:35:45,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 25 letters. Loop has 25 letters. [2022-02-21 04:35:45,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 25 letters. Loop has 25 letters. [2022-02-21 04:35:45,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 17 Stem has 25 letters. Loop has 25 letters. [2022-02-21 04:35:45,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 17 letters. [2022-02-21 04:35:45,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 17 letters. Loop has 17 letters. [2022-02-21 04:35:45,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 17 Stem has 17 letters. Loop has 17 letters. [2022-02-21 04:35:45,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:45,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 5 letters. Loop has 5 letters. [2022-02-21 04:35:45,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:45,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 5 letters. [2022-02-21 04:35:45,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 5 letters. [2022-02-21 04:35:45,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 5 letters. [2022-02-21 04:35:45,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 5 letters. [2022-02-21 04:35:45,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 5 letters. [2022-02-21 04:35:45,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 5 letters. [2022-02-21 04:35:45,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 5 letters. [2022-02-21 04:35:45,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 13 letters. Loop has 5 letters. [2022-02-21 04:35:45,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 5 letters. [2022-02-21 04:35:45,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 5 letters. [2022-02-21 04:35:45,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 5 letters. [2022-02-21 04:35:45,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 5 letters. [2022-02-21 04:35:45,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 5 letters. [2022-02-21 04:35:45,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 12 letters. Loop has 5 letters. [2022-02-21 04:35:45,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 5 letters. [2022-02-21 04:35:45,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:45,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:35:45,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:45,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:45,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:35:45,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:45,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:45,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 2 letters. Loop has 2 letters. [2022-02-21 04:35:45,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 17 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:45,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 5 letters. [2022-02-21 04:35:45,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 5 letters. [2022-02-21 04:35:45,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 5 letters. [2022-02-21 04:35:45,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 5 letters. [2022-02-21 04:35:45,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 5 letters. [2022-02-21 04:35:45,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 5 letters. [2022-02-21 04:35:45,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 5 letters. [2022-02-21 04:35:45,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 5 letters. [2022-02-21 04:35:45,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 5 letters. [2022-02-21 04:35:45,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 5 letters. [2022-02-21 04:35:45,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 12 letters. Loop has 5 letters. [2022-02-21 04:35:45,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 5 letters. [2022-02-21 04:35:45,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 5 letters. [2022-02-21 04:35:45,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 13 letters. Loop has 5 letters. [2022-02-21 04:35:45,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 5 letters. [2022-02-21 04:35:45,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,654 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:45,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:35:45,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-02-21 04:35:45,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:45,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:45,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:35:45,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:45,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 38 transitions. cyclomatic complexity: 17 [2022-02-21 04:35:45,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:35:45,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 26 transitions. [2022-02-21 04:35:45,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-02-21 04:35:45,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 04:35:45,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2022-02-21 04:35:45,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:45,657 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2022-02-21 04:35:45,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2022-02-21 04:35:45,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-21 04:35:45,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:45,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:45,658 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:45,658 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:45,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:45,658 INFO L93 Difference]: Finished difference Result 18 states and 26 transitions. [2022-02-21 04:35:45,658 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2022-02-21 04:35:45,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:45,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:45,658 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states and 26 transitions. [2022-02-21 04:35:45,659 INFO L87 Difference]: Start difference. First operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states and 26 transitions. [2022-02-21 04:35:45,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:45,659 INFO L93 Difference]: Finished difference Result 18 states and 26 transitions. [2022-02-21 04:35:45,663 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2022-02-21 04:35:45,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:45,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:45,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:45,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:45,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:45,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2022-02-21 04:35:45,663 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2022-02-21 04:35:45,663 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2022-02-21 04:35:45,664 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:35:45,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2022-02-21 04:35:45,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:35:45,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:45,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:45,664 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:45,664 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 04:35:45,664 INFO L791 eck$LassoCheckResult]: Stem: 352#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 353#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 363#L530 assume !(main_~length1~0#1 < 1); 354#L530-2 assume !(main_~length2~0#1 < 1); 355#L533-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 356#L539-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 357#L539-4 main_~i~1#1 := 0; 348#L545-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 349#L545-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_subseq } true;subseq_#in~s#1.base, subseq_#in~s#1.offset, subseq_#in~t#1.base, subseq_#in~t#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc subseq_#res#1;havoc subseq_#t~mem5#1, subseq_#t~mem6#1, subseq_#t~post7#1.base, subseq_#t~post7#1.offset, subseq_#t~post8#1.base, subseq_#t~post8#1.offset, subseq_#t~mem2#1, subseq_#t~mem3#1, subseq_#t~short4#1, subseq_#t~mem9#1, subseq_~s#1.base, subseq_~s#1.offset, subseq_~t#1.base, subseq_~t#1.offset, subseq_~ps~0#1.base, subseq_~ps~0#1.offset, subseq_~pt~0#1.base, subseq_~pt~0#1.offset;subseq_~s#1.base, subseq_~s#1.offset := subseq_#in~s#1.base, subseq_#in~s#1.offset;subseq_~t#1.base, subseq_~t#1.offset := subseq_#in~t#1.base, subseq_#in~t#1.offset;subseq_~ps~0#1.base, subseq_~ps~0#1.offset := subseq_~s#1.base, subseq_~s#1.offset;subseq_~pt~0#1.base, subseq_~pt~0#1.offset := subseq_~t#1.base, subseq_~t#1.offset; 360#L518-5 [2022-02-21 04:35:45,665 INFO L793 eck$LassoCheckResult]: Loop: 360#L518-5 call subseq_#t~mem2#1 := read~int(subseq_~ps~0#1.base, subseq_~ps~0#1.offset, 1);subseq_#t~short4#1 := 0 != subseq_#t~mem2#1; 361#L518-1 assume subseq_#t~short4#1;call subseq_#t~mem3#1 := read~int(subseq_~pt~0#1.base, subseq_~pt~0#1.offset, 1);subseq_#t~short4#1 := 0 != subseq_#t~mem3#1; 364#L518-3 assume !!subseq_#t~short4#1;havoc subseq_#t~mem2#1;havoc subseq_#t~mem3#1;havoc subseq_#t~short4#1;call subseq_#t~mem5#1 := read~int(subseq_~ps~0#1.base, subseq_~ps~0#1.offset, 1);call subseq_#t~mem6#1 := read~int(subseq_~pt~0#1.base, subseq_~pt~0#1.offset, 1); 365#L519 assume !(subseq_#t~mem5#1 == subseq_#t~mem6#1);havoc subseq_#t~mem5#1;havoc subseq_#t~mem6#1; 362#L519-2 subseq_#t~post8#1.base, subseq_#t~post8#1.offset := subseq_~pt~0#1.base, subseq_~pt~0#1.offset;subseq_~pt~0#1.base, subseq_~pt~0#1.offset := subseq_#t~post8#1.base, 1 + subseq_#t~post8#1.offset;havoc subseq_#t~post8#1.base, subseq_#t~post8#1.offset; 360#L518-5 [2022-02-21 04:35:45,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:45,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2022-02-21 04:35:45,665 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:45,665 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851956733] [2022-02-21 04:35:45,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:45,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:45,681 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:45,692 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:45,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:45,693 INFO L85 PathProgramCache]: Analyzing trace with hash 74536249, now seen corresponding path program 1 times [2022-02-21 04:35:45,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:45,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124927541] [2022-02-21 04:35:45,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:45,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:45,705 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:45,725 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:45,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:45,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1034036476, now seen corresponding path program 1 times [2022-02-21 04:35:45,725 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:45,725 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713274919] [2022-02-21 04:35:45,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:45,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:45,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {409#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {409#true} is VALID [2022-02-21 04:35:45,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {409#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {409#true} is VALID [2022-02-21 04:35:45,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {409#true} assume !(main_~length1~0#1 < 1); {409#true} is VALID [2022-02-21 04:35:45,859 INFO L290 TraceCheckUtils]: 3: Hoare triple {409#true} assume !(main_~length2~0#1 < 1); {411#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} is VALID [2022-02-21 04:35:45,860 INFO L290 TraceCheckUtils]: 4: Hoare triple {411#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {412#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)))} is VALID [2022-02-21 04:35:45,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {412#(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); {412#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|)))} is VALID [2022-02-21 04:35:45,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {412#(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; {413#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (or (and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)))} is VALID [2022-02-21 04:35:45,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {413#(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); {414#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~length2~0#1| 1) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:45,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {414#(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_subseq } true;subseq_#in~s#1.base, subseq_#in~s#1.offset, subseq_#in~t#1.base, subseq_#in~t#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc subseq_#res#1;havoc subseq_#t~mem5#1, subseq_#t~mem6#1, subseq_#t~post7#1.base, subseq_#t~post7#1.offset, subseq_#t~post8#1.base, subseq_#t~post8#1.offset, subseq_#t~mem2#1, subseq_#t~mem3#1, subseq_#t~short4#1, subseq_#t~mem9#1, subseq_~s#1.base, subseq_~s#1.offset, subseq_~t#1.base, subseq_~t#1.offset, subseq_~ps~0#1.base, subseq_~ps~0#1.offset, subseq_~pt~0#1.base, subseq_~pt~0#1.offset;subseq_~s#1.base, subseq_~s#1.offset := subseq_#in~s#1.base, subseq_#in~s#1.offset;subseq_~t#1.base, subseq_~t#1.offset := subseq_#in~t#1.base, subseq_#in~t#1.offset;subseq_~ps~0#1.base, subseq_~ps~0#1.offset := subseq_~s#1.base, subseq_~s#1.offset;subseq_~pt~0#1.base, subseq_~pt~0#1.offset := subseq_~t#1.base, subseq_~t#1.offset; {415#(= (select (select |#memory_int| |ULTIMATE.start_subseq_~pt~0#1.base|) |ULTIMATE.start_subseq_~pt~0#1.offset|) 0)} is VALID [2022-02-21 04:35:45,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {415#(= (select (select |#memory_int| |ULTIMATE.start_subseq_~pt~0#1.base|) |ULTIMATE.start_subseq_~pt~0#1.offset|) 0)} call subseq_#t~mem2#1 := read~int(subseq_~ps~0#1.base, subseq_~ps~0#1.offset, 1);subseq_#t~short4#1 := 0 != subseq_#t~mem2#1; {415#(= (select (select |#memory_int| |ULTIMATE.start_subseq_~pt~0#1.base|) |ULTIMATE.start_subseq_~pt~0#1.offset|) 0)} is VALID [2022-02-21 04:35:45,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {415#(= (select (select |#memory_int| |ULTIMATE.start_subseq_~pt~0#1.base|) |ULTIMATE.start_subseq_~pt~0#1.offset|) 0)} assume subseq_#t~short4#1;call subseq_#t~mem3#1 := read~int(subseq_~pt~0#1.base, subseq_~pt~0#1.offset, 1);subseq_#t~short4#1 := 0 != subseq_#t~mem3#1; {416#(not |ULTIMATE.start_subseq_#t~short4#1|)} is VALID [2022-02-21 04:35:45,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {416#(not |ULTIMATE.start_subseq_#t~short4#1|)} assume !!subseq_#t~short4#1;havoc subseq_#t~mem2#1;havoc subseq_#t~mem3#1;havoc subseq_#t~short4#1;call subseq_#t~mem5#1 := read~int(subseq_~ps~0#1.base, subseq_~ps~0#1.offset, 1);call subseq_#t~mem6#1 := read~int(subseq_~pt~0#1.base, subseq_~pt~0#1.offset, 1); {410#false} is VALID [2022-02-21 04:35:45,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {410#false} assume !(subseq_#t~mem5#1 == subseq_#t~mem6#1);havoc subseq_#t~mem5#1;havoc subseq_#t~mem6#1; {410#false} is VALID [2022-02-21 04:35:45,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {410#false} subseq_#t~post8#1.base, subseq_#t~post8#1.offset := subseq_~pt~0#1.base, subseq_~pt~0#1.offset;subseq_~pt~0#1.base, subseq_~pt~0#1.offset := subseq_#t~post8#1.base, 1 + subseq_#t~post8#1.offset;havoc subseq_#t~post8#1.base, subseq_#t~post8#1.offset; {410#false} is VALID [2022-02-21 04:35:45,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:45,864 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:45,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713274919] [2022-02-21 04:35:45,865 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713274919] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:45,865 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:45,865 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-21 04:35:45,865 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102162222] [2022-02-21 04:35:45,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:45,987 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:45,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 04:35:45,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-21 04:35:45,991 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. cyclomatic complexity: 11 Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:46,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:46,160 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2022-02-21 04:35:46,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 04:35:46,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:46,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:46,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2022-02-21 04:35:46,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:35:46,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 19 states and 25 transitions. [2022-02-21 04:35:46,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 04:35:46,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 04:35:46,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2022-02-21 04:35:46,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:46,174 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-02-21 04:35:46,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2022-02-21 04:35:46,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-02-21 04:35:46,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:46,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 25 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:46,176 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 25 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:46,176 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:46,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:46,176 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2022-02-21 04:35:46,177 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-02-21 04:35:46,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:46,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:46,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states and 25 transitions. [2022-02-21 04:35:46,177 INFO L87 Difference]: Start difference. First operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states and 25 transitions. [2022-02-21 04:35:46,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:46,178 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2022-02-21 04:35:46,178 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-02-21 04:35:46,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:46,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:46,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:46,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:46,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:46,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2022-02-21 04:35:46,179 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2022-02-21 04:35:46,179 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2022-02-21 04:35:46,179 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:35:46,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2022-02-21 04:35:46,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:35:46,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:46,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:46,180 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:46,180 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 04:35:46,180 INFO L791 eck$LassoCheckResult]: Stem: 451#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 452#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 462#L530 assume !(main_~length1~0#1 < 1); 453#L530-2 assume !(main_~length2~0#1 < 1); 454#L533-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 455#L539-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 456#L539-4 main_~i~1#1 := 0; 447#L545-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; 448#L545-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 449#L545-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 450#L545-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_subseq } true;subseq_#in~s#1.base, subseq_#in~s#1.offset, subseq_#in~t#1.base, subseq_#in~t#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc subseq_#res#1;havoc subseq_#t~mem5#1, subseq_#t~mem6#1, subseq_#t~post7#1.base, subseq_#t~post7#1.offset, subseq_#t~post8#1.base, subseq_#t~post8#1.offset, subseq_#t~mem2#1, subseq_#t~mem3#1, subseq_#t~short4#1, subseq_#t~mem9#1, subseq_~s#1.base, subseq_~s#1.offset, subseq_~t#1.base, subseq_~t#1.offset, subseq_~ps~0#1.base, subseq_~ps~0#1.offset, subseq_~pt~0#1.base, subseq_~pt~0#1.offset;subseq_~s#1.base, subseq_~s#1.offset := subseq_#in~s#1.base, subseq_#in~s#1.offset;subseq_~t#1.base, subseq_~t#1.offset := subseq_#in~t#1.base, subseq_#in~t#1.offset;subseq_~ps~0#1.base, subseq_~ps~0#1.offset := subseq_~s#1.base, subseq_~s#1.offset;subseq_~pt~0#1.base, subseq_~pt~0#1.offset := subseq_~t#1.base, subseq_~t#1.offset; 459#L518-5 [2022-02-21 04:35:46,182 INFO L793 eck$LassoCheckResult]: Loop: 459#L518-5 call subseq_#t~mem2#1 := read~int(subseq_~ps~0#1.base, subseq_~ps~0#1.offset, 1);subseq_#t~short4#1 := 0 != subseq_#t~mem2#1; 460#L518-1 assume subseq_#t~short4#1;call subseq_#t~mem3#1 := read~int(subseq_~pt~0#1.base, subseq_~pt~0#1.offset, 1);subseq_#t~short4#1 := 0 != subseq_#t~mem3#1; 463#L518-3 assume !!subseq_#t~short4#1;havoc subseq_#t~mem2#1;havoc subseq_#t~mem3#1;havoc subseq_#t~short4#1;call subseq_#t~mem5#1 := read~int(subseq_~ps~0#1.base, subseq_~ps~0#1.offset, 1);call subseq_#t~mem6#1 := read~int(subseq_~pt~0#1.base, subseq_~pt~0#1.offset, 1); 464#L519 assume !(subseq_#t~mem5#1 == subseq_#t~mem6#1);havoc subseq_#t~mem5#1;havoc subseq_#t~mem6#1; 461#L519-2 subseq_#t~post8#1.base, subseq_#t~post8#1.offset := subseq_~pt~0#1.base, subseq_~pt~0#1.offset;subseq_~pt~0#1.base, subseq_~pt~0#1.offset := subseq_#t~post8#1.base, 1 + subseq_#t~post8#1.offset;havoc subseq_#t~post8#1.base, subseq_#t~post8#1.offset; 459#L518-5 [2022-02-21 04:35:46,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:46,183 INFO L85 PathProgramCache]: Analyzing trace with hash -2087704584, now seen corresponding path program 1 times [2022-02-21 04:35:46,183 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:46,183 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967240197] [2022-02-21 04:35:46,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:46,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:46,233 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:46,245 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:46,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:46,246 INFO L85 PathProgramCache]: Analyzing trace with hash 74536249, now seen corresponding path program 2 times [2022-02-21 04:35:46,248 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:46,248 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228375699] [2022-02-21 04:35:46,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:46,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:46,258 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:46,269 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:46,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:46,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1834913698, now seen corresponding path program 1 times [2022-02-21 04:35:46,269 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:46,270 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470385193] [2022-02-21 04:35:46,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:46,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:46,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {510#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {510#true} is VALID [2022-02-21 04:35:46,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {510#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {510#true} is VALID [2022-02-21 04:35:46,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {510#true} assume !(main_~length1~0#1 < 1); {512#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:35:46,422 INFO L290 TraceCheckUtils]: 3: Hoare triple {512#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} assume !(main_~length2~0#1 < 1); {512#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:35:46,423 INFO L290 TraceCheckUtils]: 4: Hoare triple {512#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {513#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (or (and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|))) (<= 2 |ULTIMATE.start_main_~length1~0#1|)))} is VALID [2022-02-21 04:35:46,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {513#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (or (and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|))) (<= 2 |ULTIMATE.start_main_~length1~0#1|)))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {514#(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:35:46,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {514#(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; {514#(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:35:46,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {514#(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);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; {514#(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:35:46,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {514#(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_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {514#(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:35:46,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {514#(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); {514#(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:35:46,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {514#(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_subseq } true;subseq_#in~s#1.base, subseq_#in~s#1.offset, subseq_#in~t#1.base, subseq_#in~t#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc subseq_#res#1;havoc subseq_#t~mem5#1, subseq_#t~mem6#1, subseq_#t~post7#1.base, subseq_#t~post7#1.offset, subseq_#t~post8#1.base, subseq_#t~post8#1.offset, subseq_#t~mem2#1, subseq_#t~mem3#1, subseq_#t~short4#1, subseq_#t~mem9#1, subseq_~s#1.base, subseq_~s#1.offset, subseq_~t#1.base, subseq_~t#1.offset, subseq_~ps~0#1.base, subseq_~ps~0#1.offset, subseq_~pt~0#1.base, subseq_~pt~0#1.offset;subseq_~s#1.base, subseq_~s#1.offset := subseq_#in~s#1.base, subseq_#in~s#1.offset;subseq_~t#1.base, subseq_~t#1.offset := subseq_#in~t#1.base, subseq_#in~t#1.offset;subseq_~ps~0#1.base, subseq_~ps~0#1.offset := subseq_~s#1.base, subseq_~s#1.offset;subseq_~pt~0#1.base, subseq_~pt~0#1.offset := subseq_~t#1.base, subseq_~t#1.offset; {515#(= (select (select |#memory_int| |ULTIMATE.start_subseq_~ps~0#1.base|) |ULTIMATE.start_subseq_~ps~0#1.offset|) 0)} is VALID [2022-02-21 04:35:46,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {515#(= (select (select |#memory_int| |ULTIMATE.start_subseq_~ps~0#1.base|) |ULTIMATE.start_subseq_~ps~0#1.offset|) 0)} call subseq_#t~mem2#1 := read~int(subseq_~ps~0#1.base, subseq_~ps~0#1.offset, 1);subseq_#t~short4#1 := 0 != subseq_#t~mem2#1; {516#(not |ULTIMATE.start_subseq_#t~short4#1|)} is VALID [2022-02-21 04:35:46,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {516#(not |ULTIMATE.start_subseq_#t~short4#1|)} assume subseq_#t~short4#1;call subseq_#t~mem3#1 := read~int(subseq_~pt~0#1.base, subseq_~pt~0#1.offset, 1);subseq_#t~short4#1 := 0 != subseq_#t~mem3#1; {511#false} is VALID [2022-02-21 04:35:46,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {511#false} assume !!subseq_#t~short4#1;havoc subseq_#t~mem2#1;havoc subseq_#t~mem3#1;havoc subseq_#t~short4#1;call subseq_#t~mem5#1 := read~int(subseq_~ps~0#1.base, subseq_~ps~0#1.offset, 1);call subseq_#t~mem6#1 := read~int(subseq_~pt~0#1.base, subseq_~pt~0#1.offset, 1); {511#false} is VALID [2022-02-21 04:35:46,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {511#false} assume !(subseq_#t~mem5#1 == subseq_#t~mem6#1);havoc subseq_#t~mem5#1;havoc subseq_#t~mem6#1; {511#false} is VALID [2022-02-21 04:35:46,429 INFO L290 TraceCheckUtils]: 15: Hoare triple {511#false} subseq_#t~post8#1.base, subseq_#t~post8#1.offset := subseq_~pt~0#1.base, subseq_~pt~0#1.offset;subseq_~pt~0#1.base, subseq_~pt~0#1.offset := subseq_#t~post8#1.base, 1 + subseq_#t~post8#1.offset;havoc subseq_#t~post8#1.base, subseq_#t~post8#1.offset; {511#false} is VALID [2022-02-21 04:35:46,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:35:46,429 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:46,430 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470385193] [2022-02-21 04:35:46,430 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470385193] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:46,430 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:46,430 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-21 04:35:46,430 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505994373] [2022-02-21 04:35:46,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:46,554 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:46,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 04:35:46,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-21 04:35:46,555 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:35:46,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:46,746 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-02-21 04:35:46,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 04:35:46,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:35:46,760 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:35:46,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2022-02-21 04:35:46,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:35:46,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 19 states and 24 transitions. [2022-02-21 04:35:46,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 04:35:46,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 04:35:46,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2022-02-21 04:35:46,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:46,762 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-02-21 04:35:46,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2022-02-21 04:35:46,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-02-21 04:35:46,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:46,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 24 transitions. Second operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 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:35:46,763 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 24 transitions. Second operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 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:35:46,763 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 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:35:46,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:46,764 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-02-21 04:35:46,764 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-02-21 04:35:46,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:46,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:46,764 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 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 19 states and 24 transitions. [2022-02-21 04:35:46,764 INFO L87 Difference]: Start difference. First operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 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 19 states and 24 transitions. [2022-02-21 04:35:46,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:46,765 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-02-21 04:35:46,766 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-02-21 04:35:46,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:46,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:46,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:46,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 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:35:46,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-02-21 04:35:46,766 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-02-21 04:35:46,766 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-02-21 04:35:46,766 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:35:46,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2022-02-21 04:35:46,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:35:46,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:46,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:46,767 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:46,767 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 04:35:46,767 INFO L791 eck$LassoCheckResult]: Stem: 553#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 554#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 564#L530 assume !(main_~length1~0#1 < 1); 555#L530-2 assume !(main_~length2~0#1 < 1); 556#L533-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 557#L539-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; 558#L539-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 559#L539-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 560#L539-4 main_~i~1#1 := 0; 549#L545-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; 550#L545-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 551#L545-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 552#L545-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_subseq } true;subseq_#in~s#1.base, subseq_#in~s#1.offset, subseq_#in~t#1.base, subseq_#in~t#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc subseq_#res#1;havoc subseq_#t~mem5#1, subseq_#t~mem6#1, subseq_#t~post7#1.base, subseq_#t~post7#1.offset, subseq_#t~post8#1.base, subseq_#t~post8#1.offset, subseq_#t~mem2#1, subseq_#t~mem3#1, subseq_#t~short4#1, subseq_#t~mem9#1, subseq_~s#1.base, subseq_~s#1.offset, subseq_~t#1.base, subseq_~t#1.offset, subseq_~ps~0#1.base, subseq_~ps~0#1.offset, subseq_~pt~0#1.base, subseq_~pt~0#1.offset;subseq_~s#1.base, subseq_~s#1.offset := subseq_#in~s#1.base, subseq_#in~s#1.offset;subseq_~t#1.base, subseq_~t#1.offset := subseq_#in~t#1.base, subseq_#in~t#1.offset;subseq_~ps~0#1.base, subseq_~ps~0#1.offset := subseq_~s#1.base, subseq_~s#1.offset;subseq_~pt~0#1.base, subseq_~pt~0#1.offset := subseq_~t#1.base, subseq_~t#1.offset; 561#L518-5 [2022-02-21 04:35:46,768 INFO L793 eck$LassoCheckResult]: Loop: 561#L518-5 call subseq_#t~mem2#1 := read~int(subseq_~ps~0#1.base, subseq_~ps~0#1.offset, 1);subseq_#t~short4#1 := 0 != subseq_#t~mem2#1; 562#L518-1 assume subseq_#t~short4#1;call subseq_#t~mem3#1 := read~int(subseq_~pt~0#1.base, subseq_~pt~0#1.offset, 1);subseq_#t~short4#1 := 0 != subseq_#t~mem3#1; 565#L518-3 assume !!subseq_#t~short4#1;havoc subseq_#t~mem2#1;havoc subseq_#t~mem3#1;havoc subseq_#t~short4#1;call subseq_#t~mem5#1 := read~int(subseq_~ps~0#1.base, subseq_~ps~0#1.offset, 1);call subseq_#t~mem6#1 := read~int(subseq_~pt~0#1.base, subseq_~pt~0#1.offset, 1); 566#L519 assume !(subseq_#t~mem5#1 == subseq_#t~mem6#1);havoc subseq_#t~mem5#1;havoc subseq_#t~mem6#1; 563#L519-2 subseq_#t~post8#1.base, subseq_#t~post8#1.offset := subseq_~pt~0#1.base, subseq_~pt~0#1.offset;subseq_~pt~0#1.base, subseq_~pt~0#1.offset := subseq_#t~post8#1.base, 1 + subseq_#t~post8#1.offset;havoc subseq_#t~post8#1.base, subseq_#t~post8#1.offset; 561#L518-5 [2022-02-21 04:35:46,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:46,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2022-02-21 04:35:46,769 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:46,769 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963549930] [2022-02-21 04:35:46,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:46,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:46,794 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:46,817 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:46,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:46,820 INFO L85 PathProgramCache]: Analyzing trace with hash 74536249, now seen corresponding path program 3 times [2022-02-21 04:35:46,820 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:46,820 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295523629] [2022-02-21 04:35:46,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:46,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:46,830 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:46,837 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:46,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:46,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1075475712, now seen corresponding path program 1 times [2022-02-21 04:35:46,838 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:46,838 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694415451] [2022-02-21 04:35:46,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:46,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:46,854 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:46,863 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:47,964 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:47,964 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:47,964 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:47,964 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:47,964 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:47,964 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:47,964 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:47,964 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:47,964 INFO L133 ssoRankerPreferences]: Filename of dumped script: subseq-alloca-2.i_Iteration5_Lasso [2022-02-21 04:35:47,964 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:47,964 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:47,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:47,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:47,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:47,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:47,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:47,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:47,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:47,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:47,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:47,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:47,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:47,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:47,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:47,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:47,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:47,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:47,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:48,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:48,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:48,712 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 04:35:48,714 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 04:35:48,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:48,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:48,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:48,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:48,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:48,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:49,537 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:49,537 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:49,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:49,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:49,539 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:49,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 04:35:49,541 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:49,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:49,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:49,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:49,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:49,549 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:49,549 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:49,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:49,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:49,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:49,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:49,575 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:49,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 04:35:49,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:49,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:49,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:49,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:49,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:49,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:49,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:49,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:49,592 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:49,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-02-21 04:35:49,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:49,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:49,617 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:49,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 04:35:49,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:49,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:49,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:49,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:49,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:49,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:49,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:49,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:49,660 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:49,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-02-21 04:35:49,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:49,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:49,679 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:49,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 04:35:49,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:49,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:49,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:49,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:49,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:49,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:49,689 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:49,689 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:49,702 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:49,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:49,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:49,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:49,725 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:49,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 04:35:49,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:49,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:49,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:49,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:49,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:49,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:49,735 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:49,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:49,744 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:49,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:49,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:49,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:49,768 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:49,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 04:35:49,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:49,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:49,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:49,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:49,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:49,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:49,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:49,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:49,792 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:49,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-02-21 04:35:49,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:49,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:49,838 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:49,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 04:35:49,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:49,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:49,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:49,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:49,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:49,849 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:49,849 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:49,851 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:49,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:49,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:49,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:49,871 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:49,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 04:35:49,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:49,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:49,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:49,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:49,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:49,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:49,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:49,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:49,882 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:49,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-02-21 04:35:49,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:49,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:49,900 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:49,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 04:35:49,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:49,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:49,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:49,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:49,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:49,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:49,909 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:49,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:49,918 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:49,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 04:35:49,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:49,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:49,935 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:49,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 04:35:49,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:49,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:49,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:49,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:49,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:49,946 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:49,946 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:49,963 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:49,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-02-21 04:35:49,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:49,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:49,988 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:49,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 04:35:49,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:49,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:49,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:49,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:49,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:49,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:49,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:49,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:50,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:50,024 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:35:50,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:50,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:50,025 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:50,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 04:35:50,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:50,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:50,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:50,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:50,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:50,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:50,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:50,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:50,044 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:50,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-02-21 04:35:50,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:50,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:50,062 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:50,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:50,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 04:35:50,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:50,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:50,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:50,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:50,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:50,071 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:50,071 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:50,085 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:50,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-02-21 04:35:50,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:50,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:50,109 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:50,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 04:35:50,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:50,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:50,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:50,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:50,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:50,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:50,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:50,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:50,134 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:50,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-02-21 04:35:50,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:50,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:50,152 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:50,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 04:35:50,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:50,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:50,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:50,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:50,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:50,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:50,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:50,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:50,192 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:50,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-02-21 04:35:50,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:50,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:50,216 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:50,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 04:35:50,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:50,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:50,225 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:50,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:50,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:50,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:50,227 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:50,227 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:50,237 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:50,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-02-21 04:35:50,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:50,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:50,260 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:50,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 04:35:50,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:50,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:50,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:50,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:50,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:50,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:50,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:50,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:50,312 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:50,328 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:35:50,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:50,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:50,330 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:50,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 04:35:50,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:50,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:50,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:50,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:50,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:50,339 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:50,339 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:50,342 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:50,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-02-21 04:35:50,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:50,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:50,365 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:50,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 04:35:50,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:50,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:50,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:50,375 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2022-02-21 04:35:50,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:50,422 INFO L401 nArgumentSynthesizer]: We have 96 Motzkin's Theorem applications. [2022-02-21 04:35:50,423 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2022-02-21 04:35:50,501 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:50,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-02-21 04:35:50,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:50,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:50,520 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:50,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 04:35:50,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:50,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:50,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:50,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:50,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:50,532 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:50,532 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:50,536 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:50,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:50,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:50,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:50,555 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:50,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 04:35:50,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:50,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:50,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:50,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:50,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:50,579 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:50,579 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:50,592 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:50,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-02-21 04:35:50,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:50,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:50,612 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:50,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 04:35:50,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:50,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:50,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:50,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:50,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:50,623 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:50,623 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:50,637 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:50,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:50,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:50,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:50,663 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:50,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-02-21 04:35:50,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:50,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:50,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:50,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:50,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:50,674 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:50,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:50,688 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:50,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:50,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:50,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:50,713 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:50,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 04:35:50,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:50,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:50,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:50,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:50,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:50,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:50,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:50,727 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:50,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-02-21 04:35:50,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:50,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:50,753 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:50,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 04:35:50,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:50,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:50,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:50,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:50,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:50,775 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:50,776 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:50,798 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:50,872 INFO L443 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2022-02-21 04:35:50,872 INFO L444 ModelExtractionUtils]: 21 out of 58 variables were initially zero. Simplification set additionally 34 variables to zero. [2022-02-21 04:35:50,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:50,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:50,874 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:50,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 04:35:50,876 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:50,884 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:50,885 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:50,885 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_2, ULTIMATE.start_subseq_~pt~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_2 - 1*ULTIMATE.start_subseq_~pt~0#1.offset Supporting invariants [] [2022-02-21 04:35:50,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-02-21 04:35:50,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-02-21 04:35:51,085 INFO L297 tatePredicateManager]: 26 out of 27 supporting invariants were superfluous and have been removed [2022-02-21 04:35:51,091 INFO L390 LassoCheck]: Loop: "call subseq_#t~mem2#1 := read~int(subseq_~ps~0#1.base, subseq_~ps~0#1.offset, 1);subseq_#t~short4#1 := 0 != subseq_#t~mem2#1;" "assume subseq_#t~short4#1;call subseq_#t~mem3#1 := read~int(subseq_~pt~0#1.base, subseq_~pt~0#1.offset, 1);subseq_#t~short4#1 := 0 != subseq_#t~mem3#1;" "assume !!subseq_#t~short4#1;havoc subseq_#t~mem2#1;havoc subseq_#t~mem3#1;havoc subseq_#t~short4#1;call subseq_#t~mem5#1 := read~int(subseq_~ps~0#1.base, subseq_~ps~0#1.offset, 1);call subseq_#t~mem6#1 := read~int(subseq_~pt~0#1.base, subseq_~pt~0#1.offset, 1);" "assume !(subseq_#t~mem5#1 == subseq_#t~mem6#1);havoc subseq_#t~mem5#1;havoc subseq_#t~mem6#1;" "subseq_#t~post8#1.base, subseq_#t~post8#1.offset := subseq_~pt~0#1.base, subseq_~pt~0#1.offset;subseq_~pt~0#1.base, subseq_~pt~0#1.offset := subseq_#t~post8#1.base, 1 + subseq_#t~post8#1.offset;havoc subseq_#t~post8#1.base, subseq_#t~post8#1.offset;" [2022-02-21 04:35:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:51,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:51,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:35:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:51,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:51,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {614#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {614#unseeded} is VALID [2022-02-21 04:35:51,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {614#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {614#unseeded} is VALID [2022-02-21 04:35:51,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {614#unseeded} assume !(main_~length1~0#1 < 1); {614#unseeded} is VALID [2022-02-21 04:35:51,186 INFO L290 TraceCheckUtils]: 3: Hoare triple {614#unseeded} assume !(main_~length2~0#1 < 1); {614#unseeded} is VALID [2022-02-21 04:35:51,190 INFO L290 TraceCheckUtils]: 4: Hoare triple {614#unseeded} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {614#unseeded} is VALID [2022-02-21 04:35:51,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {614#unseeded} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; {614#unseeded} is VALID [2022-02-21 04:35:51,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {614#unseeded} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {614#unseeded} is VALID [2022-02-21 04:35:51,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {614#unseeded} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {614#unseeded} is VALID [2022-02-21 04:35:51,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {614#unseeded} main_~i~1#1 := 0; {614#unseeded} is VALID [2022-02-21 04:35:51,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {614#unseeded} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; {614#unseeded} is VALID [2022-02-21 04:35:51,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {614#unseeded} main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {614#unseeded} is VALID [2022-02-21 04:35:51,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {614#unseeded} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {614#unseeded} is VALID [2022-02-21 04:35:51,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {614#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_subseq } true;subseq_#in~s#1.base, subseq_#in~s#1.offset, subseq_#in~t#1.base, subseq_#in~t#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc subseq_#res#1;havoc subseq_#t~mem5#1, subseq_#t~mem6#1, subseq_#t~post7#1.base, subseq_#t~post7#1.offset, subseq_#t~post8#1.base, subseq_#t~post8#1.offset, subseq_#t~mem2#1, subseq_#t~mem3#1, subseq_#t~short4#1, subseq_#t~mem9#1, subseq_~s#1.base, subseq_~s#1.offset, subseq_~t#1.base, subseq_~t#1.offset, subseq_~ps~0#1.base, subseq_~ps~0#1.offset, subseq_~pt~0#1.base, subseq_~pt~0#1.offset;subseq_~s#1.base, subseq_~s#1.offset := subseq_#in~s#1.base, subseq_#in~s#1.offset;subseq_~t#1.base, subseq_~t#1.offset := subseq_#in~t#1.base, subseq_#in~t#1.offset;subseq_~ps~0#1.base, subseq_~ps~0#1.offset := subseq_~s#1.base, subseq_~s#1.offset;subseq_~pt~0#1.base, subseq_~pt~0#1.offset := subseq_~t#1.base, subseq_~t#1.offset; {763#(and unseeded (= |ULTIMATE.start_subseq_~pt~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 04:35:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:51,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:35:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:51,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:51,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {764#(and (= |ULTIMATE.start_subseq_~pt~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_subseq_~pt~0#1.offset|))))} call subseq_#t~mem2#1 := read~int(subseq_~ps~0#1.base, subseq_~ps~0#1.offset, 1);subseq_#t~short4#1 := 0 != subseq_#t~mem2#1; {764#(and (= |ULTIMATE.start_subseq_~pt~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_subseq_~pt~0#1.offset|))))} is VALID [2022-02-21 04:35:51,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {764#(and (= |ULTIMATE.start_subseq_~pt~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_subseq_~pt~0#1.offset|))))} assume subseq_#t~short4#1;call subseq_#t~mem3#1 := read~int(subseq_~pt~0#1.base, subseq_~pt~0#1.offset, 1);subseq_#t~short4#1 := 0 != subseq_#t~mem3#1; {811#(and (<= (+ |ULTIMATE.start_subseq_~pt~0#1.offset| 1) (select |#length| |ULTIMATE.start_subseq_~pt~0#1.base|)) (= |ULTIMATE.start_subseq_~pt~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_subseq_~pt~0#1.offset|))))} is VALID [2022-02-21 04:35:51,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {811#(and (<= (+ |ULTIMATE.start_subseq_~pt~0#1.offset| 1) (select |#length| |ULTIMATE.start_subseq_~pt~0#1.base|)) (= |ULTIMATE.start_subseq_~pt~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_subseq_~pt~0#1.offset|))))} assume !!subseq_#t~short4#1;havoc subseq_#t~mem2#1;havoc subseq_#t~mem3#1;havoc subseq_#t~short4#1;call subseq_#t~mem5#1 := read~int(subseq_~ps~0#1.base, subseq_~ps~0#1.offset, 1);call subseq_#t~mem6#1 := read~int(subseq_~pt~0#1.base, subseq_~pt~0#1.offset, 1); {811#(and (<= (+ |ULTIMATE.start_subseq_~pt~0#1.offset| 1) (select |#length| |ULTIMATE.start_subseq_~pt~0#1.base|)) (= |ULTIMATE.start_subseq_~pt~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_subseq_~pt~0#1.offset|))))} is VALID [2022-02-21 04:35:51,279 INFO L290 TraceCheckUtils]: 3: Hoare triple {811#(and (<= (+ |ULTIMATE.start_subseq_~pt~0#1.offset| 1) (select |#length| |ULTIMATE.start_subseq_~pt~0#1.base|)) (= |ULTIMATE.start_subseq_~pt~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_subseq_~pt~0#1.offset|))))} assume !(subseq_#t~mem5#1 == subseq_#t~mem6#1);havoc subseq_#t~mem5#1;havoc subseq_#t~mem6#1; {811#(and (<= (+ |ULTIMATE.start_subseq_~pt~0#1.offset| 1) (select |#length| |ULTIMATE.start_subseq_~pt~0#1.base|)) (= |ULTIMATE.start_subseq_~pt~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_subseq_~pt~0#1.offset|))))} is VALID [2022-02-21 04:35:51,280 INFO L290 TraceCheckUtils]: 4: Hoare triple {811#(and (<= (+ |ULTIMATE.start_subseq_~pt~0#1.offset| 1) (select |#length| |ULTIMATE.start_subseq_~pt~0#1.base|)) (= |ULTIMATE.start_subseq_~pt~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_subseq_~pt~0#1.offset|))))} subseq_#t~post8#1.base, subseq_#t~post8#1.offset := subseq_~pt~0#1.base, subseq_~pt~0#1.offset;subseq_~pt~0#1.base, subseq_~pt~0#1.offset := subseq_#t~post8#1.base, 1 + subseq_#t~post8#1.offset;havoc subseq_#t~post8#1.base, subseq_#t~post8#1.offset; {766#(and (= |ULTIMATE.start_subseq_~pt~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_subseq_~pt~0#1.offset|))))))} is VALID [2022-02-21 04:35:51,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:51,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:51,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:51,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 04:35:51,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,293 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:35:51,293 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 23 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:51,341 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 23 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 23 states and 30 transitions. Complement of second has 6 states. [2022-02-21 04:35:51,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:51,341 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:51,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. cyclomatic complexity: 8 [2022-02-21 04:35:51,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:51,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:51,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:51,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:51,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:51,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:51,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2022-02-21 04:35:51,343 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:51,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:51,343 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 23 transitions. cyclomatic complexity: 8 [2022-02-21 04:35:51,344 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 04:35:51,344 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:51,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:51,345 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:51,345 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 23 states and 30 transitions. cyclomatic complexity: 10 [2022-02-21 04:35:51,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. cyclomatic complexity: 10 [2022-02-21 04:35:51,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:51,346 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:35:51,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 5 letters. [2022-02-21 04:35:51,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 04:35:51,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 5 letters. [2022-02-21 04:35:51,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:35:51,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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 3 letters. [2022-02-21 04:35:51,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:35:51,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 23 letters. Loop has 23 letters. [2022-02-21 04:35:51,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 23 letters. [2022-02-21 04:35:51,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 10 Stem has 23 letters. Loop has 23 letters. [2022-02-21 04:35:51,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 18 letters. [2022-02-21 04:35:51,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 18 letters. [2022-02-21 04:35:51,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 18 letters. [2022-02-21 04:35:51,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:51,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:51,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:51,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 5 letters. [2022-02-21 04:35:51,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 04:35:51,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 5 letters. [2022-02-21 04:35:51,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 5 letters. [2022-02-21 04:35:51,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 04:35:51,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 5 letters. [2022-02-21 04:35:51,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:35:51,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:35:51,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:35:51,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 5 letters. [2022-02-21 04:35:51,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 04:35:51,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 5 letters. [2022-02-21 04:35:51,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 5 letters. [2022-02-21 04:35:51,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 04:35:51,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 5 letters. [2022-02-21 04:35:51,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:35:51,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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 3 letters. [2022-02-21 04:35:51,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:35:51,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,354 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:51,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:51,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2022-02-21 04:35:51,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 13 letters. Loop has 5 letters. [2022-02-21 04:35:51,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:35:51,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 13 letters. Loop has 10 letters. [2022-02-21 04:35:51,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:51,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. cyclomatic complexity: 10 [2022-02-21 04:35:51,357 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:51,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2022-02-21 04:35:51,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:35:51,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:35:51,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:35:51,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:51,358 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:51,358 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:51,358 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:51,358 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 04:35:51,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:35:51,358 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:51,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:51,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:35:51 BoogieIcfgContainer [2022-02-21 04:35:51,365 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:35:51,365 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:35:51,365 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:35:51,365 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:35:51,366 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:42" (3/4) ... [2022-02-21 04:35:51,368 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:35:51,368 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:35:51,369 INFO L158 Benchmark]: Toolchain (without parser) took 10108.53ms. Allocated memory was 96.5MB in the beginning and 148.9MB in the end (delta: 52.4MB). Free memory was 59.8MB in the beginning and 69.0MB in the end (delta: -9.2MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. [2022-02-21 04:35:51,370 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory was 66.6MB in the beginning and 66.6MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:51,370 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.67ms. Allocated memory is still 96.5MB. Free memory was 59.5MB in the beginning and 63.3MB in the end (delta: -3.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 04:35:51,370 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.26ms. Allocated memory is still 96.5MB. Free memory was 63.3MB in the beginning and 60.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:51,370 INFO L158 Benchmark]: Boogie Preprocessor took 20.96ms. Allocated memory is still 96.5MB. Free memory was 60.8MB in the beginning and 59.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:51,371 INFO L158 Benchmark]: RCFGBuilder took 397.37ms. Allocated memory is still 96.5MB. Free memory was 59.6MB in the beginning and 44.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-21 04:35:51,371 INFO L158 Benchmark]: BuchiAutomizer took 9243.37ms. Allocated memory was 96.5MB in the beginning and 148.9MB in the end (delta: 52.4MB). Free memory was 44.9MB in the beginning and 69.0MB in the end (delta: -24.1MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2022-02-21 04:35:51,371 INFO L158 Benchmark]: Witness Printer took 3.37ms. Allocated memory is still 148.9MB. Free memory is still 69.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:51,373 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.19ms. Allocated memory is still 96.5MB. Free memory was 66.6MB in the beginning and 66.6MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.67ms. Allocated memory is still 96.5MB. Free memory was 59.5MB in the beginning and 63.3MB in the end (delta: -3.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.26ms. Allocated memory is still 96.5MB. Free memory was 63.3MB in the beginning and 60.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.96ms. Allocated memory is still 96.5MB. Free memory was 60.8MB in the beginning and 59.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 397.37ms. Allocated memory is still 96.5MB. Free memory was 59.6MB in the beginning and 44.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 9243.37ms. Allocated memory was 96.5MB in the beginning and 148.9MB in the end (delta: 52.4MB). Free memory was 44.9MB in the beginning and 69.0MB in the end (delta: -24.1MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. * Witness Printer took 3.37ms. Allocated memory is still 148.9MB. Free memory is still 69.0MB. 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 + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[nondetString2] + -1 * pt and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.1s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 7.7s. Construction of modules took 0.1s. Büchi inclusion checks took 1.1s. 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 18 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 129 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 212 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 134 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 138 IncrementalHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 78 mSDtfsCounter, 138 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital205 mio100 ax111 hnf100 lsp84 ukn76 mio100 lsp48 div100 bol100 ite100 ukn100 eq178 hnf90 smp97 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 136ms VariablesStem: 6 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 96 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:35:51,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE