./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.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/cstrncmp-alloca-1.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 51aa0675891000edd5d1736f3584d06816ce7050b76c01d5b217260a35077c25 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:34:58,467 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:34:58,469 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:34:58,489 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:34:58,490 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:34:58,490 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:34:58,491 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:34:58,493 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:34:58,494 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:34:58,495 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:34:58,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:34:58,496 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:34:58,496 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:34:58,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:34:58,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:34:58,498 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:34:58,499 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:34:58,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:34:58,500 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:34:58,502 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:34:58,503 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:34:58,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:34:58,505 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:34:58,505 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:34:58,507 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:34:58,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:34:58,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:34:58,508 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:34:58,522 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:34:58,523 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:34:58,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:34:58,524 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:34:58,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:34:58,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:34:58,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:34:58,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:34:58,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:34:58,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:34:58,526 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:34:58,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:34:58,527 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:34:58,528 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:34:58,547 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:34:58,554 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:34:58,554 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:34:58,554 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:34:58,555 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:34:58,555 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:34:58,556 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:34:58,556 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:34:58,556 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:34:58,556 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:34:58,556 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:34:58,556 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:34:58,556 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:34:58,557 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:34:58,557 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:34:58,557 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:34:58,557 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:34:58,557 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:34:58,557 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:34:58,557 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:34:58,558 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:34:58,558 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:34:58,558 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:34:58,558 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:34:58,558 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:34:58,558 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:34:58,558 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:34:58,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:34:58,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:34:58,559 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:34:58,559 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:34:58,560 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:34:58,560 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 -> 51aa0675891000edd5d1736f3584d06816ce7050b76c01d5b217260a35077c25 [2022-02-21 04:34:58,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:34:58,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:34:58,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:34:58,797 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:34:58,798 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:34:58,799 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.i [2022-02-21 04:34:58,864 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28283edf1/508ac314b50c4c98afc8c81ea3a947b4/FLAG7fd6a2b22 [2022-02-21 04:34:59,252 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:34:59,253 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.i [2022-02-21 04:34:59,261 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28283edf1/508ac314b50c4c98afc8c81ea3a947b4/FLAG7fd6a2b22 [2022-02-21 04:34:59,275 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28283edf1/508ac314b50c4c98afc8c81ea3a947b4 [2022-02-21 04:34:59,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:34:59,278 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:34:59,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:34:59,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:34:59,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:34:59,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:34:59" (1/1) ... [2022-02-21 04:34:59,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d543819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:59, skipping insertion in model container [2022-02-21 04:34:59,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:34:59" (1/1) ... [2022-02-21 04:34:59,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:34:59,329 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:34:59,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:34:59,674 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:34:59,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:34:59,737 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:34:59,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:59 WrapperNode [2022-02-21 04:34:59,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:34:59,738 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:34:59,738 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:34:59,738 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:34:59,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:59" (1/1) ... [2022-02-21 04:34:59,750 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:59" (1/1) ... [2022-02-21 04:34:59,766 INFO L137 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 108 [2022-02-21 04:34:59,767 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:34:59,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:34:59,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:34:59,767 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:34:59,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:59" (1/1) ... [2022-02-21 04:34:59,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:59" (1/1) ... [2022-02-21 04:34:59,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:59" (1/1) ... [2022-02-21 04:34:59,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:59" (1/1) ... [2022-02-21 04:34:59,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:59" (1/1) ... [2022-02-21 04:34:59,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:59" (1/1) ... [2022-02-21 04:34:59,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:59" (1/1) ... [2022-02-21 04:34:59,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:34:59,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:34:59,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:34:59,784 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:34:59,785 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:59" (1/1) ... [2022-02-21 04:34:59,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:59,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:59,805 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:59,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 04:34:59,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 04:34:59,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 04:34:59,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 04:34:59,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 04:34:59,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:34:59,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:34:59,897 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:34:59,899 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:35:00,196 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:35:00,200 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:35:00,203 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-21 04:35:00,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:00 BoogieIcfgContainer [2022-02-21 04:35:00,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:35:00,205 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:35:00,205 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:35:00,208 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:35:00,208 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:00,208 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:34:59" (1/3) ... [2022-02-21 04:35:00,209 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5add4c3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:00, skipping insertion in model container [2022-02-21 04:35:00,209 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:00,209 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:59" (2/3) ... [2022-02-21 04:35:00,209 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5add4c3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:00, skipping insertion in model container [2022-02-21 04:35:00,209 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:00,210 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:00" (3/3) ... [2022-02-21 04:35:00,210 INFO L388 chiAutomizerObserver]: Analyzing ICFG cstrncmp-alloca-1.i [2022-02-21 04:35:00,270 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:35:00,270 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:35:00,270 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:35:00,270 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:35:00,271 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:35:00,271 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:35:00,271 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:35:00,271 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:35:00,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 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:00,311 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 04:35:00,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:00,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:00,316 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:35:00,316 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:00,316 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:35:00,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 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:00,322 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 04:35:00,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:00,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:00,323 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:35:00,323 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:00,328 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~nondet18#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet20#1, main_#t~post19#1, main_~i~1#1, main_#t~nondet21#1, main_#t~ret22#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~nondet13#1;havoc main_#t~nondet13#1;main_~length2~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 10#L532true assume !(main_~length1~0#1 < 1); 6#L532-2true assume !(main_~length2~0#1 < 1); 3#L535-1true call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;main_~i~0#1 := 0; 22#L541-3true [2022-02-21 04:35:00,329 INFO L793 eck$LassoCheckResult]: Loop: 22#L541-3true assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet18#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet18#1; 25#L541-2true main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 22#L541-3true [2022-02-21 04:35:00,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:00,337 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-02-21 04:35:00,346 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:00,346 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610182483] [2022-02-21 04:35:00,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:00,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:00,446 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:00,466 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:00,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:00,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2022-02-21 04:35:00,469 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:00,469 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211959417] [2022-02-21 04:35:00,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:00,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:00,480 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:00,487 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:00,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:00,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2022-02-21 04:35:00,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:00,489 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551848268] [2022-02-21 04:35:00,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:00,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:00,509 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:00,524 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:00,911 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:00,911 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:00,912 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:00,912 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:00,912 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:00,912 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:00,912 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:00,912 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:00,913 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncmp-alloca-1.i_Iteration1_Lasso [2022-02-21 04:35:00,913 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:00,913 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:00,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:00,935 INFO L141 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:00,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:00,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:00,947 INFO L141 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:00,950 INFO L141 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:00,954 INFO L141 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:00,956 INFO L141 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:00,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:00,966 INFO L141 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:00,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:00,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:01,144 INFO L141 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:01,149 INFO L141 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:01,151 INFO L141 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:01,154 INFO L141 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:01,487 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:01,490 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:01,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:01,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:01,519 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:01,544 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:01,545 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:01,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:01,553 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:01,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:01,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:01,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:01,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:01,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:01,572 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:01,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:01,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:01,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:01,607 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:01,609 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:01,610 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:01,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:01,617 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:01,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:01,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:01,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:01,618 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:01,618 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:01,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:01,655 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:01,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:01,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:01,657 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:01,658 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:01,660 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:01,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:01,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:01,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:01,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:01,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:01,668 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:01,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:01,668 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:01,687 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:01,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:01,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:01,689 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:01,690 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:01,692 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:01,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:01,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:01,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:01,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:01,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:01,701 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:01,713 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:01,731 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:01,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:01,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:01,733 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:01,734 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:01,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:01,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:01,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:01,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:01,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:01,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:01,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:01,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:01,747 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:01,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:01,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:01,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:01,767 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:01,778 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:01,778 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:01,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:01,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:01,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:01,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:01,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:01,788 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:01,796 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:01,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:01,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:01,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:01,816 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:01,817 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:01,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:01,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:01,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:01,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:01,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:01,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:01,829 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:01,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:01,831 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:01,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-02-21 04:35:01,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:01,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:01,849 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:01,850 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:01,851 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:01,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:01,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:01,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:01,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:01,861 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:01,861 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:01,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:01,894 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:01,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:01,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:01,895 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:01,896 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:01,898 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:01,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:01,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:01,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:01,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:01,915 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:01,915 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:01,930 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:01,947 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:01,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:01,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:01,948 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:01,950 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:01,951 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:01,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:01,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:01,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:01,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:01,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:01,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:01,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:01,970 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:01,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:01,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:01,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:01,993 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:01,994 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:01,995 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:02,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:02,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:02,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:02,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:02,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:02,005 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:02,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:02,006 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:02,021 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:02,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:02,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:02,023 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:02,024 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:02,025 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:02,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:02,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:02,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:02,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:02,038 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:02,038 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:02,059 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:02,086 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-02-21 04:35:02,086 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-02-21 04:35:02,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:02,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:02,089 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:02,134 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:02,140 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:02,150 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:02,150 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:02,150 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nondetString1~0#1.offset, ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1) = -1*ULTIMATE.start_main_~nondetString1~0#1.offset - 1*ULTIMATE.start_main_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1 Supporting invariants [] [2022-02-21 04:35:02,170 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:02,195 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 04:35:02,199 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet18#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet18#1;" "main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" [2022-02-21 04:35:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:02,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:02,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:35:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:02,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:02,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {34#unseeded} is VALID [2022-02-21 04:35:02,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~nondet18#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet20#1, main_#t~post19#1, main_~i~1#1, main_#t~nondet21#1, main_#t~ret22#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~nondet13#1;havoc main_#t~nondet13#1;main_~length2~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {34#unseeded} is VALID [2022-02-21 04:35:02,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#unseeded} assume !(main_~length1~0#1 < 1); {34#unseeded} is VALID [2022-02-21 04:35:02,255 INFO L290 TraceCheckUtils]: 3: Hoare triple {34#unseeded} assume !(main_~length2~0#1 < 1); {34#unseeded} is VALID [2022-02-21 04:35:02,255 INFO L290 TraceCheckUtils]: 4: Hoare triple {34#unseeded} call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;main_~i~0#1 := 0; {34#unseeded} is VALID [2022-02-21 04:35:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:02,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:35:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:02,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:02,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (* (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|)))} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet18#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet18#1; {94#(and (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~i~0#1| 1) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (* (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))))} is VALID [2022-02-21 04:35:02,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {94#(and (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~i~0#1| 1) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (* (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))))} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {77#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (* (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|)))))} is VALID [2022-02-21 04:35:02,285 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:02,305 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:02,311 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:02,313 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:02,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,317 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:02,318 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 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:02,423 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 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 60 states and 91 transitions. Complement of second has 7 states. [2022-02-21 04:35:02,424 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:02,424 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:02,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 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:02,426 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 04:35:02,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:02,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:02,426 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:02,430 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:02,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:02,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:02,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 91 transitions. [2022-02-21 04:35:02,432 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 04:35:02,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:02,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:02,434 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 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:02,435 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 04:35:02,436 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 04:35:02,437 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:02,438 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:02,439 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:35:02,439 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 60 states and 91 transitions. cyclomatic complexity: 38 [2022-02-21 04:35:02,440 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 04:35:02,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:02,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,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 5 letters. Loop has 2 letters. [2022-02-21 04:35:02,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:02,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:02,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,442 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:02,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:02,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:02,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,443 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:02,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:02,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 60 letters. [2022-02-21 04:35:02,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,444 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 60 letters. Loop has 60 letters. [2022-02-21 04:35:02,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 60 letters. Loop has 60 letters. [2022-02-21 04:35:02,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 24 letters. [2022-02-21 04:35:02,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 24 letters. [2022-02-21 04:35:02,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 24 letters. Loop has 24 letters. [2022-02-21 04:35:02,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:02,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,446 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:02,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:02,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:02,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 5 letters. [2022-02-21 04:35:02,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 14 letters. Loop has 5 letters. [2022-02-21 04:35:02,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:02,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,448 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:02,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 12 letters. Loop has 5 letters. [2022-02-21 04:35:02,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:02,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,449 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:02,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 10 letters. Loop has 5 letters. [2022-02-21 04:35:02,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:02,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,450 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:02,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 13 letters. Loop has 5 letters. [2022-02-21 04:35:02,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:02,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,451 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:02,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 11 letters. Loop has 5 letters. [2022-02-21 04:35:02,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:02,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,452 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:02,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:02,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:02,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,453 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:02,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:02,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:02,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,454 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:02,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:02,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:02,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,455 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:02,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:02,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:02,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,456 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:02,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:02,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:02,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,457 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:02,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:02,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:02,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 5 letters. [2022-02-21 04:35:02,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 14 letters. Loop has 5 letters. [2022-02-21 04:35:02,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:02,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,459 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:02,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 12 letters. Loop has 5 letters. [2022-02-21 04:35:02,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:02,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,460 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:02,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 10 letters. Loop has 5 letters. [2022-02-21 04:35:02,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:02,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,461 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:02,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 13 letters. Loop has 5 letters. [2022-02-21 04:35:02,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:02,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,462 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:02,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 11 letters. Loop has 5 letters. [2022-02-21 04:35:02,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:02,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,463 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:02,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:02,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:02,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,465 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:02,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:02,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,465 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:02,469 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:02,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-02-21 04:35:02,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:02,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:02,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 04:35:02,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:02,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 91 transitions. cyclomatic complexity: 38 [2022-02-21 04:35:02,474 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 04:35:02,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 18 states and 25 transitions. [2022-02-21 04:35:02,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-02-21 04:35:02,477 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-02-21 04:35:02,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2022-02-21 04:35:02,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:02,478 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 04:35:02,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2022-02-21 04:35:02,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-21 04:35:02,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:02,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 25 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:02,495 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 25 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:02,497 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:02,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:02,500 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-02-21 04:35:02,500 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2022-02-21 04:35:02,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:02,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:02,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states and 25 transitions. [2022-02-21 04:35:02,501 INFO L87 Difference]: Start difference. First operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states and 25 transitions. [2022-02-21 04:35:02,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:02,502 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-02-21 04:35:02,502 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2022-02-21 04:35:02,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:02,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:02,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:02,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:02,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:02,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2022-02-21 04:35:02,504 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 04:35:02,504 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 04:35:02,504 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:35:02,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2022-02-21 04:35:02,505 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 04:35:02,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:02,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:02,505 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:02,505 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:02,505 INFO L791 eck$LassoCheckResult]: Stem: 170#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 171#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~nondet18#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet20#1, main_#t~post19#1, main_~i~1#1, main_#t~nondet21#1, main_#t~ret22#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~nondet13#1;havoc main_#t~nondet13#1;main_~length2~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 178#L532 assume !(main_~length1~0#1 < 1); 172#L532-2 assume !(main_~length2~0#1 < 1); 168#L535-1 call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;main_~i~0#1 := 0; 169#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 179#L541-4 main_~i~1#1 := 0; 175#L546-3 [2022-02-21 04:35:02,506 INFO L793 eck$LassoCheckResult]: Loop: 175#L546-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet20#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet20#1; 177#L546-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 175#L546-3 [2022-02-21 04:35:02,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:02,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2022-02-21 04:35:02,506 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:02,507 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337949752] [2022-02-21 04:35:02,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:02,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:02,519 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:02,526 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:02,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:02,526 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2022-02-21 04:35:02,527 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:02,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49299990] [2022-02-21 04:35:02,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:02,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:02,546 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:02,549 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:02,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:02,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2022-02-21 04:35:02,550 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:02,550 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353686276] [2022-02-21 04:35:02,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:02,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:02,562 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:02,571 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:02,736 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:02,815 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:02,815 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:02,815 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:02,815 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:02,815 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:02,816 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:02,816 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:02,816 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:02,816 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncmp-alloca-1.i_Iteration2_Lasso [2022-02-21 04:35:02,816 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:02,816 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:02,818 INFO L141 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:02,961 INFO L141 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:02,964 INFO L141 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:02,966 INFO L141 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:02,970 INFO L141 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:02,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:02,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:02,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:02,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:02,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:02,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:02,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:02,987 INFO L141 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:02,988 INFO L141 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:02,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:03,266 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:03,267 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:03,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:03,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:03,268 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:03,269 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:03,271 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:03,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:03,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:03,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:03,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:03,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:03,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:03,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:03,293 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:03,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:03,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:03,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:03,340 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:03,341 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:03,342 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:03,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:03,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:03,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:03,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:03,350 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:03,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:03,366 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:03,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:03,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:03,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:03,386 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:03,387 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:03,388 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:03,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:03,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:03,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:03,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:03,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:03,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:03,411 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:03,430 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:03,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:03,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:03,431 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:03,432 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:03,434 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:03,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:03,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:03,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:03,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:03,443 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:03,443 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:03,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:03,477 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:03,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:03,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:03,479 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:03,480 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:03,482 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:03,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:03,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:03,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:03,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:03,491 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:03,491 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:03,506 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:03,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:03,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:03,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:03,524 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:03,525 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:03,526 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:03,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:03,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:03,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:03,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:03,534 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:03,534 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:03,549 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:03,566 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:03,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:03,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:03,567 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:03,568 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:03,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:03,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:03,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:03,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:03,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:03,580 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:03,580 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:03,596 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:03,609 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-02-21 04:35:03,609 INFO L444 ModelExtractionUtils]: 9 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-02-21 04:35:03,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:03,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:03,620 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:03,622 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:03,623 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:03,652 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:03,652 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:03,652 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nondetString2~0#1.offset, ULTIMATE.start_main_~i~1#1, v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_1) = -1*ULTIMATE.start_main_~nondetString2~0#1.offset - 1*ULTIMATE.start_main_~i~1#1 + 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_1 Supporting invariants [] [2022-02-21 04:35:03,670 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:03,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:03,713 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 04:35:03,717 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet20#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet20#1;" "main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" [2022-02-21 04:35:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:03,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:03,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:35:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:03,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:03,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {231#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {231#unseeded} is VALID [2022-02-21 04:35:03,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~nondet18#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet20#1, main_#t~post19#1, main_~i~1#1, main_#t~nondet21#1, main_#t~ret22#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~nondet13#1;havoc main_#t~nondet13#1;main_~length2~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {231#unseeded} is VALID [2022-02-21 04:35:03,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#unseeded} assume !(main_~length1~0#1 < 1); {231#unseeded} is VALID [2022-02-21 04:35:03,765 INFO L290 TraceCheckUtils]: 3: Hoare triple {231#unseeded} assume !(main_~length2~0#1 < 1); {231#unseeded} is VALID [2022-02-21 04:35:03,765 INFO L290 TraceCheckUtils]: 4: Hoare triple {231#unseeded} call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;main_~i~0#1 := 0; {231#unseeded} is VALID [2022-02-21 04:35:03,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#unseeded} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {231#unseeded} is VALID [2022-02-21 04:35:03,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {231#unseeded} main_~i~1#1 := 0; {231#unseeded} is VALID [2022-02-21 04:35:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:03,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:35:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:03,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:03,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {234#(>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset|) (* (- 1) |ULTIMATE.start_main_~i~1#1|)))} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet20#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet20#1; {297#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset|) (* (- 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|)))} is VALID [2022-02-21 04:35:03,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {297#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset|) (* (- 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|)))} main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {274#(or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset|) (* (- 1) |ULTIMATE.start_main_~i~1#1|)))) unseeded)} is VALID [2022-02-21 04:35:03,794 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:03,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:03,800 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:03,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:03,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,800 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:03,800 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:03,873 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 27 states and 40 transitions. Complement of second has 6 states. [2022-02-21 04:35:03,873 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:03,873 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:03,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. cyclomatic complexity: 10 [2022-02-21 04:35:03,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:03,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:03,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:03,874 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:03,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:03,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:03,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 40 transitions. [2022-02-21 04:35:03,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:35:03,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:03,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:03,875 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 25 transitions. cyclomatic complexity: 10 [2022-02-21 04:35:03,876 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 04:35:03,876 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:03,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:03,877 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:03,877 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 40 transitions. cyclomatic complexity: 17 [2022-02-21 04:35:03,878 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 04:35:03,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:03,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:03,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:03,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:03,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:03,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:03,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 5 letters. [2022-02-21 04:35:03,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 5 letters. [2022-02-21 04:35:03,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 5 letters. [2022-02-21 04:35:03,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 27 letters. Loop has 27 letters. [2022-02-21 04:35:03,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 27 letters. [2022-02-21 04:35:03,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 27 letters. Loop has 27 letters. [2022-02-21 04:35:03,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 18 letters. [2022-02-21 04:35:03,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 18 letters. [2022-02-21 04:35:03,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 18 letters. Loop has 18 letters. [2022-02-21 04:35:03,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:03,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:03,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:03,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 5 letters. [2022-02-21 04:35:03,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 5 letters. [2022-02-21 04:35:03,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 5 letters. [2022-02-21 04:35:03,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 5 letters. [2022-02-21 04:35:03,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 5 letters. [2022-02-21 04:35:03,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 5 letters. [2022-02-21 04:35:03,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 5 letters. [2022-02-21 04:35:03,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 5 letters. [2022-02-21 04:35:03,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 5 letters. [2022-02-21 04:35:03,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 5 letters. [2022-02-21 04:35:03,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 5 letters. [2022-02-21 04:35:03,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 5 letters. [2022-02-21 04:35:03,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 5 letters. [2022-02-21 04:35:03,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 5 letters. [2022-02-21 04:35:03,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 5 letters. [2022-02-21 04:35:03,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:03,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:03,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:03,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:03,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:03,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:03,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:03,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:03,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:03,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 5 letters. [2022-02-21 04:35:03,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 5 letters. [2022-02-21 04:35:03,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 5 letters. [2022-02-21 04:35:03,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 5 letters. [2022-02-21 04:35:03,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 5 letters. [2022-02-21 04:35:03,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 5 letters. [2022-02-21 04:35:03,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 5 letters. [2022-02-21 04:35:03,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 5 letters. [2022-02-21 04:35:03,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 5 letters. [2022-02-21 04:35:03,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 5 letters. [2022-02-21 04:35:03,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 5 letters. [2022-02-21 04:35:03,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 5 letters. [2022-02-21 04:35:03,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 5 letters. [2022-02-21 04:35:03,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 5 letters. [2022-02-21 04:35:03,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 5 letters. [2022-02-21 04:35:03,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,903 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:03,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:03,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-02-21 04:35:03,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:03,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:03,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:35:03,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 40 transitions. cyclomatic complexity: 17 [2022-02-21 04:35:03,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:35:03,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 19 states and 27 transitions. [2022-02-21 04:35:03,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 04:35:03,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-02-21 04:35:03,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 27 transitions. [2022-02-21 04:35:03,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:03,906 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2022-02-21 04:35:03,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 27 transitions. [2022-02-21 04:35:03,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-21 04:35:03,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:03,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 27 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:03,907 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 27 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:03,907 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:03,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:03,908 INFO L93 Difference]: Finished difference Result 19 states and 27 transitions. [2022-02-21 04:35:03,908 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 27 transitions. [2022-02-21 04:35:03,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:03,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:03,908 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states and 27 transitions. [2022-02-21 04:35:03,908 INFO L87 Difference]: Start difference. First operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states and 27 transitions. [2022-02-21 04:35:03,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:03,913 INFO L93 Difference]: Finished difference Result 19 states and 27 transitions. [2022-02-21 04:35:03,913 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 27 transitions. [2022-02-21 04:35:03,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:03,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:03,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:03,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:03,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:03,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2022-02-21 04:35:03,914 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2022-02-21 04:35:03,914 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2022-02-21 04:35:03,914 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:35:03,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2022-02-21 04:35:03,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:35:03,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:03,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:03,915 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:03,915 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 04:35:03,915 INFO L791 eck$LassoCheckResult]: Stem: 339#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 340#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~nondet18#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet20#1, main_#t~post19#1, main_~i~1#1, main_#t~nondet21#1, main_#t~ret22#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~nondet13#1;havoc main_#t~nondet13#1;main_~length2~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 348#L532 assume !(main_~length1~0#1 < 1); 341#L532-2 assume !(main_~length2~0#1 < 1); 337#L535-1 call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;main_~i~0#1 := 0; 338#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 351#L541-4 main_~i~1#1 := 0; 344#L546-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 345#L546-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_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_#t~nondet21#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem6#1, cstrncmp_#t~short7#1, cstrncmp_#t~post8#1.base, cstrncmp_#t~post8#1.offset, cstrncmp_#t~post9#1.base, cstrncmp_#t~post9#1.offset, cstrncmp_#t~post2#1, cstrncmp_#t~mem3#1, cstrncmp_#t~mem4#1, cstrncmp_#t~short5#1, cstrncmp_#t~mem10#1, cstrncmp_#t~mem11#1, cstrncmp_#t~ite12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1, cstrncmp_~uc1~0#1, cstrncmp_~uc2~0#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;havoc cstrncmp_~uc1~0#1;havoc cstrncmp_~uc2~0#1; 352#L517 assume !(0 == cstrncmp_~n#1); 342#L519-5 [2022-02-21 04:35:03,915 INFO L793 eck$LassoCheckResult]: Loop: 342#L519-5 cstrncmp_#t~post2#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post2#1 - 1;cstrncmp_#t~short5#1 := cstrncmp_#t~post2#1 > 0; 343#L519-1 assume cstrncmp_#t~short5#1;call cstrncmp_#t~mem3#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);call cstrncmp_#t~mem4#1 := read~int(cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, 1);cstrncmp_#t~short5#1 := cstrncmp_#t~mem3#1 == cstrncmp_#t~mem4#1; 353#L519-3 assume !!cstrncmp_#t~short5#1;havoc cstrncmp_#t~post2#1;havoc cstrncmp_#t~mem3#1;havoc cstrncmp_#t~mem4#1;havoc cstrncmp_#t~short5#1;cstrncmp_#t~short7#1 := 0 == cstrncmp_~n#1; 349#L520 assume cstrncmp_#t~short7#1; 350#L520-2 assume !cstrncmp_#t~short7#1;havoc cstrncmp_#t~mem6#1;havoc cstrncmp_#t~short7#1;cstrncmp_#t~post8#1.base, cstrncmp_#t~post8#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post8#1.base, 1 + cstrncmp_#t~post8#1.offset;havoc cstrncmp_#t~post8#1.base, cstrncmp_#t~post8#1.offset;cstrncmp_#t~post9#1.base, cstrncmp_#t~post9#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post9#1.base, 1 + cstrncmp_#t~post9#1.offset;havoc cstrncmp_#t~post9#1.base, cstrncmp_#t~post9#1.offset; 342#L519-5 [2022-02-21 04:35:03,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:03,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1595220890, now seen corresponding path program 1 times [2022-02-21 04:35:03,916 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:03,916 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80724331] [2022-02-21 04:35:03,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:03,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:03,935 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:03,946 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:03,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:03,947 INFO L85 PathProgramCache]: Analyzing trace with hash 79307716, now seen corresponding path program 1 times [2022-02-21 04:35:03,947 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:03,947 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774599287] [2022-02-21 04:35:03,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:03,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:03,971 INFO L290 TraceCheckUtils]: 0: Hoare triple {399#true} cstrncmp_#t~post2#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post2#1 - 1;cstrncmp_#t~short5#1 := cstrncmp_#t~post2#1 > 0; {399#true} is VALID [2022-02-21 04:35:03,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {399#true} assume cstrncmp_#t~short5#1;call cstrncmp_#t~mem3#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);call cstrncmp_#t~mem4#1 := read~int(cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, 1);cstrncmp_#t~short5#1 := cstrncmp_#t~mem3#1 == cstrncmp_#t~mem4#1; {399#true} is VALID [2022-02-21 04:35:03,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {399#true} assume !!cstrncmp_#t~short5#1;havoc cstrncmp_#t~post2#1;havoc cstrncmp_#t~mem3#1;havoc cstrncmp_#t~mem4#1;havoc cstrncmp_#t~short5#1;cstrncmp_#t~short7#1 := 0 == cstrncmp_~n#1; {399#true} is VALID [2022-02-21 04:35:03,972 INFO L290 TraceCheckUtils]: 3: Hoare triple {399#true} assume cstrncmp_#t~short7#1; {401#|ULTIMATE.start_cstrncmp_#t~short7#1|} is VALID [2022-02-21 04:35:03,972 INFO L290 TraceCheckUtils]: 4: Hoare triple {401#|ULTIMATE.start_cstrncmp_#t~short7#1|} assume !cstrncmp_#t~short7#1;havoc cstrncmp_#t~mem6#1;havoc cstrncmp_#t~short7#1;cstrncmp_#t~post8#1.base, cstrncmp_#t~post8#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post8#1.base, 1 + cstrncmp_#t~post8#1.offset;havoc cstrncmp_#t~post8#1.base, cstrncmp_#t~post8#1.offset;cstrncmp_#t~post9#1.base, cstrncmp_#t~post9#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post9#1.base, 1 + cstrncmp_#t~post9#1.offset;havoc cstrncmp_#t~post9#1.base, cstrncmp_#t~post9#1.offset; {400#false} is VALID [2022-02-21 04:35:03,973 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:03,973 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:03,973 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774599287] [2022-02-21 04:35:03,974 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774599287] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:03,974 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:03,974 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 04:35:03,974 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531181005] [2022-02-21 04:35:03,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:03,976 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:35:03,976 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:03,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:35:03,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:35:03,979 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. cyclomatic complexity: 11 Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:04,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:04,002 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2022-02-21 04:35:04,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:35:04,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:04,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:04,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2022-02-21 04:35:04,007 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:35:04,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 26 transitions. [2022-02-21 04:35:04,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-02-21 04:35:04,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-02-21 04:35:04,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2022-02-21 04:35:04,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:04,008 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-02-21 04:35:04,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2022-02-21 04:35:04,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-21 04:35:04,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:04,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 26 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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:04,009 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 26 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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:04,009 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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:04,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:04,010 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2022-02-21 04:35:04,010 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2022-02-21 04:35:04,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:04,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:04,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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 19 states and 26 transitions. [2022-02-21 04:35:04,010 INFO L87 Difference]: Start difference. First operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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 19 states and 26 transitions. [2022-02-21 04:35:04,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:04,011 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2022-02-21 04:35:04,011 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2022-02-21 04:35:04,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:04,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:04,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:04,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:04,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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:04,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2022-02-21 04:35:04,012 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-02-21 04:35:04,012 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-02-21 04:35:04,012 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:35:04,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2022-02-21 04:35:04,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:35:04,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:04,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:04,012 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:04,012 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 04:35:04,012 INFO L791 eck$LassoCheckResult]: Stem: 424#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 425#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~nondet18#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet20#1, main_#t~post19#1, main_~i~1#1, main_#t~nondet21#1, main_#t~ret22#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~nondet13#1;havoc main_#t~nondet13#1;main_~length2~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 433#L532 assume !(main_~length1~0#1 < 1); 426#L532-2 assume !(main_~length2~0#1 < 1); 422#L535-1 call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;main_~i~0#1 := 0; 423#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 436#L541-4 main_~i~1#1 := 0; 429#L546-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 430#L546-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_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_#t~nondet21#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem6#1, cstrncmp_#t~short7#1, cstrncmp_#t~post8#1.base, cstrncmp_#t~post8#1.offset, cstrncmp_#t~post9#1.base, cstrncmp_#t~post9#1.offset, cstrncmp_#t~post2#1, cstrncmp_#t~mem3#1, cstrncmp_#t~mem4#1, cstrncmp_#t~short5#1, cstrncmp_#t~mem10#1, cstrncmp_#t~mem11#1, cstrncmp_#t~ite12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1, cstrncmp_~uc1~0#1, cstrncmp_~uc2~0#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;havoc cstrncmp_~uc1~0#1;havoc cstrncmp_~uc2~0#1; 437#L517 assume !(0 == cstrncmp_~n#1); 427#L519-5 [2022-02-21 04:35:04,012 INFO L793 eck$LassoCheckResult]: Loop: 427#L519-5 cstrncmp_#t~post2#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post2#1 - 1;cstrncmp_#t~short5#1 := cstrncmp_#t~post2#1 > 0; 428#L519-1 assume cstrncmp_#t~short5#1;call cstrncmp_#t~mem3#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);call cstrncmp_#t~mem4#1 := read~int(cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, 1);cstrncmp_#t~short5#1 := cstrncmp_#t~mem3#1 == cstrncmp_#t~mem4#1; 438#L519-3 assume !!cstrncmp_#t~short5#1;havoc cstrncmp_#t~post2#1;havoc cstrncmp_#t~mem3#1;havoc cstrncmp_#t~mem4#1;havoc cstrncmp_#t~short5#1;cstrncmp_#t~short7#1 := 0 == cstrncmp_~n#1; 434#L520 assume !cstrncmp_#t~short7#1;call cstrncmp_#t~mem6#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~short7#1 := 0 == cstrncmp_#t~mem6#1; 435#L520-2 assume !cstrncmp_#t~short7#1;havoc cstrncmp_#t~mem6#1;havoc cstrncmp_#t~short7#1;cstrncmp_#t~post8#1.base, cstrncmp_#t~post8#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post8#1.base, 1 + cstrncmp_#t~post8#1.offset;havoc cstrncmp_#t~post8#1.base, cstrncmp_#t~post8#1.offset;cstrncmp_#t~post9#1.base, cstrncmp_#t~post9#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post9#1.base, 1 + cstrncmp_#t~post9#1.offset;havoc cstrncmp_#t~post9#1.base, cstrncmp_#t~post9#1.offset; 427#L519-5 [2022-02-21 04:35:04,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:04,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1595220890, now seen corresponding path program 2 times [2022-02-21 04:35:04,013 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:04,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230866958] [2022-02-21 04:35:04,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:04,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:04,039 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:04,049 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:04,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:04,049 INFO L85 PathProgramCache]: Analyzing trace with hash 79307778, now seen corresponding path program 1 times [2022-02-21 04:35:04,049 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:04,049 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264030609] [2022-02-21 04:35:04,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:04,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:04,060 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:04,065 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:04,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:04,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1988601847, now seen corresponding path program 1 times [2022-02-21 04:35:04,065 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:04,065 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939374700] [2022-02-21 04:35:04,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:04,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:04,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {486#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {486#true} is VALID [2022-02-21 04:35:04,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {486#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~nondet18#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet20#1, main_#t~post19#1, main_~i~1#1, main_#t~nondet21#1, main_#t~ret22#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~nondet13#1;havoc main_#t~nondet13#1;main_~length2~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {486#true} is VALID [2022-02-21 04:35:04,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {486#true} assume !(main_~length1~0#1 < 1); {488#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:35:04,201 INFO L290 TraceCheckUtils]: 3: Hoare triple {488#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} assume !(main_~length2~0#1 < 1); {488#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:35:04,202 INFO L290 TraceCheckUtils]: 4: Hoare triple {488#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;main_~i~0#1 := 0; {489#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)))} is VALID [2022-02-21 04:35:04,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {489#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {490#(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:04,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {490#(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; {490#(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:04,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {490#(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); {490#(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:04,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {490#(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_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_#t~nondet21#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem6#1, cstrncmp_#t~short7#1, cstrncmp_#t~post8#1.base, cstrncmp_#t~post8#1.offset, cstrncmp_#t~post9#1.base, cstrncmp_#t~post9#1.offset, cstrncmp_#t~post2#1, cstrncmp_#t~mem3#1, cstrncmp_#t~mem4#1, cstrncmp_#t~short5#1, cstrncmp_#t~mem10#1, cstrncmp_#t~mem11#1, cstrncmp_#t~ite12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1, cstrncmp_~uc1~0#1, cstrncmp_~uc2~0#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;havoc cstrncmp_~uc1~0#1;havoc cstrncmp_~uc2~0#1; {491#(= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s1#1.base|) |ULTIMATE.start_cstrncmp_~s1#1.offset|) 0)} is VALID [2022-02-21 04:35:04,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {491#(= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s1#1.base|) |ULTIMATE.start_cstrncmp_~s1#1.offset|) 0)} assume !(0 == cstrncmp_~n#1); {491#(= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s1#1.base|) |ULTIMATE.start_cstrncmp_~s1#1.offset|) 0)} is VALID [2022-02-21 04:35:04,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {491#(= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s1#1.base|) |ULTIMATE.start_cstrncmp_~s1#1.offset|) 0)} cstrncmp_#t~post2#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post2#1 - 1;cstrncmp_#t~short5#1 := cstrncmp_#t~post2#1 > 0; {491#(= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s1#1.base|) |ULTIMATE.start_cstrncmp_~s1#1.offset|) 0)} is VALID [2022-02-21 04:35:04,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {491#(= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s1#1.base|) |ULTIMATE.start_cstrncmp_~s1#1.offset|) 0)} assume cstrncmp_#t~short5#1;call cstrncmp_#t~mem3#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);call cstrncmp_#t~mem4#1 := read~int(cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, 1);cstrncmp_#t~short5#1 := cstrncmp_#t~mem3#1 == cstrncmp_#t~mem4#1; {491#(= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s1#1.base|) |ULTIMATE.start_cstrncmp_~s1#1.offset|) 0)} is VALID [2022-02-21 04:35:04,206 INFO L290 TraceCheckUtils]: 12: Hoare triple {491#(= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s1#1.base|) |ULTIMATE.start_cstrncmp_~s1#1.offset|) 0)} assume !!cstrncmp_#t~short5#1;havoc cstrncmp_#t~post2#1;havoc cstrncmp_#t~mem3#1;havoc cstrncmp_#t~mem4#1;havoc cstrncmp_#t~short5#1;cstrncmp_#t~short7#1 := 0 == cstrncmp_~n#1; {491#(= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s1#1.base|) |ULTIMATE.start_cstrncmp_~s1#1.offset|) 0)} is VALID [2022-02-21 04:35:04,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {491#(= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s1#1.base|) |ULTIMATE.start_cstrncmp_~s1#1.offset|) 0)} assume !cstrncmp_#t~short7#1;call cstrncmp_#t~mem6#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~short7#1 := 0 == cstrncmp_#t~mem6#1; {492#|ULTIMATE.start_cstrncmp_#t~short7#1|} is VALID [2022-02-21 04:35:04,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {492#|ULTIMATE.start_cstrncmp_#t~short7#1|} assume !cstrncmp_#t~short7#1;havoc cstrncmp_#t~mem6#1;havoc cstrncmp_#t~short7#1;cstrncmp_#t~post8#1.base, cstrncmp_#t~post8#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post8#1.base, 1 + cstrncmp_#t~post8#1.offset;havoc cstrncmp_#t~post8#1.base, cstrncmp_#t~post8#1.offset;cstrncmp_#t~post9#1.base, cstrncmp_#t~post9#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post9#1.base, 1 + cstrncmp_#t~post9#1.offset;havoc cstrncmp_#t~post9#1.base, cstrncmp_#t~post9#1.offset; {487#false} is VALID [2022-02-21 04:35:04,207 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:04,208 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:04,208 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939374700] [2022-02-21 04:35:04,208 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939374700] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:04,208 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:04,208 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-21 04:35:04,208 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316704722] [2022-02-21 04:35:04,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:04,413 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:04,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 04:35:04,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-21 04:35:04,414 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:04,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:04,548 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-02-21 04:35:04,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 04:35:04,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:04,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:04,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2022-02-21 04:35:04,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:35:04,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 26 transitions. [2022-02-21 04:35:04,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-02-21 04:35:04,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-02-21 04:35:04,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2022-02-21 04:35:04,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:04,564 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-02-21 04:35:04,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2022-02-21 04:35:04,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-02-21 04:35:04,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:04,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 26 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:04,565 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 26 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:04,565 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:04,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:04,566 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2022-02-21 04:35:04,566 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-02-21 04:35:04,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:04,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:04,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states and 26 transitions. [2022-02-21 04:35:04,566 INFO L87 Difference]: Start difference. First operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states and 26 transitions. [2022-02-21 04:35:04,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:04,567 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2022-02-21 04:35:04,567 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-02-21 04:35:04,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:04,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:04,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:04,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:04,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:04,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2022-02-21 04:35:04,568 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-02-21 04:35:04,568 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-02-21 04:35:04,568 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:35:04,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2022-02-21 04:35:04,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:35:04,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:04,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:04,568 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:04,568 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 04:35:04,569 INFO L791 eck$LassoCheckResult]: Stem: 530#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 531#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~nondet18#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet20#1, main_#t~post19#1, main_~i~1#1, main_#t~nondet21#1, main_#t~ret22#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~nondet13#1;havoc main_#t~nondet13#1;main_~length2~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 539#L532 assume !(main_~length1~0#1 < 1); 532#L532-2 assume !(main_~length2~0#1 < 1); 528#L535-1 call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;main_~i~0#1 := 0; 529#L541-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet18#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet18#1; 545#L541-2 main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 546#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 543#L541-4 main_~i~1#1 := 0; 535#L546-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 536#L546-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_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_#t~nondet21#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem6#1, cstrncmp_#t~short7#1, cstrncmp_#t~post8#1.base, cstrncmp_#t~post8#1.offset, cstrncmp_#t~post9#1.base, cstrncmp_#t~post9#1.offset, cstrncmp_#t~post2#1, cstrncmp_#t~mem3#1, cstrncmp_#t~mem4#1, cstrncmp_#t~short5#1, cstrncmp_#t~mem10#1, cstrncmp_#t~mem11#1, cstrncmp_#t~ite12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1, cstrncmp_~uc1~0#1, cstrncmp_~uc2~0#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;havoc cstrncmp_~uc1~0#1;havoc cstrncmp_~uc2~0#1; 540#L517 assume !(0 == cstrncmp_~n#1); 533#L519-5 [2022-02-21 04:35:04,569 INFO L793 eck$LassoCheckResult]: Loop: 533#L519-5 cstrncmp_#t~post2#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post2#1 - 1;cstrncmp_#t~short5#1 := cstrncmp_#t~post2#1 > 0; 534#L519-1 assume cstrncmp_#t~short5#1;call cstrncmp_#t~mem3#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);call cstrncmp_#t~mem4#1 := read~int(cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, 1);cstrncmp_#t~short5#1 := cstrncmp_#t~mem3#1 == cstrncmp_#t~mem4#1; 544#L519-3 assume !!cstrncmp_#t~short5#1;havoc cstrncmp_#t~post2#1;havoc cstrncmp_#t~mem3#1;havoc cstrncmp_#t~mem4#1;havoc cstrncmp_#t~short5#1;cstrncmp_#t~short7#1 := 0 == cstrncmp_~n#1; 541#L520 assume !cstrncmp_#t~short7#1;call cstrncmp_#t~mem6#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~short7#1 := 0 == cstrncmp_#t~mem6#1; 542#L520-2 assume !cstrncmp_#t~short7#1;havoc cstrncmp_#t~mem6#1;havoc cstrncmp_#t~short7#1;cstrncmp_#t~post8#1.base, cstrncmp_#t~post8#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post8#1.base, 1 + cstrncmp_#t~post8#1.offset;havoc cstrncmp_#t~post8#1.base, cstrncmp_#t~post8#1.offset;cstrncmp_#t~post9#1.base, cstrncmp_#t~post9#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post9#1.base, 1 + cstrncmp_#t~post9#1.offset;havoc cstrncmp_#t~post9#1.base, cstrncmp_#t~post9#1.offset; 533#L519-5 [2022-02-21 04:35:04,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:04,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1351083896, now seen corresponding path program 1 times [2022-02-21 04:35:04,569 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:04,569 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70578587] [2022-02-21 04:35:04,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:04,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:04,584 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:04,592 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:04,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:04,593 INFO L85 PathProgramCache]: Analyzing trace with hash 79307778, now seen corresponding path program 2 times [2022-02-21 04:35:04,593 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:04,593 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809247645] [2022-02-21 04:35:04,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:04,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:04,610 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:04,614 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:04,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:04,614 INFO L85 PathProgramCache]: Analyzing trace with hash -350531861, now seen corresponding path program 1 times [2022-02-21 04:35:04,614 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:04,614 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233039225] [2022-02-21 04:35:04,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:04,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:04,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {594#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {594#true} is VALID [2022-02-21 04:35:04,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {594#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~nondet18#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet20#1, main_#t~post19#1, main_~i~1#1, main_#t~nondet21#1, main_#t~ret22#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~nondet13#1;havoc main_#t~nondet13#1;main_~length2~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {594#true} is VALID [2022-02-21 04:35:04,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {594#true} assume !(main_~length1~0#1 < 1); {594#true} is VALID [2022-02-21 04:35:04,732 INFO L290 TraceCheckUtils]: 3: Hoare triple {594#true} assume !(main_~length2~0#1 < 1); {596#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} is VALID [2022-02-21 04:35:04,732 INFO L290 TraceCheckUtils]: 4: Hoare triple {596#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;main_~i~0#1 := 0; {597#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:04,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {597#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet18#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet18#1; {597#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:04,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {597#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {597#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:04,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {597#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {597#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:04,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {597#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} main_~i~1#1 := 0; {598#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:04,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {598#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {599#(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:04,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {599#(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_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_#t~nondet21#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem6#1, cstrncmp_#t~short7#1, cstrncmp_#t~post8#1.base, cstrncmp_#t~post8#1.offset, cstrncmp_#t~post9#1.base, cstrncmp_#t~post9#1.offset, cstrncmp_#t~post2#1, cstrncmp_#t~mem3#1, cstrncmp_#t~mem4#1, cstrncmp_#t~short5#1, cstrncmp_#t~mem10#1, cstrncmp_#t~mem11#1, cstrncmp_#t~ite12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1, cstrncmp_~uc1~0#1, cstrncmp_~uc2~0#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;havoc cstrncmp_~uc1~0#1;havoc cstrncmp_~uc2~0#1; {600#(= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s2#1.base|) |ULTIMATE.start_cstrncmp_~s2#1.offset|) 0)} is VALID [2022-02-21 04:35:04,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {600#(= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s2#1.base|) |ULTIMATE.start_cstrncmp_~s2#1.offset|) 0)} assume !(0 == cstrncmp_~n#1); {600#(= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s2#1.base|) |ULTIMATE.start_cstrncmp_~s2#1.offset|) 0)} is VALID [2022-02-21 04:35:04,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {600#(= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s2#1.base|) |ULTIMATE.start_cstrncmp_~s2#1.offset|) 0)} cstrncmp_#t~post2#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post2#1 - 1;cstrncmp_#t~short5#1 := cstrncmp_#t~post2#1 > 0; {600#(= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s2#1.base|) |ULTIMATE.start_cstrncmp_~s2#1.offset|) 0)} is VALID [2022-02-21 04:35:04,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {600#(= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s2#1.base|) |ULTIMATE.start_cstrncmp_~s2#1.offset|) 0)} assume cstrncmp_#t~short5#1;call cstrncmp_#t~mem3#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);call cstrncmp_#t~mem4#1 := read~int(cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, 1);cstrncmp_#t~short5#1 := cstrncmp_#t~mem3#1 == cstrncmp_#t~mem4#1; {601#(or (not |ULTIMATE.start_cstrncmp_#t~short5#1|) (= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s1#1.base|) |ULTIMATE.start_cstrncmp_~s1#1.offset|) 0))} is VALID [2022-02-21 04:35:04,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {601#(or (not |ULTIMATE.start_cstrncmp_#t~short5#1|) (= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s1#1.base|) |ULTIMATE.start_cstrncmp_~s1#1.offset|) 0))} assume !!cstrncmp_#t~short5#1;havoc cstrncmp_#t~post2#1;havoc cstrncmp_#t~mem3#1;havoc cstrncmp_#t~mem4#1;havoc cstrncmp_#t~short5#1;cstrncmp_#t~short7#1 := 0 == cstrncmp_~n#1; {602#(= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s1#1.base|) |ULTIMATE.start_cstrncmp_~s1#1.offset|) 0)} is VALID [2022-02-21 04:35:04,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {602#(= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s1#1.base|) |ULTIMATE.start_cstrncmp_~s1#1.offset|) 0)} assume !cstrncmp_#t~short7#1;call cstrncmp_#t~mem6#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~short7#1 := 0 == cstrncmp_#t~mem6#1; {603#|ULTIMATE.start_cstrncmp_#t~short7#1|} is VALID [2022-02-21 04:35:04,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {603#|ULTIMATE.start_cstrncmp_#t~short7#1|} assume !cstrncmp_#t~short7#1;havoc cstrncmp_#t~mem6#1;havoc cstrncmp_#t~short7#1;cstrncmp_#t~post8#1.base, cstrncmp_#t~post8#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post8#1.base, 1 + cstrncmp_#t~post8#1.offset;havoc cstrncmp_#t~post8#1.base, cstrncmp_#t~post8#1.offset;cstrncmp_#t~post9#1.base, cstrncmp_#t~post9#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post9#1.base, 1 + cstrncmp_#t~post9#1.offset;havoc cstrncmp_#t~post9#1.base, cstrncmp_#t~post9#1.offset; {595#false} is VALID [2022-02-21 04:35:04,740 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:04,740 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:04,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233039225] [2022-02-21 04:35:04,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233039225] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:04,741 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:04,741 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-21 04:35:04,741 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25146518] [2022-02-21 04:35:04,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:04,916 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:04,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-21 04:35:04,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-21 04:35:04,918 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:05,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:05,171 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-02-21 04:35:05,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-21 04:35:05,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:05,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:05,188 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2022-02-21 04:35:05,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:35:05,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 20 states and 24 transitions. [2022-02-21 04:35:05,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-02-21 04:35:05,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-02-21 04:35:05,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2022-02-21 04:35:05,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:05,189 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-02-21 04:35:05,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2022-02-21 04:35:05,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-02-21 04:35:05,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:05,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 24 transitions. Second operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:05,190 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 24 transitions. Second operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:05,190 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:05,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:05,191 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-02-21 04:35:05,191 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-02-21 04:35:05,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:05,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:05,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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 20 states and 24 transitions. [2022-02-21 04:35:05,205 INFO L87 Difference]: Start difference. First operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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 20 states and 24 transitions. [2022-02-21 04:35:05,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:05,206 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-02-21 04:35:05,206 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-02-21 04:35:05,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:05,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:05,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:05,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:05,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:05,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-02-21 04:35:05,207 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-02-21 04:35:05,207 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-02-21 04:35:05,207 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 04:35:05,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2022-02-21 04:35:05,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:35:05,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:05,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:05,208 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:05,208 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 04:35:05,208 INFO L791 eck$LassoCheckResult]: Stem: 652#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 653#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~nondet18#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet20#1, main_#t~post19#1, main_~i~1#1, main_#t~nondet21#1, main_#t~ret22#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~nondet13#1;havoc main_#t~nondet13#1;main_~length2~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 661#L532 assume !(main_~length1~0#1 < 1); 654#L532-2 assume !(main_~length2~0#1 < 1); 650#L535-1 call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;main_~i~0#1 := 0; 651#L541-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet18#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet18#1; 667#L541-2 main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 668#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 664#L541-4 main_~i~1#1 := 0; 657#L546-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet20#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet20#1; 658#L546-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 659#L546-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 660#L546-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_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_#t~nondet21#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem6#1, cstrncmp_#t~short7#1, cstrncmp_#t~post8#1.base, cstrncmp_#t~post8#1.offset, cstrncmp_#t~post9#1.base, cstrncmp_#t~post9#1.offset, cstrncmp_#t~post2#1, cstrncmp_#t~mem3#1, cstrncmp_#t~mem4#1, cstrncmp_#t~short5#1, cstrncmp_#t~mem10#1, cstrncmp_#t~mem11#1, cstrncmp_#t~ite12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1, cstrncmp_~uc1~0#1, cstrncmp_~uc2~0#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;havoc cstrncmp_~uc1~0#1;havoc cstrncmp_~uc2~0#1; 665#L517 assume !(0 == cstrncmp_~n#1); 655#L519-5 [2022-02-21 04:35:05,211 INFO L793 eck$LassoCheckResult]: Loop: 655#L519-5 cstrncmp_#t~post2#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post2#1 - 1;cstrncmp_#t~short5#1 := cstrncmp_#t~post2#1 > 0; 656#L519-1 assume cstrncmp_#t~short5#1;call cstrncmp_#t~mem3#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);call cstrncmp_#t~mem4#1 := read~int(cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, 1);cstrncmp_#t~short5#1 := cstrncmp_#t~mem3#1 == cstrncmp_#t~mem4#1; 666#L519-3 assume !!cstrncmp_#t~short5#1;havoc cstrncmp_#t~post2#1;havoc cstrncmp_#t~mem3#1;havoc cstrncmp_#t~mem4#1;havoc cstrncmp_#t~short5#1;cstrncmp_#t~short7#1 := 0 == cstrncmp_~n#1; 662#L520 assume !cstrncmp_#t~short7#1;call cstrncmp_#t~mem6#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~short7#1 := 0 == cstrncmp_#t~mem6#1; 663#L520-2 assume !cstrncmp_#t~short7#1;havoc cstrncmp_#t~mem6#1;havoc cstrncmp_#t~short7#1;cstrncmp_#t~post8#1.base, cstrncmp_#t~post8#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post8#1.base, 1 + cstrncmp_#t~post8#1.offset;havoc cstrncmp_#t~post8#1.base, cstrncmp_#t~post8#1.offset;cstrncmp_#t~post9#1.base, cstrncmp_#t~post9#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post9#1.base, 1 + cstrncmp_#t~post9#1.offset;havoc cstrncmp_#t~post9#1.base, cstrncmp_#t~post9#1.offset; 655#L519-5 [2022-02-21 04:35:05,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:05,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1313217430, now seen corresponding path program 1 times [2022-02-21 04:35:05,212 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:05,212 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797279166] [2022-02-21 04:35:05,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:05,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:05,231 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:05,239 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:05,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:05,240 INFO L85 PathProgramCache]: Analyzing trace with hash 79307778, now seen corresponding path program 3 times [2022-02-21 04:35:05,240 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:05,240 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926564467] [2022-02-21 04:35:05,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:05,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:05,246 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:05,251 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:05,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:05,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1018233459, now seen corresponding path program 1 times [2022-02-21 04:35:05,251 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:05,251 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233303731] [2022-02-21 04:35:05,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:05,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:05,268 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:05,280 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:06,095 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:06,095 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:06,095 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:06,111 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:06,111 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:06,111 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:06,111 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:06,111 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:06,111 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncmp-alloca-1.i_Iteration6_Lasso [2022-02-21 04:35:06,112 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:06,112 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:06,114 INFO L141 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:06,118 INFO L141 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:06,119 INFO L141 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:06,121 INFO L141 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:06,123 INFO L141 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:06,125 INFO L141 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:06,126 INFO L141 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:06,129 INFO L141 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:06,131 INFO L141 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:06,132 INFO L141 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:06,134 INFO L141 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:06,136 INFO L141 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:06,137 INFO L141 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:06,139 INFO L141 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:06,140 INFO L141 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:06,142 INFO L141 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:06,144 INFO L141 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:06,145 INFO L141 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:06,147 INFO L141 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:06,149 INFO L141 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:06,150 INFO L141 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:06,153 INFO L141 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:06,759 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 04:35:06,760 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 04:35:06,767 INFO L141 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:06,769 INFO L141 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:06,771 INFO L141 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:06,773 INFO L141 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:06,775 INFO L141 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:06,776 INFO L141 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:06,778 INFO L141 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:06,786 INFO L141 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:06,788 INFO L141 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:07,435 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:07,436 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:07,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:07,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:07,438 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:07,442 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:07,443 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:07,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:07,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:07,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:07,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:07,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:07,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:07,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:07,452 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:07,467 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:07,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:07,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:07,469 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:07,470 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:07,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:07,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:07,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:07,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:07,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:07,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:07,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:07,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:07,520 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:07,535 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:07,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:07,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:07,536 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:07,538 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:07,539 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:07,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:07,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:07,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:07,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:07,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:07,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:07,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:07,560 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:07,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:07,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:07,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:07,577 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:07,578 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:07,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:07,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:07,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:07,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:07,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:07,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:07,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:07,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:07,587 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:07,602 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:07,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:07,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:07,604 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:07,604 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:07,606 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:07,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:07,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:07,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:07,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:07,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:07,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:07,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:07,619 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:07,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:07,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:07,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:07,636 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:07,638 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:07,639 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:07,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:07,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:07,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:07,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:07,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:07,652 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:07,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:07,653 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:07,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:07,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:07,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:07,672 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:07,673 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:07,674 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:07,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:07,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:07,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:07,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:07,683 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:07,683 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:07,685 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:07,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:07,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:07,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:07,702 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:07,703 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:07,705 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:07,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:07,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:07,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:07,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:07,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:07,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:07,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:07,720 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:07,736 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:07,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:07,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:07,737 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:07,738 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:07,739 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:07,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:07,745 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:07,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:07,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:07,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:07,746 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:07,746 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:07,760 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:07,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:07,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:07,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:07,792 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:07,793 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:07,794 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:07,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:07,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:07,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:07,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:07,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:07,801 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:07,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:07,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:07,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:07,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:07,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:07,834 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:07,835 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:07,836 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:07,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:07,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:07,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:07,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:07,843 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:07,843 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:07,858 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:07,875 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:07,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:07,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:07,877 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:07,878 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:07,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:07,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:07,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:07,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:07,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:07,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:07,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:07,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:07,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:07,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:07,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:07,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:07,906 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:07,907 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:07,908 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:07,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:07,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:07,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:07,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:07,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:07,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:07,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:07,929 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:07,945 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:07,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:07,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:07,946 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:07,947 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:07,950 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:07,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:07,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:07,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:07,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:07,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:07,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:07,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:07,964 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:07,987 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:07,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:07,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:07,989 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:07,989 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:07,991 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:07,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:07,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:07,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:07,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:07,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:07,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:07,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:08,028 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:08,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:08,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:08,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:08,047 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:08,048 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:08,050 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:08,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:08,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:08,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:08,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:08,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:08,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:08,059 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:08,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:08,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:08,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:08,078 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:08,079 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:08,081 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:08,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:08,087 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:08,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:08,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:08,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:08,088 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:08,088 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:08,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:08,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:08,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:08,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:08,117 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:08,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-02-21 04:35:08,121 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:08,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:08,127 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:08,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:08,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:08,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:08,128 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:08,128 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:08,142 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:08,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:08,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:08,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:08,158 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:08,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-02-21 04:35:08,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:08,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:08,166 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:08,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:08,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:08,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:08,167 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:08,167 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:08,168 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:08,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:08,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:08,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:08,186 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:08,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-02-21 04:35:08,188 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:08,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:08,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:08,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:08,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:08,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:08,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:08,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:08,210 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:08,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:08,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:08,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:08,226 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:08,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-02-21 04:35:08,229 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:08,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:08,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:08,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:08,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:08,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:08,236 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:08,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:08,237 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:08,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-02-21 04:35:08,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:08,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:08,254 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:08,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-02-21 04:35:08,257 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:08,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:08,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:08,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:08,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:08,265 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:08,265 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:08,277 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:08,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-02-21 04:35:08,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:08,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:08,293 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:08,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-02-21 04:35:08,295 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:08,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:08,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:08,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:08,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:08,302 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:08,303 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:08,318 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:08,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:08,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:08,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:08,336 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:08,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-02-21 04:35:08,339 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:08,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:08,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:08,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:08,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:08,346 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:08,346 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:08,361 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:08,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-02-21 04:35:08,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:08,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:08,378 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:08,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-02-21 04:35:08,380 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:08,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:08,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:08,386 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 04:35:08,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:08,392 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-02-21 04:35:08,392 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:35:08,411 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:08,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:08,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:08,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:08,428 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:08,430 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:08,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-02-21 04:35:08,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:08,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:08,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:08,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:08,446 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:08,447 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:08,471 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:08,511 INFO L443 ModelExtractionUtils]: Simplification made 26 calls to the SMT solver. [2022-02-21 04:35:08,511 INFO L444 ModelExtractionUtils]: 17 out of 49 variables were initially zero. Simplification set additionally 29 variables to zero. [2022-02-21 04:35:08,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:08,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:08,513 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:08,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-02-21 04:35:08,515 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:08,523 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:08,523 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:08,523 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc15#1.base)_3, ULTIMATE.start_cstrncmp_~s1#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc15#1.base)_3 - 1*ULTIMATE.start_cstrncmp_~s1#1.offset Supporting invariants [] [2022-02-21 04:35:08,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:08,674 INFO L297 tatePredicateManager]: 21 out of 22 supporting invariants were superfluous and have been removed [2022-02-21 04:35:08,679 INFO L390 LassoCheck]: Loop: "cstrncmp_#t~post2#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post2#1 - 1;cstrncmp_#t~short5#1 := cstrncmp_#t~post2#1 > 0;" "assume cstrncmp_#t~short5#1;call cstrncmp_#t~mem3#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);call cstrncmp_#t~mem4#1 := read~int(cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, 1);cstrncmp_#t~short5#1 := cstrncmp_#t~mem3#1 == cstrncmp_#t~mem4#1;" "assume !!cstrncmp_#t~short5#1;havoc cstrncmp_#t~post2#1;havoc cstrncmp_#t~mem3#1;havoc cstrncmp_#t~mem4#1;havoc cstrncmp_#t~short5#1;cstrncmp_#t~short7#1 := 0 == cstrncmp_~n#1;" "assume !cstrncmp_#t~short7#1;call cstrncmp_#t~mem6#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~short7#1 := 0 == cstrncmp_#t~mem6#1;" "assume !cstrncmp_#t~short7#1;havoc cstrncmp_#t~mem6#1;havoc cstrncmp_#t~short7#1;cstrncmp_#t~post8#1.base, cstrncmp_#t~post8#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post8#1.base, 1 + cstrncmp_#t~post8#1.offset;havoc cstrncmp_#t~post8#1.base, cstrncmp_#t~post8#1.offset;cstrncmp_#t~post9#1.base, cstrncmp_#t~post9#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post9#1.base, 1 + cstrncmp_#t~post9#1.offset;havoc cstrncmp_#t~post9#1.base, cstrncmp_#t~post9#1.offset;" [2022-02-21 04:35:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:08,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:08,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:35:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:08,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:08,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {718#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {718#unseeded} is VALID [2022-02-21 04:35:08,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {718#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~nondet18#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet20#1, main_#t~post19#1, main_~i~1#1, main_#t~nondet21#1, main_#t~ret22#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~nondet13#1;havoc main_#t~nondet13#1;main_~length2~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {718#unseeded} is VALID [2022-02-21 04:35:08,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {718#unseeded} assume !(main_~length1~0#1 < 1); {718#unseeded} is VALID [2022-02-21 04:35:08,825 INFO L290 TraceCheckUtils]: 3: Hoare triple {718#unseeded} assume !(main_~length2~0#1 < 1); {718#unseeded} is VALID [2022-02-21 04:35:08,825 INFO L290 TraceCheckUtils]: 4: Hoare triple {718#unseeded} call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;main_~i~0#1 := 0; {863#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_main_#t~malloc15#1.base|) unseeded)} is VALID [2022-02-21 04:35:08,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {863#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_main_#t~malloc15#1.base|) unseeded)} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet18#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet18#1; {863#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_main_#t~malloc15#1.base|) unseeded)} is VALID [2022-02-21 04:35:08,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {863#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_main_#t~malloc15#1.base|) unseeded)} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {863#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_main_#t~malloc15#1.base|) unseeded)} is VALID [2022-02-21 04:35:08,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {863#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_main_#t~malloc15#1.base|) unseeded)} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {863#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_main_#t~malloc15#1.base|) unseeded)} is VALID [2022-02-21 04:35:08,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {863#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_main_#t~malloc15#1.base|) unseeded)} main_~i~1#1 := 0; {863#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_main_#t~malloc15#1.base|) unseeded)} is VALID [2022-02-21 04:35:08,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {863#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_main_#t~malloc15#1.base|) unseeded)} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet20#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet20#1; {863#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_main_#t~malloc15#1.base|) unseeded)} is VALID [2022-02-21 04:35:08,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {863#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_main_#t~malloc15#1.base|) unseeded)} main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {863#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_main_#t~malloc15#1.base|) unseeded)} is VALID [2022-02-21 04:35:08,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {863#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_main_#t~malloc15#1.base|) unseeded)} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {863#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_main_#t~malloc15#1.base|) unseeded)} is VALID [2022-02-21 04:35:08,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {863#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_main_#t~malloc15#1.base|) 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_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_#t~nondet21#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem6#1, cstrncmp_#t~short7#1, cstrncmp_#t~post8#1.base, cstrncmp_#t~post8#1.offset, cstrncmp_#t~post9#1.base, cstrncmp_#t~post9#1.offset, cstrncmp_#t~post2#1, cstrncmp_#t~mem3#1, cstrncmp_#t~mem4#1, cstrncmp_#t~short5#1, cstrncmp_#t~mem10#1, cstrncmp_#t~mem11#1, cstrncmp_#t~ite12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1, cstrncmp_~uc1~0#1, cstrncmp_~uc2~0#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;havoc cstrncmp_~uc1~0#1;havoc cstrncmp_~uc2~0#1; {842#(and (= |ULTIMATE.start_main_#t~malloc15#1.base| |ULTIMATE.start_cstrncmp_~s1#1.base|) unseeded)} is VALID [2022-02-21 04:35:08,837 INFO L290 TraceCheckUtils]: 13: Hoare triple {842#(and (= |ULTIMATE.start_main_#t~malloc15#1.base| |ULTIMATE.start_cstrncmp_~s1#1.base|) unseeded)} assume !(0 == cstrncmp_~n#1); {842#(and (= |ULTIMATE.start_main_#t~malloc15#1.base| |ULTIMATE.start_cstrncmp_~s1#1.base|) unseeded)} is VALID [2022-02-21 04:35:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:08,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:35:08,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:08,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:08,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {843#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrncmp_~s1#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc15#1.base|))) (= |ULTIMATE.start_main_#t~malloc15#1.base| |ULTIMATE.start_cstrncmp_~s1#1.base|))} cstrncmp_#t~post2#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post2#1 - 1;cstrncmp_#t~short5#1 := cstrncmp_#t~post2#1 > 0; {843#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrncmp_~s1#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc15#1.base|))) (= |ULTIMATE.start_main_#t~malloc15#1.base| |ULTIMATE.start_cstrncmp_~s1#1.base|))} is VALID [2022-02-21 04:35:08,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {843#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrncmp_~s1#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc15#1.base|))) (= |ULTIMATE.start_main_#t~malloc15#1.base| |ULTIMATE.start_cstrncmp_~s1#1.base|))} assume cstrncmp_#t~short5#1;call cstrncmp_#t~mem3#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);call cstrncmp_#t~mem4#1 := read~int(cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, 1);cstrncmp_#t~short5#1 := cstrncmp_#t~mem3#1 == cstrncmp_#t~mem4#1; {894#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrncmp_~s1#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc15#1.base|))) (= |ULTIMATE.start_main_#t~malloc15#1.base| |ULTIMATE.start_cstrncmp_~s1#1.base|) (<= (+ |ULTIMATE.start_cstrncmp_~s1#1.offset| 1) (select |#length| |ULTIMATE.start_cstrncmp_~s1#1.base|)))} is VALID [2022-02-21 04:35:08,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {894#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrncmp_~s1#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc15#1.base|))) (= |ULTIMATE.start_main_#t~malloc15#1.base| |ULTIMATE.start_cstrncmp_~s1#1.base|) (<= (+ |ULTIMATE.start_cstrncmp_~s1#1.offset| 1) (select |#length| |ULTIMATE.start_cstrncmp_~s1#1.base|)))} assume !!cstrncmp_#t~short5#1;havoc cstrncmp_#t~post2#1;havoc cstrncmp_#t~mem3#1;havoc cstrncmp_#t~mem4#1;havoc cstrncmp_#t~short5#1;cstrncmp_#t~short7#1 := 0 == cstrncmp_~n#1; {894#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrncmp_~s1#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc15#1.base|))) (= |ULTIMATE.start_main_#t~malloc15#1.base| |ULTIMATE.start_cstrncmp_~s1#1.base|) (<= (+ |ULTIMATE.start_cstrncmp_~s1#1.offset| 1) (select |#length| |ULTIMATE.start_cstrncmp_~s1#1.base|)))} is VALID [2022-02-21 04:35:08,926 INFO L290 TraceCheckUtils]: 3: Hoare triple {894#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrncmp_~s1#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc15#1.base|))) (= |ULTIMATE.start_main_#t~malloc15#1.base| |ULTIMATE.start_cstrncmp_~s1#1.base|) (<= (+ |ULTIMATE.start_cstrncmp_~s1#1.offset| 1) (select |#length| |ULTIMATE.start_cstrncmp_~s1#1.base|)))} assume !cstrncmp_#t~short7#1;call cstrncmp_#t~mem6#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~short7#1 := 0 == cstrncmp_#t~mem6#1; {894#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrncmp_~s1#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc15#1.base|))) (= |ULTIMATE.start_main_#t~malloc15#1.base| |ULTIMATE.start_cstrncmp_~s1#1.base|) (<= (+ |ULTIMATE.start_cstrncmp_~s1#1.offset| 1) (select |#length| |ULTIMATE.start_cstrncmp_~s1#1.base|)))} is VALID [2022-02-21 04:35:08,926 INFO L290 TraceCheckUtils]: 4: Hoare triple {894#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrncmp_~s1#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc15#1.base|))) (= |ULTIMATE.start_main_#t~malloc15#1.base| |ULTIMATE.start_cstrncmp_~s1#1.base|) (<= (+ |ULTIMATE.start_cstrncmp_~s1#1.offset| 1) (select |#length| |ULTIMATE.start_cstrncmp_~s1#1.base|)))} assume !cstrncmp_#t~short7#1;havoc cstrncmp_#t~mem6#1;havoc cstrncmp_#t~short7#1;cstrncmp_#t~post8#1.base, cstrncmp_#t~post8#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post8#1.base, 1 + cstrncmp_#t~post8#1.offset;havoc cstrncmp_#t~post8#1.base, cstrncmp_#t~post8#1.offset;cstrncmp_#t~post9#1.base, cstrncmp_#t~post9#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post9#1.base, 1 + cstrncmp_#t~post9#1.offset;havoc cstrncmp_#t~post9#1.base, cstrncmp_#t~post9#1.offset; {845#(and (= |ULTIMATE.start_main_#t~malloc15#1.base| |ULTIMATE.start_cstrncmp_~s1#1.base|) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrncmp_~s1#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc15#1.base|)))) unseeded))} is VALID [2022-02-21 04:35:08,926 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:08,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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:08,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:08,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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:08,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:08,937 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2022-02-21 04:35:08,937 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 7 Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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:09,017 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 7. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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 24 states and 29 transitions. Complement of second has 8 states. [2022-02-21 04:35:09,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:09,017 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:09,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. cyclomatic complexity: 7 [2022-02-21 04:35:09,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:09,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:09,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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:09,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:09,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:09,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:09,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2022-02-21 04:35:09,019 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:09,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:09,019 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 23 transitions. cyclomatic complexity: 7 [2022-02-21 04:35:09,019 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 04:35:09,019 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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:09,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:09,020 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:09,020 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 29 transitions. cyclomatic complexity: 8 [2022-02-21 04:35:09,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. cyclomatic complexity: 8 [2022-02-21 04:35:09,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:09,020 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:35:09,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 5 letters. [2022-02-21 04:35:09,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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:09,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 29 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 5 letters. [2022-02-21 04:35:09,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:35:09,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:35:09,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 29 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:35:09,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 24 letters. Loop has 24 letters. [2022-02-21 04:35:09,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 24 letters. [2022-02-21 04:35:09,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 29 transitions. cyclomatic complexity: 8 Stem has 24 letters. Loop has 24 letters. [2022-02-21 04:35:09,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 19 letters. Loop has 19 letters. [2022-02-21 04:35:09,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 19 letters. [2022-02-21 04:35:09,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 29 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 19 letters. [2022-02-21 04:35:09,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 6 letters. [2022-02-21 04:35:09,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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 6 letters. [2022-02-21 04:35:09,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 29 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 6 letters. [2022-02-21 04:35:09,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 5 letters. [2022-02-21 04:35:09,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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:09,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 29 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 5 letters. [2022-02-21 04:35:09,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:35:09,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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:09,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 29 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:35:09,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:35:09,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:35:09,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 29 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:35:09,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 16 letters. Loop has 5 letters. [2022-02-21 04:35:09,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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:09,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 29 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 5 letters. [2022-02-21 04:35:09,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 5 letters. [2022-02-21 04:35:09,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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:09,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 29 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 5 letters. [2022-02-21 04:35:09,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:35:09,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:35:09,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 29 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:35:09,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,028 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:09,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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:09,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2022-02-21 04:35:09,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 14 letters. Loop has 5 letters. [2022-02-21 04:35:09,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 19 letters. Loop has 5 letters. [2022-02-21 04:35:09,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 14 letters. Loop has 10 letters. [2022-02-21 04:35:09,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. cyclomatic complexity: 8 [2022-02-21 04:35:09,029 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:09,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2022-02-21 04:35:09,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:35:09,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:35:09,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:35:09,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:09,030 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:09,030 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:09,030 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:09,030 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 04:35:09,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:35:09,030 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:09,030 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:09,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:35:09 BoogieIcfgContainer [2022-02-21 04:35:09,034 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:35:09,035 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:35:09,035 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:35:09,035 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:35:09,035 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:00" (3/4) ... [2022-02-21 04:35:09,037 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:35:09,037 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:35:09,037 INFO L158 Benchmark]: Toolchain (without parser) took 9759.59ms. Allocated memory was 113.2MB in the beginning and 197.1MB in the end (delta: 83.9MB). Free memory was 75.8MB in the beginning and 77.1MB in the end (delta: -1.3MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB. [2022-02-21 04:35:09,038 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 113.2MB. Free memory was 84.0MB in the beginning and 84.0MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:09,038 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.60ms. Allocated memory is still 113.2MB. Free memory was 75.6MB in the beginning and 79.5MB in the end (delta: -3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 04:35:09,038 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.55ms. Allocated memory is still 113.2MB. Free memory was 79.1MB in the beginning and 77.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:09,038 INFO L158 Benchmark]: Boogie Preprocessor took 16.18ms. Allocated memory is still 113.2MB. Free memory was 77.0MB in the beginning and 75.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:09,038 INFO L158 Benchmark]: RCFGBuilder took 420.99ms. Allocated memory is still 113.2MB. Free memory was 75.3MB in the beginning and 59.6MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-21 04:35:09,038 INFO L158 Benchmark]: BuchiAutomizer took 8829.06ms. Allocated memory was 113.2MB in the beginning and 197.1MB in the end (delta: 83.9MB). Free memory was 59.6MB in the beginning and 78.1MB in the end (delta: -18.5MB). Peak memory consumption was 67.0MB. Max. memory is 16.1GB. [2022-02-21 04:35:09,039 INFO L158 Benchmark]: Witness Printer took 2.15ms. Allocated memory is still 197.1MB. Free memory was 78.1MB in the beginning and 77.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:09,040 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.22ms. Allocated memory is still 113.2MB. Free memory was 84.0MB in the beginning and 84.0MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 458.60ms. Allocated memory is still 113.2MB. Free memory was 75.6MB in the beginning and 79.5MB in the end (delta: -3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.55ms. Allocated memory is still 113.2MB. Free memory was 79.1MB in the beginning and 77.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.18ms. Allocated memory is still 113.2MB. Free memory was 77.0MB in the beginning and 75.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 420.99ms. Allocated memory is still 113.2MB. Free memory was 75.3MB in the beginning and 59.6MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 8829.06ms. Allocated memory was 113.2MB in the beginning and 197.1MB in the end (delta: 83.9MB). Free memory was 59.6MB in the beginning and 78.1MB in the end (delta: -18.5MB). Peak memory consumption was 67.0MB. Max. memory is 16.1GB. * Witness Printer took 2.15ms. Allocated memory is still 197.1MB. Free memory was 78.1MB in the beginning and 77.1MB in the end (delta: 1.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 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + -1 * nondetString1 + unknown-#length-unknown[nondetString1] and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[nondetString2] + -1 * nondetString2 + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.7s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 7.3s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 161 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 161 mSDsluCounter, 302 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 193 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 152 IncrementalHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 109 mSDtfsCounter, 152 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital206 mio100 ax111 hnf100 lsp82 ukn75 mio100 lsp48 div100 bol100 ite100 ukn100 eq178 hnf90 smp97 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 33ms VariablesStem: 6 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:35:09,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-02-21 04:35:09,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE